No-regret algorithms in on-line learning, games and convex optimization
From MaRDI portal
Publication:6120936
Recommendations
Cites work
- A continuous-time approach to online optimization
- A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A general class of adaptive strategies
- A new mathematical framework for the study of linkage and selection
- A Randomization Rule for Selecting Forecasts
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- A simplified view of first order methods for optimization
- A variational perspective on accelerated methods in optimization
- A wide range no-regret theorem
- Adaptive game playing using multiplicative weights
- Adaptive Heuristics
- Adjustment dynamics and rational play in games
- An analog of the minimax theorem for vector payoffs
- Approachability, regret and calibration: implications and equivalences
- Asymptotic calibration
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
- Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems
- Best response dynamics for continuous zero-sum games
- Bregman forward-backward operator splitting
- Calibrated learning and correlated equilibrium
- Conditional universal consistency.
- Consistency and cautious fictitious play
- Convex Analysis
- Convex optimization: algorithms and complexity
- Dual averaging methods for regularized stochastic learning and online optimization
- Dynamical systems and variational inequalities
- Efficient algorithms for online decision problems
- Evolution equations for maximal monotone operators: asymptotic analysis in continuous and discrete time
- Evolutionarily stable strategies and game dynamics
- Evolutionary Games and Population Dynamics
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Exponential weight algorithm in continuous time
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Finite composite games: equilibria and dynamics
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Forward-backward splitting with Bregman distances
- From external to internal regret
- Hessian Riemannian Gradient Flows in Convex Programming
- scientific article; zbMATH DE number 5869530 (Why is no real title available?)
- scientific article; zbMATH DE number 3122013 (Why is no real title available?)
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3498726 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1233801 (Why is no real title available?)
- scientific article; zbMATH DE number 5176447 (Why is no real title available?)
- scientific article; zbMATH DE number 3376275 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- scientific article; zbMATH DE number 3062452 (Why is no real title available?)
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Internal regret in on-line portfolio selection
- Introductory lectures on convex optimization. A basic course.
- Large population potential games
- Learning in games via reinforcement and regularization
- Learning in games with continuous action sets and unknown payoff functions
- Minmax via replicator dynamics
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- No-regret dynamics and fictitious play
- On damped second-order gradient systems
- On some global and unilateral adaptive dynamics
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the generalization of a direct method of the calculus of variations
- Online learning and online convex optimization
- Penalty-regulated dynamics and robust learning procedures in games
- Potential games
- Potential games with continuous player sets
- Potential-based algorithms in on-line prediction and game theory
- Potential-function proofs for gradient methods
- Prediction, Learning, and Games
- Primal-dual subgradient methods for convex problems
- Projected Dynamical Systems in the Formulation, Stability Analysis, and Computation of Fixed-Demand Traffic Network Equilibria
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximité et dualité dans un espace hilbertien
- Regret in the on-line decision problem
- Regret-based continuous-time dynamics.
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Relatively smooth convex optimization by first-order methods, and applications
- Replicator dynamics: old and new
- Riemannian game dynamics
- Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
- Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization
- Stochastic Approximations and Differential Inclusions
- The Nonstochastic Multiarmed Bandit Problem
- The projection dynamic and the geometry of population games
- The projection dynamic and the replicator dynamic
- The weighted majority algorithm
- Universal Portfolios
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(1)
This page was built for publication: No-regret algorithms in on-line learning, games and convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120936)
