Approximate maximum likelihood estimation for one‐dimensional diffusions observed on a fine grid
Bibliographic record
Abstract
Abstract We consider a one‐dimensional stochastic differential equation that is observed on a fine grid of equally spaced time points. A novel approach for approximating the transition density of the stochastic differential equation is presented, which is based on an Itô‐Taylor expansion of the sample path, combined with an application of the so‐called ‐expansion. The resulting approximation is economical with respect to the number of terms needed to achieve a given level of accuracy in a high‐frequency sampling framework. This method of density approximation leads to a closed‐form approximate likelihood function from which an approximate maximum likelihood estimator may be calculated numerically. A detailed theoretical analysis of the proposed estimator is provided and it is shown that it compares favorably to the Gaussian likelihood‐based estimator and does an excellent job of approximating the exact, but usually intractable, maximum likelihood estimator. Numerical simulations indicate that the exact and our approximate maximum likelihood estimator tend to be close, and the latter performs very well relative to other approximate methods in the literature in terms of speed, accuracy, and ease of implementation.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.017 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".