Date  Speaker  Title 
August 28
(4:15 pm; 1325 SEO)

Youming Qiao
University of Technology Sydney 
Matrix spaces as a linear algebraic analogue of graphs

September 4
(4:15 pm; 1325 SEO)

Arturs Backurs
TTI Chicago 
Efficient Density Evaluation for Smooth Kernels

September 11
(4:15 pm; 1325 SEO)

Anastasios Sidiropoulos
UIC 
Algorithms for metric learning via contrastive embeddings

September 18



September 25
(4:15 pm; 1325 SEO)

Akash Kumar
Purdue 
Finding minors in sublinear time in boundeddegree graphs with (almost) optimal onesided query complexity

October 2



October 9
(4:15 pm; 612 SEO)

Vishesh Jain
MIT 
Quantitative invertibility of random matrices: a combinatorial perspective

October 16
(4:15 pm; 1325 SEO)

Bhaskar DasGupta
UIC 
Why did the shape of your network change? (On detecting network anomalies via nonlocal curvatures)

October 22
(4:00 pm; 1325 SEO)

Karthik Chandrasekaran
University of Illinois 
Improving the smoothed complexity of FLIP for max cut problems

October 23



October 30
(4:15 pm; 1325 SEO)

Gyorgy Turan
UIC 
Interpretability in machine learning

November 5
(4:00 pm; 1325 SEO)

Simina Brânzei
Purdue 
Proportional dynamics in exchange and production economies

November 6



November 13
(4:15 pm; 1325 SEO)

Xue Chen
Northwestern 
Sparse Fourier transform in the continuous setting

November 20
(4:15 pm; 1325 SEO)

Alex Wein
Courant Institute 
Understanding statisticalvscomputational tradeoffs via the lowdegree likelihood ratio

November 27



December 4
(4:15 pm; 1325 SEO)

Yury Makarychev
TTI Chicago 
Dimensionality reduction for kmeans and kmedians clustering
