From external to internal regret
From MaRDI portal
Recommendations
Cited in
(42)- Regret to the best vs. regret to the average
- Stopping with anticipated regret
- The query complexity of correlated equilibria
- Sampled fictitious play is Hannan consistent
- Forecasting electricity consumption by aggregating specialized experts
- On adaptive heuristics that converge to correlated equilibrium
- Exponential weight approachability, applications to calibration and regret minimization
- Near-optimal no-regret algorithms for zero-sum games
- Logarithmic regret in online linear quadratic control using Riccati updates
- Learning hurdles for sleeping experts
- A general internal regret-free strategy
- Convergence time of power-control dynamics
- scientific article; zbMATH DE number 1804097 (Why is no real title available?)
- Learning, regret minimization, and equilibria
- Supermartingales in Prediction with Expert Advice
- Calibration and internal no-regret with random signals
- PAMR: passive aggressive mean reversion strategy for portfolio selection
- scientific article; zbMATH DE number 6866347 (Why is no real title available?)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Online portfolio selection: a survey
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
- Partial monitoring -- classification, regret bounds, and algorithms
- Internal regret in on-line portfolio selection.
- Internal regret with partial monitoring: calibration-based optimal algorithms
- Regret to the Best vs. Regret to the Average
- Algorithmic Learning Theory
- Learning Theory
- Equilibria of greedy combinatorial auctions
- Internal regret in on-line portfolio selection
- Internal regret in on-line portfolio selection
- Guilt moderation
- \(\lambda \)-perceptron: an adaptive classifier for data streams
- Mini-workshop: Mathematical foundations of robust and generalizable learning. Abstracts from the mini-workshop held October 2--8, 2022
- No-regret algorithms in on-line learning, games and convex optimization
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Online aggregation of unbounded losses using shifting experts with confidence
- Pseudonorm approachability and applications to regret minimization
- Competitive ratio vs regret minimization: achieving the best of both worlds
- Two-player games for efficient non-convex constrained optimization
- Replicator dynamics: old and new
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
- Supermartingales in prediction with expert advice
This page was built for publication: From external to internal regret
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174120)
