Multiscale change point inference
K Frick, A Munk, H Sieling - … the Royal Statistical Society Series B …, 2014 - academic.oup.com
We introduce a new estimator, the simultaneous multiscale change point estimator SMUCE,
for the change point problem in exponential family regression. An unknown step function is …
for the change point problem in exponential family regression. An unknown step function is …
Partial and approximate symmetry detection for 3d geometry
" Symmetry is a complexity-reducing concept [...]; seek it every-where."-Alan J. PerlisMany
natural and man-made objects exhibit significant symmetries or contain repeated …
natural and man-made objects exhibit significant symmetries or contain repeated …
Detection of an anomalous cluster in a network
E Arias-Castro, EJ Candes, A Durand - The Annals of Statistics, 2011 - JSTOR
We consider the problem of detecting whether or not, in a given sensor network, there is a
cluster of sensors which exhibit an" unusual behavior." Formally, suppose we are given a set …
cluster of sensors which exhibit an" unusual behavior." Formally, suppose we are given a set …
Detecting highly oscillatory signals by chirplet path pursuit
EJ Candes, PR Charlton, H Helgason - Applied and Computational …, 2008 - Elsevier
This paper considers the problem of detecting nonstationary phenomena, and chirps in
particular, from very noisy data. Chirps are waveforms of the very general form A (t) exp (ıλφ …
particular, from very noisy data. Chirps are waveforms of the very general form A (t) exp (ıλφ …
[PDF][PDF] A survey of manifold-based learning methods
We review the ideas, algorithms, and numerical performance of manifold-based machine
learning and dimension reduction methods. The representative methods include locally …
learning and dimension reduction methods. The representative methods include locally …
Metric graph reconstruction from noisy data
M Aanjaneya, F Chazal, D Chen, M Glisse… - Proceedings of the …, 2011 - dl.acm.org
Many real-world data sets can be viewed of as noisy samples of special types of metric
spaces called metric graphs [16]. Building on the notions of correspondence and Gromov …
spaces called metric graphs [16]. Building on the notions of correspondence and Gromov …
Searching for a trail of evidence in a maze
Consider a graph with a set of vertices and oriented edges connecting pairs of vertices.
Each vertex is associated with a random variable and these are assumed to be …
Each vertex is associated with a random variable and these are assumed to be …
A weighted k-nearest neighbor density estimate for geometric inference
Motivated by a broad range of potential applications in topological and geometric inference,
we introduce a weighted version of the k-nearest neighbor density estimate. Various …
we introduce a weighted version of the k-nearest neighbor density estimate. Various …
Optimal sequential detection in multi-stream data
HP Chan - 2017 - projecteuclid.org
Consider a large number of detectors each generating a data stream. The task is to detect
online, distribution changes in a small fraction of the data streams. Previous approaches to …
online, distribution changes in a small fraction of the data streams. Previous approaches to …
Minimax localization of structural information in large noisy matrices
We consider the problem of identifying a sparse set of relevant columns and rows in a large
data matrix with highly corrupted entries. This problem of identifying groups from a collection …
data matrix with highly corrupted entries. This problem of identifying groups from a collection …