research
∙
04/23/2023
LayerNAS: Neural Architecture Search in Polynomial Complexity
Neural Architecture Search (NAS) has become a popular method for discove...
share
research
∙
02/08/2023
SLaM: Student-Label Mixing for Semi-Supervised Knowledge Distillation
Semi-supervised knowledge distillation is a powerful training paradigm f...
research
∙
10/13/2022
Weighted Distillation with Unlabeled Examples
Distillation with unlabeled examples is a popular and powerful method fo...
research
∙
10/03/2022
Robust Active Distillation
Distilling knowledge from a large teacher model to a lightweight one is ...
research
∙
11/10/2020
Group testing and local search: is there a computational-statistical gap?
In this work we study the fundamental limits of approximate recovery in ...
research
∙
08/12/2020
A new notion of commutativity for the algorithmic Lovász Local Lemma
The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combina...
research
∙
04/05/2020
Girth-reducibility and the algorithmic barrier for coloring
All known efficient algorithms for constraint satisfaction problems are ...
research
∙
12/26/2018
Efficiently list-edge coloring multigraphs asymptotically optimally
We give polynomial time algorithms for the seminal results of Kahn, who ...
research
∙
09/21/2018
Local Computation Algorithms for the Lovász Local Lemma
We consider the task of designing Local Computation Algorithms (LCA) for...
research
∙
09/03/2018
A Local Lemma for Focused Stochastic Algorithms
We develop a framework for the rigorous analysis of focused stochastic l...
research
∙
05/05/2018
