Local Ai
SAUSS: Stochastic Approximation with Unbiased Simulated Scores for Limited Dependent Variable Models
arXiv:2608.25304v1 Announce Type: cross Abstract: Multinomial choice models allow flexible substitution patterns but become computationally demanding with many alternatives or observations. With a fix
arXiv:2608.25304v1 Announce Type: cross Abstract: Multinomial choice models allow flexible substitution patterns but become computationally demanding with many alternatives or observations. With a fixed per-observation simulation budget, simulated maximum likelihood introduces simulation bias, while each optimization step requires a full-sample likelihood evaluation. We propose Stochastic Approximation with Unbiased Simulated Scores (SAUSS), an averaged stochastic approximation based on conditionally unbiased mini-batch score estimates. Each iteration uses a fixed mini-batch regardless of sample size. For multinomial probit, accept-reject sampling provides exact conditional draws and unbiased score estimates for any fixed number of accepted draws. Under local conditions, asymptotic theory for the averaged estimator and the partial-sum process of the SAUSS iterates incorporates mini-batch and simulation variability and supports random-scaling and plug-in inference. In simulations and an application, SAUSS gives comparable results in less than 1% of the computation time of simulated maximum likelihood. SAUSS extends to limited dependent variable models with conditional-expectation score representations and exact conditional sampling.
Related
- Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation
- Diffusion-Based Data-Driven Assortment Optimization
Source: arXiv cs.LG | 2026-08-27