AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

An Efficient Two Step Algorithm for High Dimensional Change Point Regression Models Without Grid Search

Abhishek Kaul, Venkata K. Jandhyala, Stergios B. Fotopoulos

JMLR 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: High-dimensional estimation theory · 25 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 two-step Algorithm 1A instead of full grid searchchange point regression · Simulation A, n=350, p=250, tau0=0.169computation time: 144.6366 -> 2.6849Improved
use Algorithm 1A instead of full grid searchchange point regression · Simulation A, n=350, p=250, tau0=0.169mse(beta): 1.3631 -> 0.6499Improved
use Algorithm 1A instead of full grid searchchange point regression · Simulation A, n=150, p=25, tau0=0.642mse(beta): 0.0983 -> 0.1041Hurt
better initializer (1B instead of 1A) (ablation)Algorithm 1 · Simulation Achange point biasNo clear effect
increase sample size nAlgorithm 1A · Simulation B no-changePrM: 0.76 -> 0.85 (p=25, n=150 -> 350)Improved
use proposed method instead of grid search for regression coefficientschange point regression · Simulation A bias(beta), bias(gamma)biasImproved

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