research
∙
04/16/2023
A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits
Personalized recommender systems suffuse modern life, shaping what media...
share
research
∙
03/31/2023
Constrained Optimization of Rank-One Functions with Indicator Variables
Optimization problems involving minimization of a rank-one convex functi...
research
∙
06/01/2022
Accelerated first-order methods for a class of semidefinite programs
This paper introduces a new storage-optimal first-order method (FOM), Ce...
research
∙
12/27/2021
Implicit regularity and linear convergence rates for the generalized trust-region subproblem
In this paper we develop efficient first-order algorithms for the genera...
research
∙
12/30/2020
Risk Guarantees for End-to-End Prediction and Optimization Processes
Prediction models are often employed in estimating parameters of optimiz...
research
∙
11/13/2020
Rebounding Bandits for Modeling Satiation Effects
Psychological research shows that enjoyment of many goods is subject to ...
research
∙
08/24/2020
Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences
We study the problem of online learning (OL) from revealed preferences: ...
research
∙
07/20/2019
The Generalized Trust Region Subproblem: solution complexity and convex hull results
We consider the Generalized Trust Region Subproblem (GTRS) of minimizing...
research
∙
02/16/2017
Theoretical and Practical Advances on Smoothing for Extensive-Form Games
Sparse iterative methods, in particular first-order methods, are known t...
research
∙
07/04/2012
On unified view of nullspace-type conditions for recoveries associated with general sparsity structures
We discuss a general notion of "sparsity structure" and associated recov...
research
∙
11/10/2011
