research
∙
11/04/2022
Online Learning and Bandits with Queried Hints
We consider the classic online learning and stochastic multi-armed bandi...
share
research
∙
10/06/2020
Online Linear Optimization with Many Hints
We study an online linear optimization (OLO) problem in which the learne...
research
∙
06/19/2020
Fair clustering via equitable group representations
What does it mean for a clustering to be fair? One popular approach seek...
research
∙
02/11/2020
Online Learning with Imperfect Hints
We consider a variant of the classical online linear optimization proble...
research
∙
05/28/2019
Approximate Guarantees for Dictionary Learning
In the dictionary learning (or sparse coding) problem, we are given a co...
research
∙
11/29/2018
Smoothed Analysis in Unsupervised Learning via Decoupling
Smoothed analysis is a powerful paradigm in overcoming worst-case intrac...
research
∙
04/27/2018
Low Rank Approximation in the Presence of Outliers
We consider the problem of principal component analysis (PCA) in the pre...
research
∙
02/20/2018
Sublinear Algorithms for MAXCUT and Correlation Clustering
We study sublinear algorithms for two fundamental graph problems, MAXCUT...
research
∙
01/03/2014
More Algorithms for Provable Dictionary Learning
In dictionary learning, also known as sparse coding, the algorithm is gi...
research
∙
11/14/2013