English
Related papers

Related papers: On change point detection using the fused lasso me…

200 papers

The fused lasso, also known as (anisotropic) total variation denoising, is widely used for piecewise constant signal estimation with respect to a given undirected graph. The fused lasso estimate is highly nontrivial to compute when the…

Statistics Theory · Mathematics 2018-08-01 Oscar Hernan Madrid Padilla , James G. Scott , James Sharpnack , Ryan J. Tibshirani

Consider the problem on sequential change-point detection on multiple data streams. We provide the asymptotic lower bounds of the detection delays at all levels of change-point sparsity and we derive a smaller asymptotic lower bound of the…

Statistics Theory · Mathematics 2023-06-02 Jingyan Huang

Consider the detection of a sparse change in high-dimensional time-series. We introduce Sparsity Likelihood-based (SL-based) score and the change-points detection procedure in multivariate normal model with general covariance structure.…

Methodology · Statistics 2025-07-30 Jingyan Huang

Shrinkage estimators that possess the ability to produce sparse solutions have become increasingly important to the analysis of today's complex datasets. Examples include the LASSO, the Elastic-Net and their adaptive counterparts.…

Methodology · Statistics 2017-02-09 Hongmei Liu , J. Sunil Rao

The fused lasso, also known as total-variation denoising, is a locally-adaptive function estimator over a regular grid of design points. In this paper, we extend the fused lasso to settings in which the points do not occur on a regular…

Methodology · Statistics 2019-07-09 Oscar Hernan Madrid Padilla , James Sharpnack , Yanzhen Chen , Daniela M. Witten

Neuroimage analysis usually involves learning thousands or even millions of variables using only a limited number of samples. In this regard, sparse models, e.g. the lasso, are applied to select the optimal features and achieve high…

Machine Learning · Computer Science 2015-03-26 Bo Xin , Lingjing Hu , Yizhou Wang , Wen Gao

This work focuses on the estimation of multiple change-points in a time-varying Ising model that evolves piece-wise constantly. The aim is to identify both the moments at which significant changes occur in the Ising model, as well as the…

Machine Learning · Statistics 2020-07-01 Batiste Le Bars , Pierre Humbert , Argyris Kalogeratos , Nicolas Vayatis

We consider continuous-time sparse stochastic processes from which we have only a finite number of noisy/noiseless samples. Our goal is to estimate the noiseless samples (denoising) and the signal in-between (interpolation problem). By…

Machine Learning · Computer Science 2015-06-11 Arash Amini , Ulugbek S. Kamilov , Emrah Bostan , Michael Unser

While many methods are available to detect structural changes in a time series, few procedures are available to quantify the uncertainty of these estimates post-detection. In this work, we fill this gap by proposing a new framework to test…

Methodology · Statistics 2021-04-16 Sean Jewell , Paul Fearnhead , Daniela Witten

We study the property of the Fused Lasso Signal Approximator (FLSA) for estimating a blocky signal sequence with additive noise. We transform the FLSA to an ordinary Lasso problem. By studying the property of the design matrix in the…

Machine Learning · Statistics 2012-11-26 Junyang Qian , Jinzhu Jia

We consider the offline change point detection and localization problem in the context of piecewise stationary networks, where the observable is a finite sequence of networks. We develop algorithms involving some suitably modified CUSUM…

Broadband wireless channels usually have the sparse nature. Based on the assumption of Gaussian noise model, adaptive filtering algorithms for reconstruction sparse channels were proposed to take advantage of channel sparsity. However,…

Information Theory · Computer Science 2015-02-20 Guan Gui , Li Xu , Wentao Ma , Badong Chen

Detecting changepoints in a one-dimensional signal is a classical yet fundamental problem. The fused lasso provides an elegant convex formulation that produces a stepwise estimate of the mean, but quantifying the uncertainty of the detected…

Statistics Theory · Mathematics 2025-11-13 Rieko Tasaka , Tatsuya Kimura , Joe Suzuki

We introduce a new approach for decoupling trends (drift) and changepoints (shifts) in time series. Our locally adaptive model-based approach for robustly decoupling combines Bayesian trend filtering and machine learning based…

Methodology · Statistics 2024-01-09 Haoxuan Wu , Toryn L. J. Schafer , Sean Ryan , David S. Matteson

This dissertation presents a general framework for changepoint detection based on L0 model selection. The core method, Iteratively Reweighted Fused Lasso (IRFL), improves upon the generalized lasso by adaptively reweighting penalties to…

Methodology · Statistics 2026-03-24 Michael Grantham , Xueheng Shi , Bertrand Clarke

Feature selection has been proven a powerful preprocessing step for high-dimensional data analysis. However, most state-of-the-art methods tend to overlook the structural correlation information between pairwise samples, which may…

Machine Learning · Computer Science 2019-07-02 Lu Bai , Lixin Cui , Yue Wang , Philip S. Yu , Edwin R. Hancock

Detection of sparse signals arises in a wide range of modern scientific studies. The focus so far has been mainly on Gaussian mixture models. In this paper, we consider the detection problem under a general sparse mixture model and obtain…

Information Theory · Computer Science 2012-11-13 T. Tony Cai , Yihong Wu

We develop a novel methodology for detecting abrupt break points in mean functions of functional time series, adaptable to arbitrary sampling schemes. By employing B-spline smoothing, we introduce $\mathcal L_{\infty}$ and $\mathcal L_2$…

Methodology · Statistics 2024-12-31 Leheng Cai , Qirui Hu

The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation…

Information Theory · Computer Science 2014-07-24 Guan Gui , Li Xu , Fumiyuki Adachi

This paper characterizes the performance of massive multiuser spatial modulation MIMO systems, when a regularized form of the least-squares method is used for detection. For a generic distortion function and right unitarily invariant…

Information Theory · Computer Science 2020-11-18 Ali Bereyhi , Saba Asaad , Bernhard Gäde , Ralf R. Müller , H. Vincent Poor