PhD Seminar • Machine Learning • Annealing Knowledge Distillation
Please note: This PhD seminar will take place online.
Aref Jafari, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ali Ghodsi
Aref Jafari, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ali Ghodsi
Ihab Ilyas
Professor, Cheriton School of Computer Science
NSERC-Thomson Reuters Research Chair on Data Quality
Distinguished Engineer, Apple
Gustavo Sutter Pessurno de Carvalho, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Pascal Poupart
Pablo Millán Arias, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lila Kari
Ehsan Ganjidoost, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Jeff Orchard
Rachel Yun Zhang, PhD student
CSAIL, Massachusetts Institute of Technology
A code, which is a set of strings called codewords, is locally testable if one can test whether a given word is close to a codeword by reading only a few bits. Locally testable codes have been studied since the 1990s as key ingredients in the construction of probabilistically checkable proofs.
Mika Göös, Assistant Professor
Theory Group, École polytechnique fédérale de Lausanne
We present a top-down lower-bound method for depth-4 Boolean circuits. In particular, we give a new proof of the well-known result that the parity function requires depth-4 circuits of size exponential in n^{1/3}. Our proof is an application of robust sunflowers and block unpredictability.
Joint with Artur Riazanov, Anastasia Sofronova, and Dmitry Sokolov.
Murray Dunne, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Sebastian Fischmeister
Han Zhao, Assistant Professor
Computer Science, University of Illinois Urbana-Champaign
Amazon Visiting Academic, Amazon AI and Search Science
To mitigate the bias exhibited by machine learning models, fairness criteria can be integrated into the training process to ensure fair treatment across all demographics, but it often comes at the expense of model performance. Understanding such tradeoffs, therefore, underlies the design of optimal and fair algorithms.
Marina Meila
Department of Statistics, University of Washington
Senior Fellow, University of Washington’s eScience Institute