MétaCan
Menu
Back to cohort
Record W2047065605 · doi:10.1080/14689367.2015.1006585

Optimal chaotic selectors

2015· article· en· W2047065605 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueDynamical Systems · 2015
Typearticle
Languageen
FieldMathematics
TopicMathematical Dynamics and Fractals
Canadian institutionsConcordia University
Fundersnot available
KeywordsMathematicsPartition (number theory)PiecewiseBounded functionInvariant (physics)CombinatoricsDistribution (mathematics)Discrete mathematicsOperator (biology)ChaoticMathematical analysisComputer science

Abstract

fetched live from OpenAlex

Multivalued maps have many applications. We consider one-dimensional multivalued maps whose graphs are defined by lower and upper boundary maps. Let I = [0, 1] and let be a partition of I into a finite number of intervals. Let τℓ, τu: I → I be two piecewise expanding maps on such that τℓ ≤ τu. Let G ⊂ I×I be the region bounded by the graphs of τℓ and τu. Any map η: I → I that takes values in G is called a selector of the multivalued map defined by G. We assume that τℓ and τu as well as all the selectors we consider have invariant distribution functions. Let F* be a target distribution. We prove the existence of a selector η* which minimizes the functional , where η has invariant distribution Fη. Other results pertain to the functional , where Pη is the Frobenius–Perron operator of η acting on distribution functions. We present an algorithm for finding selectors which minimize J1(η).

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.919
Threshold uncertainty score0.653

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.058
GPT teacher head0.305
Teacher spread0.247 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it