Numerical solution of a PDE arising from prediction with expert advice
Not on the map. Why?
Abstract (arXiv)
This work investigates the online machine learning problem of prediction with expert advice in an adversarial setting through numerical analysis of, and experiments with, a related partial differential equation. The problem is a repeated two-person game involving decision-making at each step informed by n experts in an adversarial environment. The continuum limit of this game over a large number of steps is a degenerate elliptic equation whose solution encodes the optimal strategies for both players. We develop numerical methods for approximating the solution of this equation in relatively high dimensions (n≤ 10) by exploiting symmetries in the equation and the solution to drastically reduce the size of the computational domain. Based on our numerical results we make a number of conjectures about the optimality of various adversarial strategies, in particular about the non-optimality of the COMB strategy.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 18 of its 46 references that are in the map. First posted on arXiv 9 Jun 2024.
Builds on
18 of 46 references.
References · 18
- 2017The game theoretic p-Laplacian and semi-supervised learning with few labelscited by 22
- 2019Prediction with Expert Advice: a PDE Perspectivecited by 17
- 2019New Potential-Based Bounds for Prediction with Expert Advicecited by 16
- 2017Consistency of Lipschitz learning with infinite unlabeled data and finite labeled datacited by 15
- 2019Analysis and algorithms for ℓp-based semi-supervised learning on graphscited by 14
- 2019Finite-Time 4-Expert Prediction Problemcited by 14
- 2014Towards Optimal Algorithms for Prediction with Expert Advicecited by 13
- 2019On the asymptotic optimality of the comb strategy for prediction with expert advicecited by 10
- 2016Tight Lower Bounds for Multiplicative Weights Algorithmic Familiescited by 9
- 2020A PDE Approach to the Prediction of a Binary Sequence with Advice from Two History-Dependent Expertscited by 7
- 2018The limit shape of convex hull peelingcited by 6
- 2019Experimental Evidence for Asymptotic Non-Optimality of Comb Adversary Strategycited by 6
6 more
- 2019New Potential-Based Bounds for the Geometric-Stopping Version of Prediction with Expert Advicecited by 6
- 2020Malicious Experts versus the multiplicative weights algorithm in online predictioncited by 6
- 2020Online Prediction With History-Dependent Experts: The General Casecited by 6
- 2017PDE approach to the problem of online prediction with expert advice: a construction of potential-based strategiescited by 4
- 2020Asymptotically optimal strategies for online prediction with history-dependent expertscited by 4
- 2024Consistency of semi-supervised learning, stochastic tug-of-war games, and the p-Laplaciancited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.