arXiv Machine Learning
Geometric Kernel Diversity: An Axiomatic Diversity Measure in Euclidean Space
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
Oct 14
Geometric Kernel Diversity: An Axiomatic Diversity Measure in Euclidean Space
Quantifying the diversity of a set of objects is a fundamental problem in machine learning and statistics. Mironov and Prokhorenkova (2025) recently showed that three axioms-monotonicity, uniqueness,...
arXiv Machine Learning
Sep 17
Sharp margin-based generalization bounds for realizable SVM
arXiv:2609. 17845v1 Announce Type: cross Abstract: Let the exact homogeneous hard-margin support vector machine be trained on \(m\) independent observations from a Borel probability law on a real Hilbert space.
arXiv Machine Learning
Jul 28
Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD
arXiv:2607. 24235v1 Announce Type: cross Abstract: Over the past 20 years, kernel discrepancies have been leveraged as a highly powerful tool for quantifying the disagreement of distributions, with numerous successful applications in two-sample, goodness-of-fit, and independence testing, among others.
arXiv Machine Learning
Jun 18
Fisher Width: A Geometric Measure of Complexity on Statistical Manifolds
arXiv:2606. 18306v1 Announce Type: new Abstract: Gaussian width is a central geometric complexity measure in high-dimensional probability, compressed sensing, convex optimization, and learning theory.
arXiv Machine Learning
Sep 15
Low-Dimensional Embeddings for Gaussian Kernels on Manifolds
arXiv:2609.15179v1 Announce Type: cross Abstract: The Gaussian kernel is a widely used similarity measure underlying kernel methods such as kernel PCA and spectral clustering, but computing Gaussian...
arXiv Machine Learning
Sep 3
Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models
arXiv:2609. 02155v1 Announce Type: new Abstract: The Johnson-Lindenstrauss (JL) lemma guarantees that a random projection of $n$ points to $m=O(\varepsilon^{-2}\log n)$ dimensions preserves pairwise squared distances within relative error $\varepsilon$ with high probability, and this dimension order is asymptotically optimal.