Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:

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

Friday, November 24, 2023 11:00 am - 12:00 pm EST (GMT -05:00)

Seminar • Artificial Intelligence • Fair and Optimal Prediction via Post-Processing

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 master’s thesis presentation will take place in DC 2310 and online.

Gengyi Sun, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shane McIntosh

Monday, November 27, 2023 12:00 pm - 1:00 pm EST (GMT -05:00)

Seminar • Algorithms and Complexity • Top-Down Lower Bounds for Depth-Four Circuits

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 defence will take place in DC 2314 and online.

Johra Muhammad Moosa, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Bin Ma