Question Q. 樹籬算法(Hedge algorithm)的證明技巧? Q. 樹籬算法(Hedge algorithm)的證明技巧? Evidence: 2021:Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularization 2021:Relaxing the I.I.D.

Question Q. 樹籬算法(Hedge algorithm)的公平性基礎? Q. 樹籬算法(Hedge algorithm)的公平性基礎? Evidence: 2021:Best-Case Lower Bounds in Online Learning 2021:Best-Case Lower Bounds in Online Learning

Question Q. 樹籬算法(Hedge algorithm)的公平性基礎? Q. 樹籬算法(Hedge algorithm)的公平性基礎? Formulation 問題設定: 「行動$w_t

Question Q. 樹籬算法(Hedge algorithm)的公平性基礎? Q. 樹籬算法(Hedge algorithm)的公平性基礎? 群體脈絡線上學習 a.group-outcome sequence tuple: 時間

Group Fairness + Hedge Group Fairness + Hedge: 2021:Best-Case Lower Bounds in Online Learning If each of finitely many experts approximately satisfies a certain notion of group fairness, then a clever use of the Hedge algorithm (running it separately on each group) also approximately satisfies the same notion of group …