Seminars and Colloquia by Series

Efficient Prediction of User Activity using Mass Transport Equation

Series
GT-MAP Seminar
Time
Tuesday, November 27, 2018 - 15:00 for 2 hours
Location
Skiles 005
Speaker
Prof. Le SongGT CSE

Please Note: This is a part of GT MAP seminar. See gtmap.gatech.edu for more information.

Point processes such as Hawkes processes are powerful tools to model user activities and have a plethora of applications in social sciences. Predicting user activities based on point processes is a central problem which is typically solved via sampling. In this talk, I will describe an efficient method based on a differential-difference equation to compute the conditional probability mass function of point processes. This framework is applicable to general point processes prediction tasks, and achieves marked efficiency improvement in diverse real-world applications compared to existing methods.

The power of parallelization in large-scale convex optimization

Series
ACO Alumni Lecture
Time
Tuesday, November 27, 2018 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Cristobal GuzmanUniversidad Católica de Chile, Chile

Recently there has been an outburst of parallelization techniques to speed up optimization algorithms, particularly in applications in statistical learning and structured linear programs. Motivated by these developments, we seek for theoretical explanations of provable improvements (or the lack thereof) in performance obtained by parallelizing optimization algorithms. In 1994, Nemirovski proved that for low-dimensional optimization problems there is a very limited improvement that could be obtained by parallelization, and furthermore conjectured that no acceleration should be achievable by these means. In this talk, I will present new results showing that in high-dimensional settings no acceleration can be obtained by parallelization, providing strong evidence towards Nemirovski's conjecture. This is joint work with Jelena Diakonikolas (UC Berkeley).

Granular sessile drops

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 26, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ray TreinenTexas State University

Please Note: This should be unpublished. Againx3

We consider one or more volumes of a liquid or semi-molten material sitting on a substrate, while the vapor above is assumed to have the same medium in suspension. There may be both evaporation and condensation to move mass from one cell to another. We explore possible equilibrium states of such configurations. Our examples include a single sessile drop (or cell) on the plate, connected clusters of cells of the material on the plate, as well as a periodic configuration of connected cells on the plate. The shape of the configurations will depend on the type of energy that we take into consideration, and in settings with a vertical gravitational potential energy the clusters are shown to exhibit a preferred granular scale. The majority of our results are in a lower dimensional setting, however, some results will be presented in 3-D.

Granular sessile drops

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 26, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
005 Skiles
Speaker
Ray TreinenTexas State University

We consider one or more volumes of a liquid or semi-molten material sitting on a substrate, while the vapor above is assumed to have the same medium in suspension. There may be both evaporation and condensation to move mass from one cell to another. We explore possible equilibrium states of such configurations. Our examples include a single sessile drop (or cell) on the plate, connected clusters of cells of the material on the plate, as well as a periodic configuration of connected cells on the plate. The shape of the configurations will depend on the type of energy that we take into consideration, and in settings with a vertical gravitational potential energy the clusters are shown to exhibit a preferred granular scale. The majority of our results are in a lower dimensional setting, however, some results will be presented in 3-D.

The arithmetic of orientation-reversing mapping classes

Series
Geometry Topology Seminar
Time
Monday, November 19, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Livio LiechtiParis-Jussieu
Mapping classes are the natural topological symmetries of surfaces. Their study is often restricted to the orientation-preserving ones, which form a normal subgroup of index two in the group of all mapping classes. In this talk, we discuss orientation-reversing mapping classes. In particular, we show that Lehmer's question from 1933 on Mahler measures of integer polynomials can be reformulated purely in terms of a comparison between orientation-preserving and orientation-reversing mapping classes.

A deterministic potential mean-field game

Series
Dynamical Systems Working Seminar
Time
Friday, November 16, 2018 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 156
Speaker
Sergio MayorgaGeorgia Tech
In this talk I will begin by discussing the main ideas of mean-field games and then I will introduce one specific model, driven by a smooth hamiltonian with a regularizing potential and no stochastic noise. I will explain what type of solutions can be obtained, and the connection with a notion of Nash equilibrium for a game played by a continuum of players.

The Structure of Unique Shortest Paths in Graphs

Series
Combinatorics Seminar
Time
Friday, November 16, 2018 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Greg BodwinGeorgia Tech
Let P be a system of unique shortest paths through a graph with real edge weights (i.e. a finite metric). An obvious fact is that P is "consistent," meaning that no two of these paths can intersect each other, split apart, and then intersect again later. But is that all? Can any consistent path system be realized as unique shortest paths in some graph? Or are there more forbidden combinatorial intersection patterns out there to be found? In this talk, we will characterize exactly which path systems can or can't be realized as unique shortest paths in some graph by giving a complete list of new forbidden intersection patterns along these lines. Our characterization theorem is based on a new connection between graph metrics and certain boundary operators used in some recent graph homology theories. This connection also leads to a principled topological understanding of some of the popular algebraic tricks currently used in the literature on shortest paths. We will also discuss some applications in theoretical computer science.

Pages