Research map / Time series / Causal and generative time series
Statistically and Computationally Efficient Change Point Localization in Regression Settings
Daren Wang, Zifeng Zhao, Kevin Z. Lin, Rebecca Willett
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use VPWBS instead of EBSA | change-point localization in regression · Setting (i), kappa=sqrt(40) | scaled Hausdorff distance: 0.090 -> 0.011 | Improved |
| use VPWBS instead of WBSSGL (adds projection step) | change-point localization · Setting (i), kappa=sqrt(40) | scaled Hausdorff distance: 0.151 -> 0.011 | Improved |
| increase change size kappa from sqrt(40) to 1.6sqrt(40) | EBSA · Setting (i) | scaled Hausdorff distance: 0.090 -> 0.025 | Improved |
| increase change size kappa from sqrt(40) to 1.6sqrt(40) | VPWBS · Setting (i) | scaled Hausdorff distance: 0.011 -> 0.009 | No clear effect |
| increase sample size n from 480 to 800 | VPWBS · Setting (ii) | scaled Hausdorff distance: 0.062 -> 0.022 | Improved |
| use EBSA instead of VPWBS at large sample size | change-point localization · Setting (ii), n=800 | scaled Hausdorff distance: 0.022 -> 0.009 | Improved |
| use EBSA instead of VPWBS at small sample size | change-point localization · Setting (ii), n=480 | scaled Hausdorff distance: 0.062 -> 0.128 | Hurt |
| increase dimension p from 80 to 120 | VPWBS · Setting (iii) | scaled Hausdorff distance: 0.025 -> 0.049 | Hurt |
| increase support size s from 16 to 28 | VPWBS · Setting (iv) | scaled Hausdorff distance: 0.027 -> 0.057 | Hurt |
| increase sample size n | WBSSGL computation time · Setting (i), kappa=1.6sqrt(40), p=100 | execution time | Hurt |
| increase n or p | VPWBS and EBSA computation time · Setting (i), kappa=1.6sqrt(40) | execution time | Hurt |
Closest papers by meaning
- Divide and Conquer Dynamic Programming: An Almost Linear Time Change Point Detection Methodology in High Dimensions (ICML 2023 · similarity 0.90)
- Change point detection and inference in multivariate non-parametric models under mixing conditions (NeurIPS 2023 · similarity 0.89)
- An Efficient Two Step Algorithm for High Dimensional Change Point Regression Models Without Grid Search (JMLR 2019 · similarity 0.89)
- Optimistic Search: Change Point Estimation for Large-scale Data via Adaptive Logarithmic Queries (JMLR 2024 · similarity 0.88)
- TSB-SEG: A Systematic Time-Series Segmentation Benchmark (NeurIPS 2026 · similarity 0.88)
- Inferring Change Points in High-Dimensional Linear Regression via Approximate Message Passing (ICML 2024 · similarity 0.88)
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.
