:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Even, Bertrand, Giraud, Christophe, Verzelen, Nicolas
Format:	Preprint
Published:	2025
Subjects:	Statistics Theory Machine Learning 62H30, 68Q17
Online Access:	https://arxiv.org/abs/2506.13647
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computation-information gap in high-dimensional clustering
by: Even, Bertrand, et al.
Published: (2024)

Computational barriers for permutation-based problems, and cumulants of weakly dependent random variables
by: Even, Bertrand, et al.
Published: (2025)

Parameter-free entropy-regularized multi-view clustering with hierarchical feature selection
by: Sinaga, Kristina P., et al.
Published: (2025)

Consistent spectral clustering in sparse tensor block models
by: Välimaa, Ian, et al.
Published: (2025)

A Bayesian cluster validity index
by: Wiroonsri, Nathakhun, et al.
Published: (2024)

Node-private community estimation in stochastic block models: Tractable algorithms and lower bounds
by: Marchis, Laurentiu, et al.
Published: (2026)

The Breakdown of Gaussian Universality in Classification of High-dimensional Linear Factor Mixtures
by: Mai, Xiaoyi, et al.
Published: (2024)

Langevin dynamics for high-dimensional optimization: the case of multi-spiked tensor PCA
by: Arous, Gérard Ben, et al.
Published: (2024)

Weak Signals and Heavy Tails: Learning Theory meets Extreme Value Analysis
by: Clémençon, Stephan, et al.
Published: (2025)

Adversarially robust clustering with optimality guarantees
by: Jana, Soham, et al.
Published: (2023)

K-Means as a Radial Basis function Network: a Variational and Gradient-based Equivalence
by: Arredondo, Felipe de Jesus Felix, et al.
Published: (2026)

Robust spectral clustering with rank statistics
by: Cape, Joshua, et al.
Published: (2024)

Finite-sample confidence regions for spectral clustering and graph centrality
by: Gokavarapu, Chandrasekhar, et al.
Published: (2026)

Almost exact recovery in noisy semi-supervised learning
by: Avrachenkov, Konstantin, et al.
Published: (2020)

A computational transition for detecting correlated stochastic block models by low-degree polynomials
by: Chen, Guanyi, et al.
Published: (2024)

Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps
by: Li, Zhangsong
Published: (2026)

Pair-Matching: Links Prediction with Adaptive Queries
by: Giraud, Christophe, et al.
Published: (2019)

Imbalanced Classification under Capacity Constraints
by: Fraiman, Daniel, et al.
Published: (2026)

Consistency for constrained maximum likelihood estimation and clustering based on mixtures of elliptically-symmetric distributions under general data generating processes
by: Coretto, Pietro, et al.
Published: (2023)

Stable and consistent density-based clustering via multiparameter persistence
by: Rolle, Alexander, et al.
Published: (2020)

A provable initialization and robust clustering method for general mixture models
by: Jana, Soham, et al.
Published: (2024)

Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning
by: Kratsios, Anastasis, et al.
Published: (2026)

Spectral clustering algorithm for the allometric extension model
by: Kawamoto, Kohei, et al.
Published: (2023)

Stochastic gradient descent in high dimensions for multi-spiked tensor PCA
by: Arous, Gérard Ben, et al.
Published: (2024)

Non-asymptotic oracle inequalities for the Lasso in high-dimensional mixture of experts
by: Nguyen, TrungTin, et al.
Published: (2020)

On spectral clustering under non-isotropic Gaussian mixture models
by: Kawamoto, Kohei, et al.
Published: (2026)

The VOROS: Lifting ROC curves to 3D
by: Ratigan, Christopher, et al.
Published: (2024)

Permutation recovery of spikes in noisy high-dimensional tensor estimation
by: Arous, Gérard Ben, et al.
Published: (2024)

The Algorithmic Phase Transition in Correlated Spiked Models
by: Li, Zhangsong
Published: (2025)

Graph-Informed Adversarial Modeling: Infimal Subadditivity of Interpolative Divergences
by: Birmpa, Panagiota, et al.
Published: (2026)

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
by: Bhamidi, Shankar, et al.
Published: (2025)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
by: Li, Zhangsong
Published: (2025)

New Equivalences Between Interpolation and SVMs: Kernels and Structured Features
by: Kaushik, Chiraag, et al.
Published: (2023)

Feature Learning in Wide Neural Networks under $μ$P: Identifiability and Sparse-Dictionary Decomposition of the Mean-Field Limit
by: Xodarev, Akmal
Published: (2026)

Physics-informed machine learning: A mathematical framework with applications to time series forecasting
by: Doumèche, Nathan
Published: (2025)

Bayesian mixture models (in)consistency for the number of clusters
by: Alamichel, Louise, et al.
Published: (2022)

Error Bounds for Learning with Vector-Valued Random Features
by: Lanthaler, Samuel, et al.
Published: (2023)

Pair Correlation Factor and the Sample Complexity of Gaussian Mixtures
by: Aryan, Farzad
Published: (2025)

On the Statistical Optimality of Optimal Decision Trees
by: Xu, Zineng, et al.
Published: (2026)

Factor Adjusted Spectral Clustering for Mixture Models
by: Tang, Shange, et al.
Published: (2024)