Notice：
-
05-13
2021
A closer look at the complexity analysis of optimization methods
Speaker: Jingzhao Zhang Massachusetts Institute of Technology Time: 2021-05-13 10:00-2021-05-13 11:00 Venue: FIT 1-222 Abstract: Optimization methods have a longer history than that of digital...
-
05-12
2021
The all-or-nothing phenomenon in sparse estimation
Speaker: Jonathan Niles-Weed New York University Time: 2021-05-12 09:00-2021-05-12 10:30 Venue: online Abstract: We explore a sharp phase transition known as the "all-or-nothing" phenomenon in...
-
05-08
2021
Combating Concurrency Bugs in Go Software Systems
Speaker: Linhai Song the College of Information Sciences and Technology at the Pennsylvania State University Time: 2021-05-08 14:00-2021-05-08 16:00 Venue: FIT 1-222 Abstract: Go is a statical...
-
04-06
2021
Optimal rates for independence testing via permutation tests
Speaker: Tom Berrett University of Warwick Time: 2021-04-06 16:00-2021-04-06 17:30 Venue: Online Abstract: Independence testing is one of the most well-studied problems in statistics, and the ...
-
03-25
2021
Succinct Blind Quantum Computation Using a Random Oracle
Speaker: Jiayu Zhang Boston University Time: 2021-03-25 14:00-2021-03-25 15:30 Venue: Abstract: In the universal blind quantum computation problem, a client wants to make use of a single quan...
-
03-22
2021
How fast can we solve NP-complete problem?
Speaker: Mingyu Xiao University of Electronic Science and Technology of China (UESTC) Time: 2021-03-22 16:00-2021-03-22 17:00 Venue: FIT1-222 Abstract: Under the hypothesis P != NP, NP-complete pro...