Research map / Learning theory and algorithms / Sample complexity
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues
Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use a submultiplicative CDF error bound, scaling tolerance by F(t)^α for α < 1 | Empirical CDF estimates · Real-valued distributions | uniform convergence guarantee | Improved |
| Assume a bounded valuation moment of order greater than 1 | Empirical posted-price revenues · Revenue estimation | finite-sample uniform convergence | Improved |
| Require finite first moment of valuations | Empirical posted-price revenues · Revenue estimation in the limit | almost-sure uniform convergence | Improved |
Closest papers by meaning
- The Empirical Mean is Minimax Optimal for Local Glivenko-Cantelli (ICML 2025 · similarity 0.84)
- Beyond Monotonicity: On the Convergence of Learning Algorithms in Standard Auction Games (AAAI 2025 · similarity 0.83)
- Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand (NeurIPS 2026 · similarity 0.83)
- Expected Variational Inequalities (ICML 2025 · similarity 0.82)
- Generalization Bounds via Conditional $f$-Information (NeurIPS 2024 · similarity 0.82)
- Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$ (NeurIPS 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
