research
∙
05/23/2023
Disincentivizing Polarization in Social Networks
On social networks, algorithmic personalization drives users into filter...
share
research
∙
02/20/2023
Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty
In online marketplaces, customers have access to hundreds of reviews for...
research
∙
04/15/2022
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts
The incorporation of cutting planes within the branch-and-bound algorith...
research
∙
02/22/2022
No-Regret Learning in Partially-Informed Auctions
Auctions with partially-revealed information about items are broadly emp...
research
∙
11/18/2021
Improved Learning Bounds for Branch-and-Cut
Branch-and-cut is the most widely used algorithm for solving integer pro...
research
∙
06/08/2021
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Cutting-plane methods have enabled remarkable successes in integer progr...
research
∙
12/24/2020
Generalization in portfolio-based algorithm selection
Portfolio-based algorithm selection has seen tremendous practical succes...
research
∙
07/02/2020
Private Optimization Without Constraint Violations
We study the problem of differentially private optimization with linear ...
research
∙
06/21/2020
Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Automating algorithm configuration is growing increasingly necessary as ...
research
∙
08/08/2019
How much data is sufficient to learn high-performing algorithms?
Algorithms for scientific analysis typically have tunable parameters tha...
research
∙
05/26/2019
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees
Algorithms typically come with tunable parameters that have a considerab...
research
∙
04/26/2019
Learning to Prune: Speeding up Repeated Computations
It is common to encounter situations where one must solve a sequence of ...
research
∙
02/25/2019
Estimating Approximate Incentive Compatibility
In practice, most mechanisms for selling, buying, matching, voting, and ...
research
∙
03/27/2018
Learning to Branch
Tree search algorithms, such as branch-and-bound, are the most widely us...
research
∙
11/14/2016