4 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.LG2023★ 4 cited
LayerNAS: Neural Architecture Search in Polynomial Complexity
Yicheng Fan, Dana Alon, Jingyue Shen +7
Neural Architecture Search (NAS) has become a popular method for discovering effective model architectures, especially for target hardware. As such, NAS methods that find optimal a…
cs.LG2023★ 1 cited
SLaM: Student-Label Mixing for Distillation with Unlabeled Examples
Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh +3
Knowledge distillation with unlabeled examples is a powerful training paradigm for generating compact and lightweight student models in applications where the amount of labeled dat…
math.CO2014
Random Walks that Find Perfect Objects and the Lovász Local Lemma
Dimitris Achlioptas, Fotis Iliopoulos
We give an algorithmic local lemma by establishing a sufficient condition for the uniform random walk on a directed graph to reach a sink quickly. Our work is inspired by Moser's e…