scientific article
From MaRDI portal
Publication:2921693
zbMath1297.90117MaRDI QIDQ2921693
Abraham D. Flaxman, H. Brendan McMahan, Adam Tauman Kalai
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
No Regret Learning in Oligopolies: Cournot vs. Bertrand ⋮ Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems ⋮ A theoretical and empirical comparison of gradient approximations in derivative-free optimization ⋮ Finite Difference Gradient Approximation: To Randomize or Not? ⋮ Generalized mirror descents in congestion games ⋮ Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling ⋮ Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case ⋮ Random gradient-free minimization of convex functions ⋮ An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization ⋮ Portfolio selection algorithm under financial crisis: a case study with Bursa Malaysia ⋮ Minimax efficient finite-difference stochastic gradient estimators using black-box function evaluations ⋮ Decentralized online convex optimization based on signs of relative states ⋮ Personalized optimization with user's feedback ⋮ Parallel distributed block coordinate descent methods based on pairwise comparison oracle ⋮ Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information ⋮ A mixed finite differences scheme for gradient approximation ⋮ Online strongly convex optimization with unknown delays ⋮ Zeroth-order optimization with orthogonal random directions ⋮ Gradient-free federated learning methods with \(l_1\) and \(l_2\)-randomization for non-smooth convex stochastic optimization problems ⋮ Online distributed detection of sensor networks with delayed information ⋮ Distributed online bandit linear regressions with differential privacy ⋮ Zeroth-order feedback optimization for cooperative multi-agent systems ⋮ Online bandit convex optimisation with stochastic constraints via two-point feedback ⋮ On poisoned Wardrop equilibrium in congestion games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decentralized online convex optimization with compressed communications ⋮ Nonsmooth optimization by Lie bracket approximations into random directions ⋮ Stochastic Saddle Point Problems with Decision-Dependent Distributions ⋮ Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks ⋮ Distributed bandit online optimisation for energy management in smart grids ⋮ Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand ⋮ Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs ⋮ Event-triggered distributed online convex optimization with delayed bandit feedback ⋮ Technical Note—Nonstationary Stochastic Optimization Under Lp,q-Variation Measures ⋮ Learning in games with continuous action sets and unknown payoff functions ⋮ An Online Policy Gradient Algorithm for Markov Decision Processes with Continuous States and Actions ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Data-Driven Decisions for Problems with an Unspecified Objective Function ⋮ Exploratory distributions for convex functions ⋮ Online linear optimization and adaptive routing ⋮ Policy Gradient Methods for the Noisy Linear Quadratic Regulator over a Finite Horizon ⋮ Smoothed functional-based gradient algorithms for off-policy reinforcement learning: a non-asymptotic viewpoint ⋮ Regret bounded by gradual variation for online convex optimization ⋮ A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization ⋮ Non-Stationary Stochastic Optimization ⋮ Truthful Mechanisms with Implicit Payment Computation ⋮ The Data-Driven Newsvendor Problem: New Bounds and Insights ⋮ Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization ⋮ Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games ⋮ Accelerating reinforcement learning with a directional-Gaussian-smoothing evolution strategy ⋮ A new one-point residual-feedback oracle for black-box learning and control ⋮ Derivative-free optimization methods ⋮ Perspectives on multiagent learning ⋮ Warranty optimization in a dynamic environment ⋮ Robust Power Management via Learning and Game Design ⋮ Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise ⋮ Partial Monitoring—Classification, Regret Bounds, and Algorithms ⋮ Derivative-free optimization over multi-user MIMO networks ⋮ Unnamed Item ⋮ Distributed online bandit optimization under random quantization ⋮ Unnamed Item ⋮ Noisy zeroth-order optimization for non-smooth saddle point problems ⋮ On Gradient-Based Learning in Continuous Games ⋮ On two continuum armed bandit problems in high dimensions
