The following pages link to (Q3174120):
Displayed 29 items.
- A general internal regret-free strategy (Q291209) (← links)
- PAMR: passive aggressive mean reversion strategy for portfolio selection (Q420935) (← links)
- \(\lambda \)-perceptron: an adaptive classifier for data streams (Q609177) (← links)
- Online aggregation of unbounded losses using shifting experts with confidence (Q669288) (← links)
- Replicator dynamics: old and new (Q828036) (← links)
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures (Q972131) (← links)
- Supermartingales in prediction with expert advice (Q982635) (← links)
- The query complexity of correlated equilibria (Q1651292) (← links)
- Sampled fictitious play is Hannan consistent (Q1753299) (← links)
- Forecasting electricity consumption by aggregating specialized experts (Q1945028) (← links)
- On adaptive heuristics that converge to correlated equilibrium (Q2183972) (← links)
- Exponential weight approachability, applications to calibration and regret minimization (Q2342741) (← links)
- Near-optimal no-regret algorithms for zero-sum games (Q2516247) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Logarithmic regret in online linear quadratic control using Riccati updates (Q2674833) (← links)
- Learning Hurdles for Sleeping Experts (Q2828218) (← links)
- Convergence Time of Power-Control Dynamics (Q3012955) (← links)
- Supermartingales in Prediction with Expert Advice (Q3529920) (← links)
- (Q4638112) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
- Online portfolio selection (Q5176170) (← links)
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals (Q5214272) (← links)
- Partial Monitoring—Classification, Regret Bounds, and Algorithms (Q5247607) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- Internal regret in on-line portfolio selection (Q5916205) (← links)
- Internal regret in on-line portfolio selection (Q5921688) (← links)
- Mini-workshop: Mathematical foundations of robust and generalizable learning. Abstracts from the mini-workshop held October 2--8, 2022 (Q6095403) (← links)
- No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)