MétaCan
Menu
Back to cohort
Record W2577190964 · doi:10.1142/s0218348x18500767

ITERATED FUNCTION SYSTEMS WITH PLACE-DEPENDENT PROBABILITIES AND THE INVERSE PROBLEM OF MEASURE APPROXIMATION USING MOMENTS

2018· article· en· W2577190964 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

VenueFractals · 2018
Typearticle
Languageen
FieldMathematics
TopicMathematical Dynamics and Fractals
Canadian institutionsAcadia UniversityUniversity of Waterloo
Fundersnot available
KeywordsMathematicsMoment (physics)Measure (data warehouse)Probability measureMoment problemIterated functionMetric (unit)Matching (statistics)Iterated function systemInverseInvariant measureOperator (biology)Moment-generating functionCombinatoricsDiscrete mathematicsProbability distributionMathematical analysisStatisticsComputer sciencePrinciple of maximum entropy

Abstract

fetched live from OpenAlex

We are concerned with the approximation of probability measures on a compact metric space [Formula: see text] by invariant measures of iterated function systems with place-dependent probabilities (IFSPDPs). The approximation is performed by moment matching. Associated with an IFSPDP is a linear operator [Formula: see text], where [Formula: see text] denotes the set of all infinite moment vectors of probability measures on [Formula: see text]. Let [Formula: see text] be a probability measure that we desire to approximate, with moment vector [Formula: see text]. We then look for an IFSPDP which maps [Formula: see text] as close to itself as possible in terms of an appropriate metric on [Formula: see text]. Some computational results are presented.

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.000
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.620
Threshold uncertainty score0.361

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
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.035
GPT teacher head0.260
Teacher spread0.224 · 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