arXiv:2607. 03145v1 Announce Type: cross Abstract: The informativeness of a training set is as consequential as its size, yet most sampling strategies remain agnostic to the intrinsic geometry of the data distribution.
By Alexandre L. M. Levada
arXiv:2605. 14981v2 Announce Type: replace Abstract: Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system.
By Ao Xu, Tieru Wu
arXiv:2505. 03649v4 Announce Type: replace-cross Abstract: Modeling of intricate relational patterns has become a cornerstone of contemporary statistical research and related data science fields.
By Bernardo Marenco, Paola Bermolen, Marcelo Fiori, Federico Larroca, Gonzalo Mateos
arXiv:2608. 16315v1 Announce Type: cross Abstract: Correlation clustering is a fundamental unsupervised learning problem.
By Rajath Rao K. N., Jens Schl\"oter, Sami Davies, Amira Ouchene, Yasamin Nazari
The paper introduces a framework for restricted inference on random dot product graphs whose latent positions lie on an unknown low‑dimensional support manifold. It proposes semisupervised decision rules that employ Isomap manifold learning to build a low‑dimensional Euclidean representation of the observed graph, and then apply an isometrically invariant function to map point configurations to actions. The authors analyze how the risk of these rules converges to that of an oracle rule as the amount of auxiliary data sampled from the manifold increases.
By Michael W. Trosset, Carey E. Priebe
arXiv:2607. 06644v1 Announce Type: cross Abstract: Determinantal point processes have recently emerged as a kernel-based alternative to standard independent sampling for constructing efficient minibatches, coresets, and other compact representations of large-scale datasets.
By Hoang-Son Tran, Pranav Gupta, Subhroshekhar Ghosh