AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Optimistic Search: Change Point Estimation for Large-scale Data via Adaptive Logarithmic Queries

Solt Kovács, Housen Li, Lorenz Haubner, Axel Munk, Peter Bühlmann

JMLR 2024 · 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 advanced instead of naive optimistic search on unbalanced segments (ablation)optimistic search · Single univariate mean change, sigma=1, n=5000mean absolute error: 1948.79 -> 48.08Improved
use advanced instead of naive optimistic search on unbalanced segments (ablation)optimistic search · Single univariate mean change, sigma=0.5, n=5000mean absolute error: 1021.12 -> 3.92Improved
use naive optimistic search instead of advanced on balanced segmentsoptimistic search · Single univariate mean change, sigma=1.5, n=200mean absolute error: 60.82 -> 23.77Improved
combine naive and advanced optimistic search (ablation)optimistic search · Single univariate mean change, sigma=1, n=500mean absolute error: 26.97 -> 21.06Improved
combine naive and advanced optimistic search (ablation)optimistic search · Single univariate mean change, sigma=1, n=5000mean absolute error: 48.08 -> 51.94No clear effect
replace full grid search by combined optimistic searchchange point search · Single univariate mean change, sigma=1, n=5000average number of evaluations: 5099 -> 58.71Improved
replace full grid search by combined optimistic searchchange point search · Single univariate mean change, sigma=1, n=5000mean absolute error: 38.34 -> 51.94Hurt
replace full grid search by advanced optimistic searchchange point search · Single univariate mean change, sigma=0.5, n=5000average number of evaluations vs error: 3.05 -> 3.92Mixed
use optimistic search within SeedBSSeedBS · Blocks signal, 11 change points, n=2048Hausdorff distanceNo clear effect
use optimistic search within binary segmentationBS · Changing Gaussian graphical modelcomputation time speedup: factor 30Improved
use optimistic search within WBSWBS · Changing Gaussian graphical modelcomputation time speedup: factor 35Improved
use optimistic search within SeedBSSeedBS · Changing Gaussian graphical modelcomputation time speedup: factor 10--14Improved

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