Discrete‐Time Risk‐Sensitive Filters with Non‐Gaussian Initial Conditions and Their Ergodic Properties
Bibliographic record
Abstract
ABSTRACT In this paper, we study asymptotic stability properties of risk‐sensitive filters with respect to their initial conditions. In particular, we consider a linear time‐invariant systems with initial conditions that are not necessarily Gaussian. We show that in the case of Gaussian initial conditions, the optimal risk‐sensitive filter asymptotically converges to a suboptimal filter initialized with an incorrect covariance matrix for the initial state vector in the mean square sense provided the incorrect initializing value for the covariance matrix results in a risk‐sensitive filter that is asymptotically stable, that is, results in a solution for a Riccati equation that is asymptotically stabilizing. For non‐Gaussian initial conditions, we derive the expression for the risk‐sensitive filter in terms of a finite number of parameters. Under a boundedness assumption satisfied by the fourth order absolute moment of the initial state variable and a slow growth condition satisfied by a certain Radon‐Nikodym derivative, we show that a suboptimal risk‐sensitive filter initialized with Gaussian initial conditions asymptotically approaches the optimal risk‐sensitive filter for non‐Gaussian initial conditions in the mean square sense. Some examples are also given to substantiate our claims.
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.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".