arXiv Machine Learning July 14, 2026 By Grigory Ivanov, Attila Jung, M\'arton Nasz\'odi

The VC dimension of partial concept classes via Radon's theorem

Read the original on arXiv Machine Learning →

arXiv:2607. 10751v1 Announce Type: new Abstract: Following Alon, Hanneke, Holzman, and Moran (FOCS 2021), we define a partial concept class (PCC) as a family of partial functions $f: V\to\{0,1,\ast\}$; equivalently, its concepts partition the ground set into black ($f^{-1}(1)$), grey ($f^{-1}(\ast)$), and white parts ($f^{-1}(0)$).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Sep 22

Toscani-Fourier Distance on Probability Measures: Wasserstein Control, Topological Equivalence on Model Classes, and Duality

arXiv:2609.23163v1 Announce Type: cross Abstract: Comparing probability measures in machine learning trades transport geometry against computational cost: Wasserstein distances encode the geometry of...

By Mehrdad Mohammadi

rag

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.

By Steve Hanneke, Aryeh Kontorovich

Hugging Face Trending Papers

Sep 15

Sharp margin-based generalization bounds for realizable SVM

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. We prove that, with score zero counted a...

arXiv Machine Learning

Jul 7

A simplex-based measure of symmetry

arXiv:2607. 03815v1 Announce Type: cross Abstract: For compact convex sets $L,K \subset \mathbb{R}^n$, denote by $\lambda_K(L)$ the smallest size of a homothet of $K$ that contains $L$.

By Egor Bakaev, Amir Yehudayoff

arXiv Statistics ML

3d ago

Optimal VC Dimension of Contrastive Learning with Margin

arXiv:2609.38834v1 Announce Type: cross Abstract: Contrastive learning is a successful paradigm for learning $d$-dimensional geometric representations from a collection of ``anchor--positive--negativ...

By Dionysis Arvanitakis, Vaggos Chatziafratis, Yiyuan Luo, Konstantin Makarychev

rag

arXiv Computation and Language

Sep 15

Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions

arXiv:2609.06327v2 Announce Type: replace-cross Abstract: A query-oblivious coreset for a softmax-attention head is a subset of the key-value pairs whose attention output is within $\varepsilon$ of t...

By Ofek I. Cohen

llms

One email a morning, machine-written

Related stories

Toscani-Fourier Distance on Probability Measures: Wasserstein Control, Topological Equivalence on Model Classes, and Duality

Sharp margin-based generalization bounds for realizable SVM

Sharp margin-based generalization bounds for realizable SVM

A simplex-based measure of symmetry

Optimal VC Dimension of Contrastive Learning with Margin

Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions