Sharp Minimax Regret for Infinite-Memory Logistic Prediction

arXiv:2608.26515 · cs.IT, cs.LG, math.IT · Submitted 2026-08-27 · Read on arXiv

cs.IT, cs.LG, math.IT

Submitted: 2026-08-27

Updated: 2026-09-07

Terminology

• Regret — 43× in this paper · explained in 3 episodes
• Redundancy — 31× in this paper · explained in 2 episodes
• Minimax Regret — 7× in this paper · explained in 2 episodes
• Adaptation — 5× in this paper · explained in 1 episode
• Memory Decay — 3× in this paper · explained in 3 episodes
• Benchmark — 2× in this paper · explained in 2 episodes
• Fisher Information — 2× in this paper · explained in 3 episodes
• Modularity — 1× in this paper · explained in 9 episodes
• Run Online Newton Step — 1× in this paper
• Spectral Gap — 1× in this paper · explained in 5 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• The Power of Second Order Methods for Sequence Preconditioning

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions