arxiv
PublishedAugust 28, 2026 at 4:00 AM
—neutral
Sharp Minimax Regret for Infinite-Memory Logistic Prediction
Publisher summary· verbatim
arXiv:2608.26515v1 Announce Type: cross Abstract: We study online prediction for a specific finite-alphabet, exogenously driven source with infinite input memory. Independent Rademacher inputs $(U_t)$ are observed sequentially, and the next binary mark has logit $\sum_{j=1}^{t}\theta_jU_{t+1-j}$, wh
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
The Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗