Fetching the paper…
Reading the bibliography…
In this paper, we present an efficient algorithm to solve online Stackelberg games, featuring multiple followers, in a follower-agnostic manner.
A one-measurement form of simultaneous perturbation stochastic approximation
James C Spall · 1997
Earlier work this paper cites.
The theory of learning in games
Drew Fudenberg and David K Levine · 1998
Earlier work this paper cites.
Finite-dimensional variational inequalities and complementarity problems
Francisco Facchinei and Jong-Shi Pang · 2003
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham D Flaxman, Adam Tauman Kalai, and H Brendan McMahan · 2004
Earlier work this paper cites.
An overview of bilevel optimization
Benoît Colson, Patrice Marcotte, and Gilles Savard · 2007
Earlier work this paper cites.
Stochastic approximation: a dynamical systems viewpoint
Vivek S Borkar · 2009
Earlier work this paper cites.
Learning and approximating the optimal strategy to commit to
Joshua Letchford, Vincent Conitzer, and Kamesh Munagala · 2009
Earlier work this paper cites.
Practical bilevel optimization: algorithms and applications
Jonathan F Bard · 2013
Earlier work this paper cites.
Introduction to Smooth Manifolds
John M. Lee · 2013
Earlier work this paper cites.
Learning optimal commitment to overcome insecurity
Avrim Blum, Nika Haghtalab, and Ariel D Procaccia · 2014
Earlier work this paper cites.
The traffic assignment problem: models and methods
Michael Patriksson · 2015
Earlier work this paper cites.
Stephen Gould, Basura Fernando, Anoop Cherian, Peter Anderson, Rodrigo Santa Cruz, and Edison Guo · 2016
Earlier work this paper cites.
Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition
Hamed Karimi, Julie Nutini, and Mark Schmidt · 2016
Earlier work this paper cites.
Gradient descent only converges to minimizers
Jason D Lee, Max Simchowitz, Michael I Jordan, and Benjamin Recht · 2016
Earlier work this paper cites.
Hyperparameter optimization with approximate gradient
Fabian Pedregosa · 2016
Cited alongside, same era.
Forward and reverse gradient-based hyperparameter optimization
Luca Franceschi, Michele Donini, Paolo Frasconi, and Massimiliano Pontil · 2017
Cited alongside, same era.
A review on bilevel optimization: From classical to evolutionary approaches and applications
Ankur Sinha, Pekka Malo, and Kalyanmoy Deb · 2017
Cited alongside, same era.
Stackelberg-game-based modeling and optimization for supply chain design and operations: A mixed integer bilevel programming framework
Dajun Yue and Fengqi You · 2017
Cited alongside, same era.
Inverse optimization with noisy data
Anil Aswani, Zuo-Jun Shen, and Auyon Siddiq · 2018
Cited alongside, same era.
Bilevel programming for hyperparameter optimization and meta-learning
Luca Franceschi, Paolo Frasconi, Saverio Salzo, Riccardo Grazzi, and Massimiliano Pontil · 2018
A generic first-order algorithmic framework for bi-level programming beyond lower-level singleton
Risheng Liu, Pan Mu, Xiaoming Yuan, Shangzhi Zeng, and Jin Zhang · 2020
Later among the works it cites.
Learning to play sequential games versus unknown opponents
Pier Giuseppe Sessa, Ilija Bogunovic, Maryam Kamgarpour, and Andreas Krause · 2020
Later among the works it cites.
Sample-efficient learning of stackelberg equilibria in general-sum games
Yu Bai, Chi Jin, Huan Wang, and Caiming Xiong · 2021
Later among the works it cites.
Investigating bi-level optimization for learning and vision from a unified perspective: A survey and beyond
Risheng Liu, Jiaxin Gao, Jin Zhang, Deyu Meng, and Zhouchen Lin · 2021
Later among the works it cites.
Inducing equilibria via incentives: Simultaneous design-and-play ensures global convergence
Boyi Liu, Jiayang Li, Zhuoran Yang, Hoi-To Wai, Mingyi Hong, Yu Marco Nie, and Zhaoran Wang · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Approximation methods for bilevel programming
Saeed Ghadimi and Mengdi Wang · 2018
Cited alongside, same era.
Lectures on convex optimization
Yurii Nesterov et al · 2018
Cited alongside, same era.
Convergence of learning dynamics in stackelberg games
Tanner Fiez, Benjamin Chasnov, and Lillian J Ratliff · 2019
Cited alongside, same era.
Learning optimal strategies to commit to
Binghui Peng, Weiran Shen, Pingzhong Tang, and Song Zuo · 2019
Cited alongside, same era.
Truncated back-propagation for bilevel optimization
Amirreza Shaban, Ching-An Cheng, Nathan Hatch, and Byron Boots · 2019
Cited alongside, same era.
On the iteration complexity of hypergradient computation
Riccardo Grazzi, Luca Franceschi, Massimiliano Pontil, and Saverio Salzo · 2020
Cited alongside, same era.
A value-function-based interior-point method for non-convex bi-level optimization
Risheng Liu, Xuan Liu, Xiaoming Yuan, Shangzhi Zeng, and Jin Zhang · 2021
Later among the works it cites.
Towards gradient-based bilevel optimization with non-convex followers and beyond
Risheng Liu, Yaohua Liu, Shangzhi Zeng, and Jin Zhang · 2021
Later among the works it cites.
Differentiable bilevel programming for stackelberg congestion games
Jiayang Li, Jing Yu, Qianni Wang, Boyi Liu, Zhaoran Wang, and Yu Marco Nie · 2022
Later among the works it cites.
Zeroth-order methods for convex-concave min-max problems: Applications to decision-dependent risk minimization
Chinmay Maheshwari, Chih-Yuan Chiu, Eric Mazumdar, Shankar Sastry, and Lillian Ratliff · 2022
Later among the works it cites.
A constrained optimization approach to bilevel optimization with multiple inner minima
Daouda Sow, Kaiyi Ji, Ziwei Guan, and Yingbin Liang · 2022
Later among the works it cites.
Optimization for data analysis
Stephen J Wright and Benjamin Recht · 2022
Later among the works it cites.
Bome! bilevel optimization made easy: A simple first-order approach
Mao Ye, Bo Liu, Stephen Wright, Peter Stone, and Qiang Liu · 2022
Later among the works it cites.
On bilevel optimization without lower-level strong convexity
Lesi Chen, Jing Xu, and Jingzhao Zhang · 2023
Closest in time.