Search Results for author:
Found 5 papers, 2 papers with code
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models
In such mixtures, we establish that Bregman hard clustering, a variant of Lloyd's algorithm employing a Bregman divergence, is rate optimal.
When Does Bottom-up Beat Top-down in Hierarchical Community Detection?
We also establish that this bottom-up algorithm attains the information-theoretic threshold for exact recovery at intermediate levels of the hierarchy.
Higher-Order Spectral Clustering for Geometric Graphs
While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral clustering.
Community recovery in non-binary and temporal stochastic block models
This article studies the estimation of latent community memberships from pairwise interactions in a network of $N$ nodes, where the observed interactions can be of arbitrary type, including binary, categorical, and vector-valued, and not excluding even more general objects such as time series or spatial point patterns.
Almost exact recovery in noisy semi-supervised learning
Graph-based semi-supervised learning methods combine the graph structure and labeled data to classify unlabeled data.
