AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

On Scalable Testing of Samplers

Yash Pote, Kuldeep S. Meel

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 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 Barbarik3 instead of Barbarik2 to test wSTSConstrained sampler testing · Scalable benchmarksgeometric mean sample speedup: 451×Improved
Use Barbarik3 instead of Barbarik2 to test wUnigen3Constrained sampler testing · Scalable benchmarksgeometric mean sample speedup: 10×Improved
Use Barbarik3 instead of Barbarik2Testing wSTS · Scalable benchmarksbenchmarks completed: 12 -> 39Improved
Use Barbarik3 instead of Barbarik2Testing wUnigen3 · Scalable benchmarksbenchmarks completed: 5 -> 17Improved
Use Barbarik3 instead of Barbarik2Testing wSTS · Real-life benchmarksbenchmarks with a result: 16 -> 87Improved
Use Barbarik3 instead of Barbarik2Testing the s27_new_7_4 benchmark · Real-life benchmarkstest result: A -> RMixed
Use Barbarik3 with its stated parameter restrictionConstrained sampler testing · Testing with closeness ε and farness ηsupported closeness range: [0,η/3) -> [0,η/11.6)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