AI & ML
Nonparametric Maximum Likelihood Estimation for Mixtures of Logistic Regressions
arXiv stat.ML0 views
arXiv:2611.14445v1 Announce Type: cross Abstract: Mixtures of logistic regressions provide a flexible framework for modeling binary responses, extending standard logistic regression to accommodate unobserved heterogeneity while retaining an interpretable regression structure. In this paper, we study such models with an unspecified mixing distribution. We analyze a sieve nonparametric maximum likelihood estimator (NPMLE) and derive nonasymptotic bounds on the estimation error of the resulting mixture regression function under both fixed and random designs. Our results reveal an explicit tradeoff between statistical estimation error and the approximation error induced by the sieve radius, from which we derive convergence rates under several tail conditions on the mixing distribution. For computation, we propose a finite-particle algorithm that approximates the sieve NPMLE by optimizing the locations and weights of a finitely supported mixing distribution. The method offers numerical advantages over existing algorithms and comes with rigorous convergence guarantees. For any fixed dataset, we establish global convergence of the likelihood to the restricted NPMLE value when the number of particles exceeds a finite threshold. When the true mixing distribution is finitely supported, we further establish uniform global convergence guarantees and derive error bounds that separate algorithmic and statistical errors. Our analysis also yields a denoising bound for the mixing distribution and an identifiability result that complements existing results in the literature.
Source:https://arxiv.org/abs/2611.14445PreviousForward-Value Discretization: Faster Stochastic Diffusion Sampling Without High-Order ApproximationNextOne Curve, Different Weights: AUC, the Brier Score, Decision-Weighted AUC, and the Policy Youden Index
Related posts
ARoute: Task-Aligned Batch and Streaming Model Routing
0arXiv cs.DB
Answering Conjunctive Queries over Linear Existential Rules with Transitivity
0arXiv cs.DB
How Many Demonstrations Does a VLA Need? On the Sample Efficiency of VLA Finetuning
0arXiv cs.RO
Altitude-Adaptive UAV-to-Map Image Matching for Aerial Geo-Localization
0arXiv cs.RO
OASIS: Optimization-Aware Subgoal Inference with Safety Constraints for Autonomous Mobile Robot Navigation
0arXiv cs.RO
Fade to... Red? Scheduling Coloured Noise Exploration Supports Efficient Robot Learning with Reduced Movement Jerk
0arXiv cs.RO