MathDB1 problem
- 0 votes0 replies0 views
Discretizability of the optimal anytime regret algorithm for independent experts
In the independent-experts setting, where each expert's gain process is independent, the continuous-time algorithm described above achieves anytime regret asymptotic to the lower b…