AI Paper Atlas

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

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 1 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use a submultiplicative CDF error bound, scaling tolerance by F(t)^α for α < 1Empirical CDF estimates · Real-valued distributionsuniform convergence guaranteeImproved
Assume a bounded valuation moment of order greater than 1Empirical posted-price revenues · Revenue estimationfinite-sample uniform convergenceImproved
Require finite first moment of valuationsEmpirical posted-price revenues · Revenue estimation in the limitalmost-sure uniform convergenceImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy