Open AccessPosted Content
Scalable Bayesian change point detection with spike and slab priors
Reads0
Chats0
TLDR
A Bayesian change point detection method is proposed, which is one of the fastest Bayesian methodologies, and it is more robust to misspecification of the error terms than the competing methods.Abstract:
We study the use of spike and slab priors for consistent estimation of the number of change points and their locations. Leveraging recent results in the variable selection literature, we show that an estimator based on spike and slab priors achieves optimal localization rate in the multiple offline change point detection problem. Based on this estimator, we propose a Bayesian change point detection method, which is one of the fastest Bayesian methodologies, and it is more robust to misspecification of the error terms than the competing methods. We demonstrate through empirical work the good performance of our approach vis-a-vis some state-of-the-art benchmarks.read more
Citations
More filters
Journal ArticleDOI
Variance estimation in graphs with the fused lasso
TL;DR: The problem of variance estimation in general graph-structured problems is studied and a linear time estimator for the homoscedastic case is developed that can consistently estimate the variance in general graphs and a simple total variation regularization estimator is studied for estimating the signal of variances in the heteroscedastics case.
Peer Review
Controlled Discovery and Localization of Signals via Bayesian Linear Programming
Asher Spector,Lucas Janson +1 more
TL;DR: Bayesian Linear Programming (BLiP) is proposed, a method which overcomes this intractability to jointly detect and localize signals in a way that nearly maximizes the expected resolution-adjusted power while provably controlling false positives.
Non-segmental Bayesian Detection of Multiple Change-points
TL;DR: In this article , the authors proposed an original and general NOn-SEgmental (NOSE) approach for the detection of multiple change-points by the non-negligibility of posterior estimates of the jump heights.
Variance change point detection with credible sets
TL;DR: In this article , the authors introduce a novel Bayesian approach to detect changes in the variance of a Gaussian sequence model focusing on quantifying the uncertainty in the change point locations and providing a scalable algorithm for inference.
Bayesian variance change point detection with credible sets
TL;DR: In this paper , a Bayesian approach is proposed to detect changes in the variance of a Gaussian sequence model, focusing on quantifying the uncertainty in the change point locations and providing a scalable algorithm for inference.
References
More filters
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Journal ArticleDOI
Nonlinear total variation based noise removal algorithms
TL;DR: In this article, a constrained optimization type of numerical algorithm for removing noise from images is presented, where the total variation of the image is minimized subject to constraints involving the statistics of the noise.
Journal ArticleDOI
Quantitative monitoring of gene expression patterns with a complementary DNA microarray.
TL;DR: A high-capacity system was developed to monitor the expression of many genes in parallel by means of simultaneous, two-color fluorescence hybridization, which enabled detection of rare transcripts in probe mixtures derived from 2 micrograms of total cellular messenger RNA.
Journal ArticleDOI
The Dantzig selector: Statistical estimation when p is much larger than n
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: In many important statistical applications, the number of variables or parameters p is much larger than the total number of observations n as discussed by the authors, and it is possible to estimate β reliably based on the noisy data y.