Mathematical Statistics and Learning - Author Index
MSL summary |
Title index |
Search page
- Abbe, Emmanuel
- Abraham, Kweku
- Addario-Berry, Louigi
The algorithmic hardness threshold for continuous random energy models
- Bandeira, Afonso S.
- Ben-Hamou, Anna
- Blanchard, Gilles
Compressive statistical learning with random feature moments
Statistical learning guarantees for compressive clustering and compressive mixture modeling
- Boumezoued, Alexandre
Nonparametric adaptive inference of birth and death models in a large population limit
- Bruna, Joan
- Bubeck, Sébastien
- Cesari, Tommaso R.
A nearest neighbor characterization of Lebesgue points in metric measure spaces
- Colomboni, Roberto
A nearest neighbor characterization of Lebesgue points in metric measure spaces
- Dalalyan, Arnak S.
Optimal Kullback–Leibler aggregation in mixture density estimation by maximum likelihood
- De Castro, Yohann
- Eldan, Ronen
- Giraud, Christophe
Partial recovery bounds for clustering with the relaxed $K$-means
- Gribonval, Rémi
Compressive statistical learning with random feature moments
Statistical learning guarantees for compressive clustering and compressive mixture modeling
- Hoffmann, Marc
Nonparametric adaptive inference of birth and death models in a large population limit
- Holden, Nina
Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
- Jeunesse, Paulien
Nonparametric adaptive inference of birth and death models in a large population limit
- Juditsky, Anatoli
Near-optimality of linear recovery from indirect observations
- Keriven, Nicolas
Compressive statistical learning with random feature moments
Statistical learning guarantees for compressive clustering and compressive mixture modeling
- Lacour, Claire
- Lattimore, Tor
Improved regret for zeroth-order adversarial bandit convex optimisation
- Liu, Jingbo
- Maillard, Pascal
The algorithmic hardness threshold for continuous random energy models
- Mallat, Stéphane
- Massoulié, Laurent
- Montanari, Andrea
- Nemirovski, Arkadi
Near-optimality of linear recovery from indirect observations
- Nickl, Richard
- Niles-Weed, Jonathan
- Oliveira, Roberto I.
- Pemantle, Robin
Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
- Peres, Yuval
Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
- Pham Ngoc, Thanh Mai
- Polyanskiy, Yury
Application of the information-percolation method to reconstruction problems on graphs
- Ray, Kolyan
The Le Cam distance between density estimation, Poisson processes and Gaussian white noise
- Rigollet, Philippe
- Schmidt-Hieber, Johannes
The Le Cam distance between density estimation, Poisson processes and Gaussian white noise
- Sebbar, Mehdi
Optimal Kullback–Leibler aggregation in mixture density estimation by maximum likelihood
- Sly, Allan
- Srivastava, Nikhil
- Traonmilin, Yann
Compressive statistical learning with random feature moments
Statistical learning guarantees for compressive clustering and compressive mixture modeling
- van Handel, Ramon
- Verdú, Sergio
- Verzelen, Nicolas
Partial recovery bounds for clustering with the relaxed $K$-means
- Wu, Yihong
Application of the information-percolation method to reconstruction problems on graphs
- Yang, Pengkun
- Zhai, Alex
Subpolynomial trace reconstruction for random strings and arbitrary deletion probability