A Quasi-Bayesian Perspective to Online Clustering
arXiv:1602.00522 · doi:10.1214/18-EJS1479
Abstract
When faced with high frequency streams of data, clustering raises theoretical and algorithmic pitfalls. We introduce a new and adaptive online clustering algorithm relying on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that our approach is supported by minimax regret bounds. We also provide an RJMCMC-flavored implementation (called PACBO, see https://cran.r-project.org/web/packages/PACBO/index.html) for which we give a convergence guarantee. Finally, numerical experiments illustrate the potential of our procedure.
References in corpus (9)
- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- Sparse Regression Learning by Aggregation and Langevin Monte-Carlo
- Fast learning rates in statistical inference through aggregation
- Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains
- Mirror averaging with sparsity priors
- Pac-bayesian bounds for sparse regression estimation with exponential weights
- PAC-Bayesian Estimation and Prediction in Sparse Additive Models
- An Oracle Inequality for Quasi-Bayesian Non-Negative Matrix Factorization
- PAC-Bayesian High Dimensional Bipartite Ranking