mlsanityData to 7 Oct 2026

An improper estimator with optimal excess risk in misspecified density estimation and logistic regression

arXiv 1912.10784 ↗First posted 23 Dec 2019math.ST cs.LG stat.MLcited by 24

Not on the map. Why?

Abstract (arXiv)

We introduce a procedure for conditional density estimation under logarithmic loss, which we call SMP (Sample Minmax Predictor). This estimator minimizes a new general excess risk bound for statistical learning. On standard examples, this bound scales as d/n with d the model dimension and n the sample size, and critically remains valid under model misspecification. Being an improper (out-of-model) procedure, SMP improves over within-model estimators such as the maximum likelihood estimator, whose excess risk degrades under misspecification. Compared to approaches reducing to the sequential problem, our bounds remove suboptimal log n factors and can handle unbounded classes. For the Gaussian linear model, the predictions and risk bound of SMP are governed by leverage scores of covariates, nearly matching the optimal risk in the well-specified case without conditions on the noise variance or approximation error of the linear model. For logistic regression, SMP provides a non-Bayesian approach to calibration of probabilistic predictions relying on virtual samples, and can be computed by solving two logistic regressions. It achieves a non-asymptotic excess risk of O((d + B2R2)/n), where R bounds the norm of features and B that of the comparison parameter; by contrast, no within-model estimator can achieve better rate than min(B R/√n, d eBR/n ) in general. This provides a more practical alternative to Bayesian approaches, which require approximate posterior sampling, thereby partly addressing a question raised by Foster et al. (2018).

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Dec 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 5; 2023: 7; 2024: 2; 2025: 4; 2026: 2.

24 papers.

Sort:

  1. 2021Stability and Deviation Optimal Risk Bounds with Convergence Rate O(1/n)cited by 42
  2. 2022An elementary analysis of ridge regression with random designcited by 15
  3. 2022Scale-free Unconstrained Online Learning for Curved Lossescited by 13
  4. 2023On the sample complexity of parameter estimation in logistic regression with normal designcited by 13
  5. 2021Mixability made efficient: Fast online multiclass logistic regressioncited by 12
  6. 2021Efficient Methods for Online Multiclass Logistic Regressioncited by 10
  7. 2022Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Conditioncited by 9
  8. 2023High-Probability Risk Bounds via Sequential Predictorscited by 9
  9. 2023Convergence and concentration properties of constant step-size SGD through Markov chainscited by 8
  10. 2021Localization, Convexity, and Star Aggregationcited by 7
  11. 2023Concentration Bounds for Discrete Distribution Estimation in KL Divergencecited by 6
  12. 2022On Causality in Domain Adaptation and Semi-Supervised Learning: an Information-Theoretic Analysis for Parametric Modelscited by 4
12 more
  1. 2023Local Risk Bounds for Statistical Aggregationcited by 3
  2. 2025Nearly Minimax Discrete Distribution Estimation in Kullback-Leibler Divergence with High Probabilitycited by 3
  3. 2023Exploring Local Norms in Exp-concave Statistical Learningcited by 2
  4. 2023Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear Regressioncited by 2
  5. 2024The Limits of Assumption-free Tests for Algorithm Performancecited by 2
  6. 2024Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihoodcited by 1
  7. 2025Are all models wrong? Fundamental limits in distribution-free empirical model falsificationcited by 1
  8. 2025Estimation of discrete distributions with high probability under chi2-divergencecited by 1
  9. 2026Ratio Covers of Convex Sets and Optimal Mixture Density Estimationcited by 1
  10. 2022Meta Sparse Principal Component Analysiscited by 0
  11. 2025Online Episodic Convex Reinforcement Learningcited by 0
  12. 2026Multiplicative Oracle Inequalities for Transductive Learning via Level-Set Aggregationcited by 0