Content tagged with 2020

• Publications menu and navigation
• [J32] Fast optimization with zeroth-order feedback in distributed multi-user MIMO systems
• [J31] On the convergence of mirror descent beyond stochastic convex programming
• [J30] When is selfish routing bad? The price of anarchy in light and heavy traffic
• [C60] On the almost sure convergence of stochastic gradient descent in non-convex problems
• [C59] No-regret learning and mixed Nash equilibria: They do not mix
• [C58] Online non-convex optimization with imperfect feedback
• [C57] Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling
• [C56] A new regret analysis for Adam-type algorithms
• [C55] Gradient-free online learning in continuous games with delayed rewards
• [C54] Finite-time last-iterate convergence for multi-agent learning in games
• [C53] Quick or cheap? Breaking points in dynamic markets
• [C52] Derivative-free optimization over multi-user MIMO networks
• [C51] Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach