research
∙
05/31/2023
Parameter-free projected gradient descent
We consider the problem of minimizing a convex function over a closed co...
share
research
∙
05/25/2023
Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness
We consider contextual bandit problems with knapsacks [CBwK], a problem ...
research
∙
03/18/2022
The price of unfairness in linear bandits with biased feedback
Artificial intelligence is increasingly used in a wide range of decision...
research
∙
10/29/2021
Training Integrable Parameterizations of Deep Neural Networks in the Infinite-Width Limit
To theoretically understand the behavior of trained deep neural networks...
research
∙
08/06/2021
Localization in 1D non-parametric latent space models from pairwise affinities
We consider the problem of estimating latent positions in a one-dimensio...
research
∙
06/23/2021
A Unified Approach to Fair Online Learning via Blackwell Approachability
We provide a setting and a general approach to fair online learning with...
research
∙
05/17/2019
Pair Matching: When bandits meet stochastic block model
The pair-matching problem appears in many applications where one wants t...
research
∙
07/19/2018
Partial recovery bounds for clustering with the relaxed Kmeans
We investigate the clustering performances of the relaxed Kmeans in the ...
research
∙
08/08/2015
Minimax Optimal Variable Clustering in G-Block Correlation Models via Cord
The goal of variable clustering is to partition a random vector X∈ R^p ...
research
∙
04/27/2014
