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)$).
By Grigory Ivanov, Attila Jung, M\'arton Nasz\'odi
arXiv:2310. 09149v3 Announce Type: replace-cross Abstract: We study the approximation of probability measures in the Wasserstein-$p$ distance by structured classes of approximators, motivated by applications in imaging, machine learning, and physical measurement under sensor constraints.
By Keaton Hamm, Varun Khurana
arXiv:2607. 21761v1 Announce Type: cross Abstract: We prove function-theoretic analogues of a quantitative result of Hodges on extracting the order property from a sufficiently large 2-tree coded in a binary relation.
By G Conant, C Terry
arXiv:2606. 06148v1 Announce Type: new Abstract: In recent years, list replicability has emerged as a framework for formalizing reproducibility in learning theory.
By Ari Blondal, Hamed Hatami, Pooya Hatami, Chavdar Lalov, Sivan Tretiak
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
arXiv:2609. 06050v1 Announce Type: cross Abstract: For a compact set $K\subset\mathbb{C}$, let $\vartheta(K)$ be the infimum of the planar areas of the unit lemniscates of all monic polynomials with zeros in $K$, allowing arbitrary degree and repeated zeros.
By Ioannis Tzachristas