arXiv Machine Learning
Sep 14

Information-Induced Training Geometry: Exact Reduction, Canonical Completion, and Structured Expressivity

The paper investigates how training data limits the geometry of an optimizer through the covectors that a specified information channel can observe. It establishes that, under affine‑invariant Riemannian geometry, a full‑column‑rank positive‑definite compression can be uniquely completed via a split‑Hadamard metric submetry, yielding exact variational reduction from the full geometry to the visible target. The resulting framework provides explicit formulas for pullback metrics, Gram matrices, and prior‑data shrinkage, and characterizes the gauge‑invariant rank stratification of the positive‑definite cone as the channel varies.

By Zavier Li
arXiv Machine Learning
Jun 2

FlatVPR: Plug-and-play Geo-linear Residual Adapter for Geometric Rectification of Foundation Model Feature Manifolds

arXiv:2606. 01734v1 Announce Type: cross Abstract: This paper proposes ``FlatVPR,'' a novel geometric rectification paradigm that effectively bridges the trade-off between map lightweightness and localization accuracy in visual place recognition (VPR) by enforcing a feature manifold structure where any descriptor between two adjacent anchors $\mathbf{z}_A$ and $\mathbf{z}_B$ can be accurately reconstructed via linear interpolation $\hat{\mathbf{z}}_{pseudo} = (1-t)\mathbf{z}_A + t\mathbf{z}_B$, where $t \in [0,1]$ denotes the relative position.

By Rai Hisada, Kanji Tanaka
arXiv Machine Learning
Jul 7

Fast, Parallel, Query-Efficient Binary Classification

arXiv:2607. 04062v1 Announce Type: cross Abstract: We study the fundamental classification problem of computing a separating hyperplane for a binary-labeled dataset of size $n$ with normalized $d$-dimensional features.

By Ishani Karmarkar, Liam O'Carroll, Aaron Sidford