MétaCan
Menu
Back to cohort
Record W4403575206 · doi:10.48550/arxiv.2410.11777

Measure estimation on a manifold explored by a diffusion process

2024· preprint· en· W4403575206 on OpenAlexafffund
Vincent Divol, Hélène Guérin, Dinh–Toan Nguyen

Bibliographic record

VenuearXiv (Cornell University) · 2024
Typepreprint
Languageen
FieldMathematics
TopicMarkov Chains and Monte Carlo Methods
Canadian institutionsUniversité du Québec à Montréal
FundersNatural Sciences and Engineering Research Council of CanadaLabex BézoutAgence Nationale de la RechercheEuropean Commission
KeywordsMeasure (data warehouse)EstimationDiffusionDiffusion processManifold (fluid mechanics)Process (computing)MathematicsComputer scienceStatistical physicsData miningEconomicsPhysicsInnovation diffusionEngineeringMechanical engineering

Abstract

fetched live from OpenAlex

From the observation of a diffusion path $(X_t)_{t\in [0,T]}$ on a compact connected $d$-dimensional manifold $\mathcal{M}$ without boundary, we consider the problem of estimating the stationary measure $μ$ of the process. Wang and Zhu (2023) showed that for the Wasserstein metric $\mathcal{W}_2$ and for $d\geq 5$, the convergence rate of $T^{-1/(d-2)}$ is attained by the occupation measure of the path $(X_t)_{t\in [0,T]}$ when $(X_t)_{t\in [0,T]}$ is a Langevin diffusion. We extend their result in several directions. First, we show that the rate of convergence holds for a large class of diffusion paths, whose generators are uniformly elliptic. Second, the regularity of the density $p$ of the stationary measure $μ$ with respect to the volume measure of $\mathcal{M}$ can be leveraged to obtain faster estimators: when $p$ belongs to a Sobolev space of order $\ell\geq 2$, smoothing the occupation measure by convolution with a kernel yields an estimator whose rate of convergence is of order $T^{-(\ell+1)/(2\ell+d-2)}$. We further show that this rate is the minimax rate of estimation for this problem.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0010.003
Open science0.0020.002
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0010.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.163
GPT teacher head0.263
Teacher spread0.100 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes2
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicMarkov Chains and Monte Carlo MethodsFrench-language works237,207