arXiv (All)
open access
FAST-Sync: Fast Group Synchronization for any Matrix Lie Group
Group synchronization (GS) is the problem of estimating a set of $N$ unknown elements $g_1,\ldots, g_N \in \mathcal{G}$ in a group $\mathcal{G}$, given noisy measurements of a subset of their pairwise ratios $g_i^{-1} g_j$. GS problems lie at the core of many state estimation tasks in robotics and c
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
- Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers#271792
- ExploreNet: Learning Where to Explore in Diffusion GRPO#1142930
- HiLoRe: What to Store, Compress, or Recompute for Efficient GRPO Training#1118282
- Identifiability and Joint Recovery of a Structured Signal Ensemble From Sub-Nyquist Samples#1105568
- Diffuse Gaussian Truncation For Deterministic Approximate Counting#926923
Record · ID 1143195
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