scientific article
From MaRDI portal
Publication:3174120
zbMath1222.68150MaRDI QIDQ3174120
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v8/blum07a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)
Related Items (29)
Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals ⋮ Replicator dynamics: old and new ⋮ A general internal regret-free strategy ⋮ The query complexity of correlated equilibria ⋮ \(\lambda \)-perceptron: an adaptive classifier for data streams ⋮ On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium ⋮ On adaptive heuristics that converge to correlated equilibrium ⋮ Logarithmic regret in online linear quadratic control using Riccati updates ⋮ 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 ⋮ PAMR: passive aggressive mean reversion strategy for portfolio selection ⋮ Forecasting electricity consumption by aggregating specialized experts ⋮ Supermartingales in Prediction with Expert Advice ⋮ Online aggregation of unbounded losses using shifting experts with confidence ⋮ Convergence Time of Power-Control Dynamics ⋮ Sampled fictitious play is Hannan consistent ⋮ Equilibria of Greedy Combinatorial Auctions ⋮ Online portfolio selection ⋮ How long to equilibrium? The communication complexity of uncoupled equilibrium procedures ⋮ Supermartingales in prediction with expert advice ⋮ Internal regret in on-line portfolio selection ⋮ Internal regret in on-line portfolio selection ⋮ Near-optimal no-regret algorithms for zero-sum games ⋮ Learning Hurdles for Sleeping Experts ⋮ Partial Monitoring—Classification, Regret Bounds, and Algorithms ⋮ Exponential weight approachability, applications to calibration and regret minimization ⋮ Unnamed Item ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
This page was built for publication:
