Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set
From MaRDI portal
Publication:5084430
DOI10.1080/10618600.2021.2000422OpenAlexW3214575302MaRDI QIDQ5084430FDOQ5084430
Authors: Joseph Vargovich, Toby Hocking 
Publication date: 24 June 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.02808
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- SparseNet: coordinate descent with nonconvex penalties
- On optimal multiple changepoint algorithms for large data
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Best subset selection via a modern optimization lens
- Atomic Decomposition by Basis Pursuit
- A Cluster Analysis Method for Grouping Means in the Analysis of Variance
- Algorithms for the optimal identification of segment neighborhoods
- Using penalized contrasts for the change-point problem
- Matching pursuits with time-frequency dictionaries
- Optimal detection of changepoints with a linear computational cost
- Title not available (Why is that?)
- A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
- On the approximation of curves by line segments using dynamic programming
- Title not available (Why is that?)
- Low-rank matrix completion using nuclear norm minimization and facial reduction
Uses Software
This page was built for publication: Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084430)
