Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 40 min ago
PreprintarXiv licencearXiv

SAUSS: Stochastic Approximation with Unbiased Simulated Scores for Limited Dependent Variable Models

Abstract

Simulated maximum likelihood is widely used in latent-variable models where likelihood evaluation requires intractable integrals or probabilities. With a fixed number of simulation draws, its estimating equation is generally biased. We develop Stochastic Approximation with Unbiased Simulated Scores (SAUSS), combining score simulation with stochastic gradient descent. The Hajivassiliou--McFadden identity, an instance of Fisher's identity, expresses the likelihood score as the conditional expectation of the complete-data score given the observed data. Exact conditional draws yield an unbiased simulated score for any fixed number of draws. The estimator averages stochastic gradient iterates computed using mini-batches of fixed size regardless of sample size, avoiding repeated full-sample likelihood evaluations. Under local regularity and initialization conditions, we establish asymptotic normality and a functional central limit theorem for the partial-sum process of the iterates under multi-pass sampling from an observed sample. These results support plug-in and random-scaling confidence intervals that remain asymptotically valid when algorithmic uncertainty is non-negligible relative to sampling uncertainty. We develop multinomial probit as a leading application. In simulations and two applications, SAUSS returns estimates in every reported run, including cases where the simulated maximum likelihood implementation returns none. When both return estimates, SAUSS gives comparable estimates in less time.

Related

  1. Analysis and approximation for inverse potential problem of space-dependent variable-exponent sub-diffusion in heterogeneous medium
    Zhiyuan Li, Chunlong Sun, Xiangcheng Zheng
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Curvature-Dependent Path Concentration in Stochastic Fast-Slow Systems with Noise on the Slow Variable
    Yefan Wu
    arXivPreprintarXiv licenceFull textDynamical systemsProbabilityarXiv
  3. Numerical approximation for stochastic differential equations with state-dependent fast switching
    Xiaobin Sun, Mingkun Ye, Zuozheng Zhang
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingProbabilityarXiv
  4. Unbiased Low-Rank Approximation for Repeated Matrix-Vector Multiplication: Stability and Optimal Sampling
    Kang Liu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryNumerical analysis & scientific computingarXiv
  5. Coupled unbiased MCMC for estimating Shapley effects under dependent inputs
    Masataka Hirono, Takashi Goda
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{lee2026sauss,
  title = {{SAUSS: Stochastic Approximation with Unbiased Simulated Scores for Limited Dependent Variable Models}},
  author = {Sokbae Lee and Yuan Liao and Myung Hwan Seo and Youngki Shin},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2608.25304},
  eprint = {2608.25304},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.25304},
}
RIS
TY  - UNPB
TI  - SAUSS: Stochastic Approximation with Unbiased Simulated Scores for Limited Dependent Variable Models
AU  - Sokbae Lee
AU  - Yuan Liao
AU  - Myung Hwan Seo
AU  - Youngki Shin
PY  - 2026
DA  - 2026/10/23
PB  - arXiv
DO  - 10.48550/arxiv.2608.25304
UR  - https://arxiv.org/abs/2608.25304
AB  - Simulated maximum likelihood is widely used in latent-variable models where likelihood evaluation requires intractable integrals or probabilities. With a fixed number of simulation draws, its estimating equation is generally biased. We develop Stochastic Approximation with Unbiased Simulated Scores (SAUSS), combining score simulation with stochastic gradient descent. The Hajivassiliou--McFadden identity, an instance of Fisher's identity, expresses the likelihood score as the conditional expectation of the complete-data score given the observed data. Exact conditional draws yield an unbiased simulated score for any fixed number of draws. The estimator averages stochastic gradient iterates computed using mini-batches of fixed size regardless of sample size, avoiding repeated full-sample likelihood evaluations. Under local regularity and initialization conditions, we establish asymptotic normality and a functional central limit theorem for the partial-sum process of the iterates under multi-pass sampling from an observed sample. These results support plug-in and random-scaling confidence intervals that remain asymptotically valid when algorithmic uncertainty is non-negligible relative to sampling uncertainty. We develop multinomial probit as a leading application. In simulations and two applications, SAUSS returns estimates in every reported run, including cases where the simulated maximum likelihood implementation returns none. When both return estimates, SAUSS gives comparable estimates in less time.
ER  -