Events

Please note: This seminar will take place in M3 4206 and online.

David Wajc, Senior Lecturer | Assistant Professor, Taub Fellow
The Technion, Israel Institute of Technology

Please note: This seminar will take place in DC 1304.

Marina Meila
Department of Statistics, University of Washington
Senior Fellow, University of Washington’s eScience Institute

Please note: This CrySP Speaker Series on Privacy talk will take place in DC 1302 and online.

Kevin Yeo
Research Engineering Manager, Google
PhD candidate, Columbia University

Private information retrieval (PIR) is a very promising cryptographic tool that enables privacy-preserving data querying that has endless implications to real-world applications. Unfortunately, PIR’s high cost remains a hindrance in widespread adoption.

Please note: This PhD seminar will take place in DC 2564 and online.

Farshad Kazemi, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shane McIntosh

Please note: This PhD seminar will take place in DC 2564 and online.

Farshad Kazemi, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shane McIntosh

Please note: This seminar will take place in DC 1304 and online.

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.

Please note: This seminar will take place in MC 5501 and online.

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.

Please note: This PhD seminar will take place in E5 4047.

Murray Dunne, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Sebastian Fischmeister

Please note: This PhD seminar will take place in DC 1304 and online.

Shufan Zhang, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Xi He

Please note: This seminar will take place in M3 4206 and online.

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.