arXiv Statistics ML
Stability and Accuracy Trade-offs in Statistical Estimation
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
3d ago
Stabilizing Performative Feedback Loops with Minimal Model Deployments
arXiv:2609.14065v1 Announce Type: new Abstract: When algorithmic predictions inform people's decisions, the models we deploy are performative and actively shape the data we see. This feedback loop be...
arXiv Machine Learning
Jun 25
Robust Linear Predictions: Analyses of Uniform Concentration, Fast Rates and Model Misspecification
arXiv:2201. 01973v3 Announce Type: replace-cross Abstract: The problem of linear predictions has been extensively studied for the past century under pretty generalized frameworks.
arXiv Machine Learning
Jun 8
Stability beyond Bounded Differences: Sharp Generalization Bounds under Finite $L_p$ Moments
arXiv:2606. 06855v1 Announce Type: cross Abstract: While algorithmic stability is a central tool for understanding generalization of learning algorithms, existing high-probability guarantees typically rely on uniform boundedness or sub-Gaussian/sub-Weibull tail assumptions, which can be overly restrictive for modern settings with heavy-tailed or unbounded losses.
arXiv Machine Learning
Sep 10
Stability and Generalization of Straight-Through Estimators for Training Two-Layer Quantized Neural Networks
arXiv:2609.06430v1 Announce Type: new Abstract: We study the identity straight-through estimator (STE) for training a two-layer binary-activation network with hinge loss from the perspective of Stati...
arXiv AI
Jun 4
Does Order Matter : Connecting The Law of Robustness to Robust Generalization
arXiv:2602. 20971v3 Announce Type: replace-cross Abstract: Bubeck and Selke (2021) propose the connection between the Law of Robustness and robust generalization error as an open problem.
arXiv Machine Learning
Jun 15
A Complexity Measure for Active Learning in Multi-group Mean Estimation
arXiv:2606. 14690v1 Announce Type: new Abstract: We study a \emph{max-risk} objective for active learning in a multi-group mean estimation $d$-armed bandits: a learner adaptively allocates a budget of $T$ samples across $d$ groups to minimize the worst-case uncertainty index $\max_{k\in[d]}\sigma_k^2/n_k$, where $\sigma_k$ is the standard deviation of the distribution of arm $d$, and $n_k$ is the number of times arm $d$ is sampled.