mlsanityData to 14 Oct 2026

ARGUS: Adaptive Rotation-Invariant Geometric Unsupervised System

arXiv 2601.01297 ↗First posted 3 Jan 2026cs.LG cs.AI cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Detecting distributional drift in high-dimensional data streams presents fundamental challenges: global comparison methods scale poorly, projection-based approaches lose geometric structure, and re-clustering methods suffer from identity instability. This paper introduces Argus, A framework that reconceptualizes drift detection as tracking local statistics over a fixed spatial partition of the data manifold. The key contributions are fourfold. First, it is proved that Voronoi tessellations over canonical orthonormal frames yield drift metrics that are invariant to orthogonal transformations. The rotations and reflections that preserve Euclidean geometry. Second, it is established that this framework achieves O(N) complexity per snapshot while providing cell-level spatial localization of distributional change. Third, a graph-theoretic characterization of drift propagation is developed that distinguishes coherent distributional shifts from isolated perturbations. Fourth, product quantization tessellation is introduced for scaling to very high dimensions (d>500) by decomposing the space into independent subspaces and aggregating drift signals across subspaces. This paper formalizes the theoretical foundations, proves invariance properties, and presents experimental validation demonstrating that the framework correctly identifies drift under coordinate rotation while existing methods produce false positives. The tessellated approach offers a principled geometric foundation for distribution monitoring that preserves high-dimensional structure without the computational burden of pairwise comparisons.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 14 references that are in the map. First posted on arXiv 3 Jan 2026.

Builds on

5 of 14 references.

References · 5

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2017Word Translation Without Parallel Datacited by 487
  3. 2016Diachronic Word Embeddings Reveal Statistical Laws of Semantic Changecited by 221
  4. 2024Mitigating Hallucination with ZeroG: An Advanced Knowledge Management Enginecited by 3
  5. 2025Optimizing the Privacy-Utility Balance using Synthetic Data and Configurable Perturbation Pipelinescited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Optimizing Distributional Geometry Alignment with Optimal Transport for Generative Dataset Distillation
  2. 2026PRISM: A Geometric Risk Bound for Decomposing Drift into Scale, Shape, and Head
  3. 2026Geometry-Aware Dataset Condensation for Diffusion Model Training
  4. 2025Harmonizing Geometry and Uncertainty: Diffusion with Hyperspheres
  5. 2025The Uniformly Rotated Mondrian Kernel
  6. 2026Information-geometric adaptive sampling for graph diffusion
  7. 2026Variance Reduction on the Camera Axis: Multi-View Score Distillation for 3D
  8. 2022Semi-Discrete Normalizing Flows through Differentiable Tessellation