AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Adaptive Sampling for Estimating Probability Distributions

Shubhanshu Shekhar, Tara Javidi, Mohammad Ghavamzadeh

ICML 2020 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation

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 adaptive optimistic tracking instead of uniform allocationDistribution sampling · Synthetic distributions, ℓ₂² distance, ε=0.5 and ε=0.9objective gap to approx-oracleImproved
Use adaptive optimistic tracking instead of uniform allocationDistribution sampling · Synthetic distributions, ℓ₁ distance, ε=0.5 and ε=0.9objective gap to approx-oracleImproved
Use adaptive optimistic tracking instead of uniform allocationDistribution sampling · Synthetic distributions, separation distance, ε=0.5 and ε=0.9objective gap to approx-oracleImproved
Use adaptive optimistic tracking instead of greedy allocationDistribution sampling · Synthetic distributions, ℓ₂² and ℓ₁ distances, ε=0.9objective gap to approx-oracleImproved
Use adaptive optimistic tracking instead of forced explorationDistribution sampling · Synthetic distributions, ℓ₂² and ℓ₁ distances, ε=0.9objective gap to approx-oracleImproved
Use adaptive optimistic tracking instead of greedy or forced explorationDistribution sampling · Synthetic distributions, separation distance, ε=0.9allocation varianceImproved
Replace adaptive tracking with greedy or forced explorationDistribution sampling · Synthetic distributions, ℓ₂² and ℓ₁ distances, ε=0.5objective gap to approx-oracleNo clear effect
Use uniform allocation instead of adaptive allocationDistribution sampling · Synthetic distributions, KL-divergenceperformanceNo clear effect
Use the first-order KL objective \((l-1)/2T_i\) and omit the higher-order termAdaptive KL · KL-divergenceregret: \mc{O}(n^{-2})Hurt

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