Seminar

Please note: This PhD seminar will take place in DC 2585 (NOTE NEW ROOM).

Zeynep Korkmaz, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors M. Tamer Özsu, Khuzaima Daudjee

Please note: This PhD seminar will take place in DC 2310.

Yudong Luo, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Pascal Poupart

Please note: This PhD seminar will take place online.

Valerie Platsko, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Kate Larson

Please note: This PhD seminar will take place online.

Justin Tracey, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Goldberg

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

Yash Pote, PhD candidate
School of Computing, National University of Singapore

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

Xupeng Miao, Postdoctoral Researcher
Computer Science Department, Carnegie Mellon University

In this talk, I will introduce my work on machine learning (ML) parallelization, a critical endeavor to bridge the significant gap between diverse ML programs and multitiered computing architectures. Specifically, I will explore ML parallelization at three distinct yet interconnected levels.

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

Misha Khodak, PhD candidate
Computer Science Department, Carnegie Mellon University

Advances in machine learning (ML) have led to skyrocketing demand across diverse applications beyond vision and text, resulting in unique theoretical and practical challenges. The vastness of use cases calls for general-purpose yet customizable tools for tackling large subclasses of such problems.

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

Mahsa Derakhshan, Assistant Professor
Khoury College of Computer Sciences, Northeastern University

In this talk, we discuss the stochastic vertex cover problem. In this problem, G is an arbitrary known graph, and G* is an unknown random subgraph of G containing each of its edges independently with a known probability p. Edges of G* can only be verified using edge queries. The goal in this problem is to find a minimum vertex cover of G* using a small number of queries.

Please note: This PhD seminar will take place in DC 3317.

Ahmed Alquraan, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Samer Al-Kiswany

Please note: This seminar has been CANCELLED.

Juba Ziani, Assistant Professor
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech

In this talk, I will be discussing “personalized” (or “individualized”) differential privacy, where different individuals can be offered different epsilons simultaneously within the same computation. I will be presenting two of my recent works on personalized DP in the central model: