research
∙
07/10/2023
Online Ad Procurement in Non-stationary Autobidding Worlds
Today's online advertisers procure digital ad impressions through intera...
share
research
∙
02/16/2023
Joint Feedback Loop for Spend and Return-On-Spend Constraints
Budget pacing is a popular service that has been offered by major intern...
research
∙
02/12/2022
From Online Optimization to PID Controllers: Mirror Descent with Momentum
We study a family of first-order methods with momentum based on mirror d...
research
∙
02/04/2022
A J-Symmetric Quasi-Newton Method for Minimax Problems
Minimax problems have gained tremendous attentions across the optimizati...
research
∙
11/10/2021
Linear Convergence of Stochastic Primal Dual Methods for Linear Programming Using Variance Reduction and Restarts
There is a recent interest on first-order methods for linear programming...
research
∙
11/18/2020
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
Online allocation problems with resource constraints are central problem...
research
∙
10/20/2020
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems
Unlike nonconvex optimization, where gradient descent is guaranteed to c...
research
∙
07/01/2020
Regularized Online Allocation Problems: Fairness and Beyond
Online allocation problems with resource constraints have a rich history...
research
∙
06/15/2020
The Landscape of Nonconvex-Nonconcave Minimax Optimization
Minimax optimization has become a central tool for modern machine learni...
research
∙
02/20/2020
Contextual Reserve Price Optimization in Auctions
We study the problem of learning a linear model to set the reserve price...
research
∙
01/23/2020
An O(s^r)-Resolution ODE Framework for Discrete-Time Optimization Algorithms and Applications to Convex-Concave Saddle-Point Problems
There has been a long history of using Ordinary Differential Equations (...
research
∙
07/09/2019
A Stochastic First-Order Method for Ordered Empirical Risk Minimization
We propose a new stochastic first-order method for empirical risk minimi...
research
∙
03/20/2019
Accelerating Gradient Boosting Machine
Gradient Boosting Machine (GBM) is an extremely powerful supervised lear...
research
∙
10/25/2018
The Second-Price Knapsack Problem: Near-Optimal Real Time Bidding in Internet Advertisement
In the past decade, Real Time Bidding (RTB) has become one of the most c...
research
∙
10/25/2018
Near-Optimal Online Knapsack Strategy for Real-Time Bidding in Internet Advertising
In the past decade, Real Time Bidding (RTB) has become one of the most c...
research
∙
10/24/2018
Randomized Gradient Boosting Machine
Gradient Boosting Machine (GBM) introduced by Friedman is an extremely p...
research
∙
10/04/2018
Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems
Consider the following class of learning schemes: β̂ := β∈C ∑_j=1^n ℓ(x_...
research
∙
07/07/2018
Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions
Consider the following class of learning schemes: β̂ := _β ∑_j=1^n ℓ(x_j...
research
∙
02/27/2017
