arXiv (All)
open access
Min-Max Grassmannian Optimization for Online Subspace Tracking
We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannia
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Online Learning via Learned Latent Bayesian Tracking#1106258
- Hessian Schatten-Norm Regularization for Linear Inverse Problems#235364
- ITSPACE: Monotone Gaussian Optimal Transport Updates#321830
- Following a Unique Path: A Fast Certifier Applied to Outlier-Robust Pose Registration#925579
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
Record · ID 1062880
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive