Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 33 min ago
PreprintarXiv licencearXiv

Estimation and Inference for Latent Markov Models by Fourier Recursions

Abstract

This paper proposes a new theoretically exact Fourier recursion framework for a broad class of latent Markov models (LMMs), encompassing models widely used across a broad range of fields in economics. It can be viewed as a counterpart of the celebrated Kalman filter for non-Gaussian and nonlinear LMMs. Closed-form recursive updates of Fourier coefficients jointly deliver filtering, likelihood evaluation, and simultaneously accumulate the score and Hessian online. We introduce a unified truncated implementation that ensures uniform error control and numerical stability, preventing approximation errors from accumulating through the recursion. We establish asymptotic properties of the feasible maximum likelihood estimator for LMMs, provide a recursion-based consistent estimator for the Fisher information and discuss the possible model misspecification. These results provide the first general asymptotic theory for feasible approximate maximum likelihood estimation in LMMs. Simulations demonstrate its accuracy and stability, while an application to U.S. bankruptcy data recovers a persistent latent bankruptcy-pressure process.

Related

  1. Posterior Regimes and Latent Deception: Variational Bayesian Inference in Hidden Markov Models for Sequential Fraud Detection in Financial Transactions
    Joseph Uririoghene Obukofe, Anthony O'Hare, Chioma Sandra Dike
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Causal Mediation Analysis with High-Dimensional Surrogates: Identification, Estimation and Inference under Latent Factor Models
    Himani Yadav, Shi Bo, AmirEmad Ghassami +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Deterministic Uniformization for Estimation and Latent Trajectory Inference in Interval-Censored Multistate Triansition Models
    Yuxi Zhu
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Stable by Construction: Variational Latent Markov Operators for Long-Horizon PDE Prediction
    Junyi Liao, Johann Guilleminot, Vahid Tarokh
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Active Inference as a Convex Markov Decision Process
    Nikola Milosevic, Nicolás Hinrichs, Nico Scherf
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{huang2026estimation,
  title = {{Estimation and Inference for Latent Markov Models by Fourier Recursions}},
  author = {Yanqi Huang and Chenxu Li and Qiwei Yao},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.07392},
  eprint = {2609.07392},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.07392},
}
RIS
TY  - UNPB
TI  - Estimation and Inference for Latent Markov Models by Fourier Recursions
AU  - Yanqi Huang
AU  - Chenxu Li
AU  - Qiwei Yao
PY  - 2026
DA  - 2026/09/07
PB  - arXiv
DO  - 10.48550/arxiv.2609.07392
UR  - https://arxiv.org/abs/2609.07392
AB  - This paper proposes a new theoretically exact Fourier recursion framework for a broad class of latent Markov models (LMMs), encompassing models widely used across a broad range of fields in economics. It can be viewed as a counterpart of the celebrated Kalman filter for non-Gaussian and nonlinear LMMs. Closed-form recursive updates of Fourier coefficients jointly deliver filtering, likelihood evaluation, and simultaneously accumulate the score and Hessian online. We introduce a unified truncated implementation that ensures uniform error control and numerical stability, preventing approximation errors from accumulating through the recursion. We establish asymptotic properties of the feasible maximum likelihood estimator for LMMs, provide a recursion-based consistent estimator for the Fisher information and discuss the possible model misspecification. These results provide the first general asymptotic theory for feasible approximate maximum likelihood estimation in LMMs. Simulations demonstrate its accuracy and stability, while an application to U.S. bankruptcy data recovers a persistent latent bankruptcy-pressure process.
ER  -