AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free

Ayush Jain, Alon Orlitsky

ICML 2021 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions

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
Replace prior filtering with SDP-relaxation-based filtering that uses optimal ~O(k) samples for Ak learningrobust Ak-distance density estimation from batches · theory; simulations on discrete domain l=500sample complexity in Ak distanceImproved
Scale k from 10 to 50 with good batches set to k/β²proposed Ak filtering estimator · discrete domain l=500, β=0.4Ak-distanceNo clear effect
Replace Ak-distance learning with TV-distance learning for piecewise polynomials via reductionPt,d distributions · theorysample complexityImproved

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