Publication Radar · Source metadata

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

Sokbae Lee, Yuan Liao, Myung Hwan Seo, Youngki Shin

Publication record

Bibliographic evidence describes where and when a record appeared. It does not validate scientific claims.

First public release: 2026-08-26 · Indexed by Pub-AI: 2026-10-27 UTC

preprint

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

Sokbae Lee, Yuan Liao, Myung Hwan Seo, Youngki Shin

Preprint posted: 2026-08-26 · Original record ↗

arxiv
2608.25304
Explicit source versions (2)
  • v2 · 2026-10-23
  • v3 · 2026-11-02
  1. Explicit source version detected · v2

    Source date: 2026-10-23 · First detected: 2026-10-27 UTC · Historical baseline

    Source evidence (1)
  2. Preprint available

    Source date: 2026-08-26 · First detected: 2026-10-27 UTC · Historical baseline

    Source evidence (2)
  3. Explicit source version detected · v3

    Source date: 2026-11-02 · First detected: 2026-11-10 UTC

    Source evidence (1)
Abstract · arxiv

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.