A single Haar-wavelet-based algorithm achieves an instance-adaptive phi-regret bound interpolating external, internal, and swap regret, with the same computational complexity as Blum-Mansour swap regret minimization.
On tractable -equilibria in non-concave games
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sparsity-Based Interpolation of External, Internal and Swap Regret
A single Haar-wavelet-based algorithm achieves an instance-adaptive phi-regret bound interpolating external, internal, and swap regret, with the same computational complexity as Blum-Mansour swap regret minimization.