Fetching the paper…
Reading the bibliography…
In this paper, we derive a new dimension-free non-asymptotic upper bound for the quadratic $k$-means excess risk related to the quantization of an i.i.d sample in a separable Hilbert space.
1911
Earlier work this paper cites.
[author] Aronszajn, NachmanN. (1950). Theory of reproducing kernels. Transactions of the American mathematical society 68 337–404
1950
Earlier work this paper cites.
[author] Ben-Tal, AharonA., Charnes, AbrahamA. and Teboulle, MarcM. (1989). Entropic means. Journal of Mathematical Analysis and Applications 139 537–551
1989
Earlier work this paper cites.
[author] Bartlett, Peter LP. L., Linder, TamásT. and Lugosi, GáborG. (1998). The minimax distortion redundancy in empirical quantizer design. IEEE Transactions on Information theory 44 1802–1813
1998
Earlier work this paper cites.
Slonim, N
1999
Earlier work this paper cites.
[author] Catoni, OlivierO. (2004). Statistical learning theory and stochastic optimization. Ecole d’été de probabilités de Saint-Flour XXXI-2001. Springer Collection : Lecture notes in mathematics n°1851
2001
Earlier work this paper cites.
[author] Tishby, NaftaliN., Pereira, FernandoF. and Bialek, WilliamW. (2001). The Information Bottleneck Method. Proceedings of the 37th Allerton Conference on Communication, Control and Computation 49
2001
Earlier work this paper cites.
[author] Pereira, FernandoF., Tishby, NaftaliN. and Lee, LillianL. (2002). Distributional Clustering Of English Words. Proceedings of the 31st Annual Meeting on Association for Computational Linguistics. 10.3115/981574.981598
2002
Earlier work this paper cites.
[author] Veldhuis, RaymondR. (2002). The centroid of the symmetrical Kullback-Leibler distance. IEEE signal processing letters 9 96–99
2002
Earlier work this paper cites.
[author] Dhillon, Inderjit SI. S., Mallela, SubramanyamS. and Kumar, RahulR. (2003). A divisive information-theoretic feature clustering algorithm for text classification. Journal of machine learning research 3 1265–1287
2003
Earlier work this paper cites.
[author] Banerjee, ArindamA., Dhillon, InderjitI. and Ghosh, JoydeepJ. (2004). Clustering with Bregman Divergences. Journal of Machine Learning Research 6. 10.1137/1.9781611972740.22
2004
Earlier work this paper cites.
[author] Antos, AndrásA. (2005). Improved minimax bounds on the test and training distortion of empirically designed vector quantizers. IEEE Transactions on Information Theory 51 4022–4032
2005
Earlier work this paper cites.
Massart, P
2007
Cited alongside, same era.
[author] Biau, GérardG., Devroye, LucL. and Lugosi, GáborG. (2008). On the performance of clustering in Hilbert spaces. IEEE Transactions on Information Theory 54 781-790
2008
Cited alongside, same era.
[author] Christmann, AndreasA. and Steinwart, IngoI. (2008). Support Vector Machines. 10.1007/978-0-387-77242-4
2008
Cited alongside, same era.
[author] Nielsen, FrankF. and Nock, RichardR. (2009). Sided and symmetrized Bregman centroids. IEEE transactions on Information Theory 55 2882–2904
2009
Cited alongside, same era.
[author] Fischer, AurélieA. (2010). Quantization and clustering with Bregman divergences. Journal of Multivariate Analysis 101 2207-2221. 10.1016/j.jmva.2010.05.008
2010
Cited alongside, same era.
[author] Nielsen, FrankF., Nock, RichardR. and Amari, Shun-ichiS.-i. (2014). On clustering histograms with k-means by using mixed α \alpha -divergences. Entropy 16 3273–3301
2014
Later among the works it cites.
[author] Giulini, IlariaI. (2015). Generalization bounds for random samples in Hilbert spaces, Theses, Ecole normale supérieure - ENS PARIS
2015
Later among the works it cites.
[author] Levrard, ClémentC. (2015). Nonasymptotic bounds for vector quantization in Hilbert spaces. Ann. Statist. 43 592–619. 10.1214/14-AOS1293
2015
Later among the works it cites.
[author] Fefferman, CharlesC., Mitter, SanjoyS. and Narayanan, HariharanH. (2016). Testing the manifold hypothesis. Journal of the American Mathematical Society 29 983–1049
2016
Later among the works it cites.
Catoni, O
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
[author] Jiang, BinB., Pei, JianJ., Tao, YufeiY. and Lin, XueminX. (2011). Clustering uncertain data based on probability distribution similarity. IEEE Transactions on Knowledge and Data Engineering 25 751–763
2011
Cited alongside, same era.
[author] Catoni, OlivierO. (2012). Challenging the empirical mean and empirical variance: A deviation study. Ann. Inst. H. Poincaré Probab. Statist. 48 1148–1185. 10.1214/11-AIHP454
2012
Cited alongside, same era.
[author] Wu, JunjieJ. (2012). Advances in K-means clustering: a data mining thinking. Springer Science & Business Media
2012
Cited alongside, same era.
[author] Boucheron, StéphaneS., Lugosi, GáborG. and Massart, PascalP. (2013). Concentration inequalities : a non asymptotic theory of independence. Oxford University Press
2013
Cited alongside, same era.
[author] Levrard, ClémentC. (2013). Fast rates for empirical vector quantization. Electron. J. Statist. 7 1716–1746. 10.1214/13-EJS822
2013
Cited alongside, same era.
[author] Nielsen, FrankF. (2013). Jeffreys centroids: A closed-form expression for positive histograms and a guaranteed tight approximation for frequency histograms. IEEE Signal Processing Letters 20 657–660
2013
Cited alongside, same era.
[author] Levrard, ClémentC. (2014). High-dimensional vector quantization : convergence rates and variable selection, Theses, Université Paris Sud - Paris XI
2014
Cited alongside, same era.
2017
Later among the works it cites.
[author] Levrard, ClémentC. (2018). Quantization/Clustering: when and why does k-means work? Journal de la Société Française de Statistique 159 1–26
2018
Later among the works it cites.
[author] Nielsen, FrankF. (2019). On the Jensen–Shannon symmetrization of distances relying on abstract means. Entropy 21 485
2019
Later among the works it cites.
[author] Fischer, AurélieA., Levrard, ClémentC. and Brécheteau, ClaireC. (2020). Robust Bregman Clustering. Annals of Statistics
2020
Later among the works it cites.
[author] Klochkov, YegorY., Kroshnin, AlexeyA. and Zhivotovskiy, NikitaN. (2020). Robust k k -means Clustering for Distributions with Two Moments. Annals of Statistics (forthcoming)
2020
Later among the works it cites.
[author] Cao, JieJ., Wu, ZhiangZ., Wu, JunjieJ. and Liu, WenjieW. (2013). Towards information-theoretic K-means clustering for image indexing. Signal Processing 93 2026–2037
2037
Closest in time.