arXiv Statistics ML
Spectral partitioning for $k$-block averaging kernels of finite Markov chains
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Aug 11
Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery
arXiv:2608. 08704v1 Announce Type: cross Abstract: Kernel spectral clustering with a single bandwidth can be inadequate for data exhibiting multiple characteristic pairwise-distance scales, a problem particularly prevalent in the high-dimensional regime.
arXiv Machine Learning
Jul 7
Semidefinite programming relaxations and debiasing for MAXCUT-based clustering
arXiv:2401. 10927v3 Announce Type: replace-cross Abstract: In this paper, we consider the problem of partitioning a small data sample of size $n$ drawn from a mixture of $2$ sub-gaussian distributions in $\mathbb{R}^p$.
arXiv Machine Learning
Jul 3
Incremental (k, z)-Clustering on Graphs
arXiv:2602. 08542v3 Announce Type: replace-cross Abstract: Given a weighted undirected graph, a number of clusters $k$, and an exponent $z$, the goal in the $(k, z)$-clustering problem on graphs is to select $k$ vertices as centers that minimize the sum of the distances raised to the power $z$ of each vertex to its closest center.
arXiv Machine Learning
Aug 18
Spectral Certificates and Projection-DPP Rounding for Determinantal MAP Selection
arXiv:2606. 19411v3 Announce Type: replace Abstract: Selecting a fixed-size subset that maximizes the determinant of a positive semidefinite kernel is the MAP problem for a size-constrained determinantal point process and the classical maximum-entropy sampling problem.
arXiv Machine Learning
Jun 2
Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures
arXiv:2411. 12438v2 Announce Type: replace-cross Abstract: We develop a new approach for clustering non-spherical (i.
arXiv Machine Learning
Aug 17
High-dimensional nonparametric changepoint detection via low-rank degree-two density projection
arXiv:2608. 13922v1 Announce Type: new Abstract: Detecting distributional changes in high dimension is difficult when neither the pre-change nor post-change density is parametrically specified.