atlas

Research map / Learning theory and algorithms / Sample complexity

Divide and Conquer Dynamic Programming: An Almost Linear Time Change Point Detection Methodology in High Dimensions

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Add the PLR local-refinement conquer step after the divide step (ablation)DCDP · Mean model; synthetic simulationsLocalization errorHelped
Use DCDP instead of InspectMean model, n = 200, p=100, K =3, δ = 5 · High-dimensional mean shiftHausdorff distance: 0.40 (3.50) -> 0.00 (0.00)Helped
Use DCDP instead of vanilla DPLinear regression model, n = 200, p=100, K =3, δ = 5 · High-dimensional regression coefficient shiftsTime: 220.3s (16.8) -> 18.4s (1.1)Helped
Use DCDP instead of vanilla DPLinear regression model, n = 200, p=100, K =3, δ = 5 · High-dimensional regression coefficient shiftsHausdorff distance: 0.01 (0.10) -> 0.13 (0.39)Hurt
Use DCDP instead of CFGaussian graphical model, n = 400, p=10, K =3 · Precision matrix shiftsHausdorff distance: 5.54 (14.71) -> 0.42 (0.64)Helped

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