Measure valued differentiation for stochastic processes : the finite horizon case
Bibliographic record
Abstract
This paper addresses the problem of sensitivity analysis for finite horizon performance measures of general Markov chains.We derive closed form expressions and associated unbiased gradient estimators for derivatives of finite products of Markov kernels by measure-valued differentiation (MVD).In the MVD setting, derivatives of Markov kernels, called D-derivatives, are defined with respect to an appropriately defined class of performance functions D, such that for any performance measure g D the derivative of the integral of g with respect to the one step transition probability of the Markov chain exists.The MVD approach (1) yields results that that can be applied to performance functions out of a predefined class, (2) allows for a product rule of differentiation, that is, analyzing the derivative of the transition kernel immediately yields finite horizon results, (3) provides an operator language approach to differentiation of Markov chains and (4) clearly identifies the trade-off between the generality of performance classes that can be analyzed and the generality of the classes of measures (Markov kernels).The D-derivative of a measure can be interpreted in terms of various (unbiased) gradient estimators and the product rule for D-differentiation yields a product-rule for various gradient estimators.
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.009 | 0.033 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.003 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| 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".