Search papers, labs, and topics across Lattice.
Affiliation:
1
0
1
Online learning's long-standing five-expert prediction problem is finally solved: the adversary's optimal finite-horizon policy is $(1,0,1,0,0)$, rigorously refuting the global optimality of the COMB strategy via a machine-verified Lean proof.
