Research map / Learning theory and algorithms / Matrix and tensor methods
Inferring Change Points in High-Dimensional Regression via Approximate Message Passing
Gabriel Arpino, Xiaoqi Liu, Julia Gontarek, Ramji Venkataramanan
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 AMP with change point prior instead of DP, DPDU, DCDP and CHARCOAL baselines | AMP for change point regression · Linear model with sparse signal prior | Hausdorff distance | Improved |
| use AMP instead of DCDP on large signal dimension compressed sensing | AMP · Compressed sensing with change points (p=7225) | runtime: one hour vs. no output within 2.5 hours | Improved |
| run AMP with a mismatched sparsity level of 0.9 for the sparse difference prior (ablation) | AMP · Linear model with sparse difference signal prior | Hausdorff distance | No clear effect |
| assume exactly 3 signals instead of up to L=3 or 4 for AMP vs binary segmentation (ablation) | AMP vs binary segmentation · Sparse logistic regression with change points | Hausdorff distance and runtime | Improved |
| increase sampling ratio delta (ablation) | AMP posterior · Linear, logistic, ReLU change point models | posterior concentration | Improved |
| compare AMP estimated number of change points with state evolution theory | AMP · Logistic and ReLU, single change point | estimated number of change points: 1.10 vs 1.10 (ReLU sigma=0.50, delta=0.75) | No clear effect |
Closest papers by meaning
- Inferring Change Points in High-Dimensional Linear Regression via Approximate Message Passing (ICML 2024 · similarity 0.95)
- Mixed Regression via Approximate Message Passing (JMLR 2023 · similarity 0.89)
- Optimistic Search: Change Point Estimation for Large-scale Data via Adaptive Logarithmic Queries (JMLR 2024 · similarity 0.88)
- An Efficient Two Step Algorithm for High Dimensional Change Point Regression Models Without Grid Search (JMLR 2019 · similarity 0.88)
- Uncertainty Quantification for Data-Driven Change-Point Learning via Cross-Validation (AAAI 2024 · similarity 0.85)
- Learning with Synthetic Data via SGD in High-Dimensional Linear Regression (NeurIPS 2026 · similarity 0.84)
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.
