arXiv:2606. 16341v1 Announce Type: new Abstract: A filtered approximate-nearest-neighbor (ANN) query returns the k nearest vectors among those satisfying an attribute predicate P of selectivity s.
By Madhulatha Mandarapu, Sandeep Kunkunuru
arXiv:2606. 00414v1 Announce Type: new Abstract: When many reinforcement-learning policies achieve near-optimal return, a post-hoc auditor may have to distinguish among many behaviorally distinct but return-equivalent policies.
By Ibne Farabi Shihab, Sanjeda Akter, Anuj Sharma
The paper presents a block‑wise differentiable Sinkhorn attention mechanism designed for long‑context balanced entropic optimal transport on TPU hardware. By stopping a $T$‑step Sinkhorn solve and unrolling a short refinement tail, the authors derive an exact surrogate gradient that achieves efficient block‑wise cost and memory usage. Experimental results on synthetic masked problems and a Pfam protein‑family screen demonstrate high numerical accuracy and sustained throughput on TPU v6e‑8, with notable improvements in reconstruction and sparse cross‑entropy metrics.
By Dylan Forde
arXiv:2606. 21253v2 Announce Type: replace Abstract: Continual learning that is gradient-free, local, online, and append-only is attractive for edge and streaming deployment, but its value is usually argued informally.
By Jianwei Lou (RailMind Systems, Neuss, Germany)
QuadraSHAP is a method for computing ε-exact Shapley values in product games, where coalition values factor across players. It replaces the exponential coalition sum with a one-dimensional polynomial integral, using Gauss–Legendre quadrature to achieve exact values when ε = 0 and provides a computable error bound for ε > 0. The approach supports weighted sums of product games, enabling baseline and empirical interventional attribution for models such as log-link regression, Cox models, odds-scale classifiers, product-kernel machines, and tree-based models, and achieves logarithmic parallel time with efficient GPU evaluation even for hundreds of thousands of features.
By Majid Mohammadi, Grigory Reznikov, Pavel Sinitcyn, Krikamol Muandet, Siu Lun Chau
arXiv:2608. 08826v1 Announce Type: new Abstract: Adaptive procedures must work without nuisance information an oracle may use, such as a gradient scale or smoothness index, and robust procedures may have to answer queries whose coordinate and inspection time are chosen only after the data are seen.
By Ibne Farabi Shihab, Adria Binte Habib