arXiv (All)
open access
Online Discrepancy of Sparse Random Vectors over Long Horizons
We study online vector balancing for independent sparse random vectors: each arrival is supported on a uniformly random set of $s$ of the $n$ coordinates, with nonzero entries equal to one (binary model) or independent random signs (signed model), and an online algorithm must sign each vector upon a
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
- Stable and Online Algorithms for Random Matrix Discrepancy#1156862
- Vantage: Availability-Graded Broadcast for Signature-Free BFT#793860
- Vantage: Availability-Graded Broadcast for Signature-Free BFT#789841
- Dicey games: Shared sources of randomness in distributed systems#449044
- Optimal Analysis of Greedy for Stochastic Online Euclidean Matching#1050136
Record · ID 1457564
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