Seminar

Title: How to Escape Saddle Points Efficiently

Abstract: We will discuss the 2017 paper named in the title of the talk, by Jin et al.

Title: Stochastic subgradient method converges on tame functions

Abstract: In this talk, I will present a paper (https://arxiv.org/abs/1804.07795) on the convergence of stochastic subgradient method in a nonconvex and nonsmooth setting.

Title: Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDP

Abstract: Burer and Monteiro in 2003 proposed a nonlinear algorithm for solving semidefinite programs.

Title: Aggregation-based cutting-planes for packing and covering integer programs

Abstract:

We study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs).

Title: Clustering under Ordered Norms

Abstract: In this talk we will see approximation algorithms for a broad class of objective functions called as ordered norms.

Title: Flag algebras and subgraph density problems

Abstract: Flag algebras are a tool introduced by Razborov in 2007 that has since been successfully used to approach or solve many problems in asymptotic extremal combinatorics.

Title: Tutorial on Convolutional Neural Networks

Abstract: We have seen stochastic gradient descent and automatic differentiation to help handle the big dimensionality of problems that often occur in machine learning.

Title: The upper density of monochromatic infinite paths

Abstract: Given a complete graph $K_n$, whose edges are coloured in red and blue, what is the longest monochromatic path one can find?

Title: Implementing supersingular isogeny cryptography

Abstract:

Recent years have seen dramatic progress and improvements in the implementation of supersingular isogeny-based cryptosystems.

Title:  A Short Proof of the Containers Theorem for Hypergraphs

Abstract:  A modern trend in extremal combinatorics is extending classical results from the dense setting (e.g. Szemerédi's theorem)