1 citations · 1 across the 2 of their papers we have counts for
4 papers
Pricing Query Complexity of Revenue Maximization
Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng +1
The common way to optimize auction and pricing systems is to set aside a small fraction of the traffic to run experiments. This leads to the question: how can we learn the most wit…
Learning to Price Against a Moving Target
Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng +1
In the Learning to Price setting, a seller posts prices over time with the goal of maximizing revenue while learning the buyer's valuation. This problem is very well understood whe…
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems
Benjamin Grimmer, Haihao Lu, Pratik Worah +1
Unlike nonconvex optimization, where gradient descent is guaranteed to converge to a local optimizer, algorithms for nonconvex-nonconcave minimax optimization can have topologicall…
The Landscape of the Proximal Point Method for Nonconvex-Nonconcave Minimax Optimization
Benjamin Grimmer, Haihao Lu, Pratik Worah +1
Minimax optimization has become a central tool in machine learning with applications in robust optimization, reinforcement learning, GANs, etc. These applications are often nonconv…