Past Seminars

Printer-friendly version
  • Daniil Rudenko
    Wed May 16, 2018
    2:00 pm
    Classical polylogarithms have been studied extensively since pioneering work of Euler and Abel. It is known that they satisfy lots of functional equations, but in weight >4 these equations are not known yet. Even in the weight 4 they were first found using heavy computer-assisted computations.  The main goal of the talk is to explain...
  • Bao Wang
    Mon May 14, 2018
    4:00 pm
    First, I will present the Laplacian smoothing gradient descent proposed recently by Prof. Stan Osher. We show that when applied to a variety of machine learning models including softmax regression, convolutional neural nets, generative adversarial nets, and deep reinforcement learning, this very simple surrogate of gradient descent can...
  • Isaac Goldbring
    Mon May 14, 2018
    4:00 pm
    In this first of two talks, I will explain the notion of definability in continuous logic and connect it with the notion of spectral gap in the theory of unitary representations and in ergodic theory.
  • Michael Porter
    Mon May 14, 2018
    2:30 pm
  • Zhiqin Lu
    Fri May 11, 2018
    4:00 pm
    In this talk, we shall give a mathematical setting of the Random Backpropogation  (RBP) method in unsupervised machine learning. When there is no hidden layer in the neural network, the method degenerates to the usual least square method. When there are multiple hidden layers, we can formulate the learning procedure as a system of nonlinear...
  • S, Kocic
    Fri May 11, 2018
    1:00 pm
  • Nathan Kaplan
    Wed May 9, 2018
    2:00 pm
    An n-arc in the k-dimensional projective space over a finite field F_q is a collection of n points with no k+1 in a hyperplane.  What is the largest size of an n-arc?  The MDS Conjecture proposes an answer to this question for all k and q. For k = 2 this question asks for the maximum number of points in the projective...