AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Sequential Algorithms for Testing Closeness of Distributions

Aadil Oufkir, Omar Fawzi, Nicolas Flammarion, Aurélien Garivier

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Private and query-efficient algorithms · 0 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 sequential tester instead of a batch testercloseness testing · small alphabet n << log(1/delta)sample complexity: reduction by a factor of at least 4Improved
let the sequential tester stop early when distributions are far (TV >> epsilon)sequential closeness tester · Monte-Carlo, 100 runs, uniform vs perturbedstopping timeImproved
replace epsilon by max(epsilon, TV(D1,D2)) in the sample complexitysequential closeness tester · general n >= 2sample complexityImproved
use log log(1/d) time-uniform stopping rules instead of the earlier sequential algorithmsequential closeness tester · epsilon = 0sample 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