The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Multiple Change-Point Estimation With a Total Variation Penalty
Abstract
We propose a new approach for dealing with the estimation of the location of change-points in one-dimensional piecewise constant signals observed in white noise. Our approach consists in reframing this task in a variable selection context. We use a penalized least-square criterion with a ℓ1-type penalty for this purpose. We explain how to implement this method in practice by using the LARS / LASSO algorithm. We then prove that, in an appropriate asymptotic framework, this method provides consistent estimators of the change points with an almost optimal rate. We finally provide an improved practical version of this method by combining it with a reduced version of the dynamic programming algorithm and we successfully compare it with classical methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Adapting to Unknown Smoothness via Wavelet Shrinkage
Donoho, D. L., & Johnstone, I. M. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476626 · Cited by 4,630
Fundamentals Of Statistical Signal Processing
Kay, S. (2001) · International Linear Collider · Cited by 3,655
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
On Grouping for Maximum Homogeneity
Fisher, W. D. (1958) · Journal of the American Statistical Association · doi:10.1080/01621459.1958.10501479 · Cited by 881
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2006) · Cited by 744
Using penalized contrasts for the change-point problem
Lavielle, M. (2005) · Signal Processing · doi:10.1016/j.sigpro.2005.01.012 · Cited by 652
Nonparametric Methods in Change-Point Problems
Brodsky, B. E., & Darkhovsky, B. S. (1993) · Springer eBooks · doi:10.1007/978-94-015-8163-9 · Cited by 625
The Application of Hidden Markov Models in Speech Recognition
Gales, M., & Young, S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981219 · Cited by 557
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos582 · Cited by 489
Birgé, L., & Massart, P. (2001) · Journal of the European Mathematical Society · doi:10.1007/s100970100031 · Cited by 479
On the approximation of curves by line segments using dynamic programming
Bellman, R. (1961) · Communications of the ACM · doi:10.1145/366573.366611 · Cited by 444
Exact and efficient Bayesian inference for multiple changepoint problems
Fearnhead, P. (2006) · Statistics and Computing · doi:10.1007/s11222-006-8450-8 · Cited by 440
Numerical Bayesian Methods Applied to Signal Processing
Riedel, K. S. (1997) · Technometrics · doi:10.1080/00401706.1997.10485453 · Cited by 353
Spatial smoothing and hot spot detection for CGH data using the fused lasso
Tibshirani, R., & Wang, P. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm013 · Cited by 347
Optimal Solutions for Sparse Principal Component Analysis
d’Aspremont, A., Bach, F., & Ghaoui, L. E. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0705 · Cited by 250
Fitting multiple change-point models to data
Hawkins, D. M. (2001) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(00)00068-2 · Cited by 211
Detecting multiple change-points in the mean of Gaussian process by model selection
Lebarbier, E. (2005) · Signal Processing · doi:10.1016/j.sigpro.2004.11.012 · Cited by 209
Least angle and ℓ1 penalized regression: A review
Hesterberg, T., Choi, N. H., Meier, L., & Fraley, C. (2008) · Statistics Surveys · doi:10.1214/08-ss035 · Cited by 198
Consistencies and rates of convergence of jump-penalized least squares estimators
Boysen, L., Kempe, A., Liebscher, V., Munk, A., & Wittich, O. (2009) · The Annals of Statistics · doi:10.1214/07-aos558 · Cited by 161
Generalized spectral bounds for sparse LDA
Moghaddam, B., Weiss, Y., & Avidan, S. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143925 · Cited by 149
Catching Change-points with Lasso
Lévy‐Leduc, C., & Harchaoui, Z. (2007) · neural information processing systems · Cited by 133
Self-citationDetection and localization of change-points in high-dimensional network traffic data
Lévy‐Leduc, C., & Roueff, F. (2009) · The Annals of Applied Statistics · doi:10.1214/08-aoas232 · Cited by 81
Self-citationModel selection by LASSO methods in a change-point model
Ciuperca, G. (2012) · Statistical Papers · doi:10.1007/s00362-012-0482-x · Cited by 51
A Non-asymptotic Theory for Model Selection
Massart, P. (2009) · doi:10.4171/009-1/20 · Cited by 22
Cited by
Optimal Detection of Changepoints With a Linear Computational Cost
Killick, R., Fearnhead, P., & Eckley, I. A. (2012) · Journal of the American Statistical Association · doi:10.1080/01621459.2012.737745 · Cited by 2,548
Selective review of offline change point detection methods
Truong, C., Oudre, L., & Vayatis, N. (2020) · Signal Processing · doi:10.1016/j.sigpro.2019.107299 · Cited by 1,338
TVSum: Summarizing web videos using titles
Song, Y., Vallmitjana, J., Stent, A., & Jaimes, A. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299154 · Cited by 623
Wild binary segmentation for multiple change-point detection
Fryzlewicz, P. (2014) · The Annals of Statistics · doi:10.1214/14-aos1245 · Cited by 566
Multiscale Change Point Inference
Frick, K., Munk, A., & Sieling, H. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12047 · Cited by 320
Metadata
- Authors
- Harchaoui, Z., & Lévy-Leduc, C.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 2010-12-01
- Volume
- 105
- Issue
- 492
- Pages
- 1480-1493
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W2118673550
- Cited by
- 311
- References
- 29
- FWCI
- 5.39
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.