mlsanityData to 7 Oct 2026

Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear Regression

arXiv 2310.12437 ↗First posted 19 Oct 2023math.ST stat.ML stat.THcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the performance of empirical risk minimization on the p-norm linear regression problem for p ∈ (1, ∞). We show that, in the realizable case, under no moment assumptions, and up to a distribution-dependent constant, O(d) samples are enough to exactly recover the target. Otherwise, for p ∈ [2, ∞), and under weak moment assumptions on the target and the covariates, we prove a high probability excess risk bound on the empirical risk minimizer whose leading term matches, up to a constant that depends only on p, the asymptotically exact rate. We extend this result to the case p ∈ (1, 2) under mild assumptions that guarantee the existence of the Hessian of the risk at its minimizer.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 13 of its 38 references that are in the map. First posted on arXiv 19 Oct 2023.

Builds on

13 of 38 references.

References · 13

  1. 2014Learning without Concentrationcited by 50
  2. 2019Exact minimax risk for linear least squares, and the lower tail of sample covariance matricescited by 34
  3. 2018Finite-sample analysis of M-estimators using self-concordancecited by 30
  4. 2019An improper estimator with optimal excess risk in misspecified density estimation and logistic regressioncited by 24
  5. 2021Distribution-Free Robust Linear Regressioncited by 19
  6. 2014Learning without Concentration for General Loss Functionscited by 13
  7. 2019Fast, Provably convergent IRLS Algorithm for p-norm Linear Regressioncited by 10
  8. 2020Suboptimality of Constrained Least Squares and Improvements via Non-Linear Predictorscited by 9
  9. 2021Improved Iteration Complexities for Overconstrained p-Norm Regressioncited by 8
  10. 2019Iterative Refinement for ℓp-norm Regressioncited by 6
  11. 2017An homotopy method for ℓp regression provably beyond self-concordance and in input-sparsity timecited by 4
  12. 2019Faster p-norm minimizing flows, via smoothed q-norm problemscited by 4
1 more
  1. 2022Fast Algorithms for ℓp-Regressioncited by 4

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.