Seminars and Colloquia by Series

Sparse domination and the strong maximal function

Series
Analysis Seminar
Time
Wednesday, January 16, 2019 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Alexander BarronBrown University
There has been recent interest in sparse bounds for various operators that arise in harmonic analysis. Perhaps the most basic "sparse" result is a pointwise bound for the dyadic Hardy-Littlewood maximal function. It turns out that the direct analogue of this result does not hold if one adds an extra dilation parameter: the dyadic strong maximal function does not admit a pointwise sparse bound or a sparse bound involving L^1 forms (both of which hold in the one-parameter setting). The proof is based on the construction of a certain pair of extremal point sets. This is joint work with Jose Conde-Alonso, Yumeng Ou, and Guillermo Rey.

Synchronization of pendulum clocks and metronomes

Series
Applied and Computational Mathematics Seminar
Time
Monday, January 14, 2019 - 01:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Prof. Guillermo GoldszteinGT School of Math
In 1665, Huygens discovered that, when two pendulum clocks hanged from a same wooden beam supported by two chairs, they synchronize in anti-phase mode. On the other hand, metronomes synchronize in-phase when oscillating on top of the same movable surface. In this talk, I will describe and analyze a model to help understand the conditions that lead to anti-phase synchronization vs. the conditions that lead to in-phase synchronization.

Convergence of the viscosity solutions in vanishing contact structure problem

Series
Dynamical Systems Working Seminar
Time
Friday, January 11, 2019 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 246
Speaker
Qinbo ChenAMSS & GT Math
In this talk, I will discuss the vanishing contact structure problem, which focuses on the asymptotic behavior of the viscosity solutions uε of Hamilton-Jacobi equation H (x, Du(x), ε u(x)) =c, as the factor ε tends to zero. This is a natural generalization of the vanishing discount problem. I will explain how to characterize the limit solution in terms of Peierls barrier functions and Mather measures from a dynamical viewpoint. This is a joint work with Hitoshi Ishii, Wei Cheng, and Kai Zhao.

A numerical analysis approach to convex optimization

Series
ACO Student Seminar
Time
Friday, January 11, 2019 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Richard PengCS, Georgia Tech
In current convex optimization literature, there are significant gaps between algorithms that produce high accuracy (1+1/poly(n))-approximate solutions vs. algorithms that produce O(1)-approximate solutions for symmetrized special cases. This gap is reflected in the differences between interior point methods vs. (accelerated) gradient descent for regression problems, and between exact vs. approximate undirected max-flow. In this talk, I will discuss generalizations of a fundamental building block in numerical analysis, preconditioned iterative methods, to convex functions that include p-norms. This leads to algorithms that converge to high accuracy solutions by crudely solving a sequence of symmetric residual problems. I will then briefly describe several recent and ongoing projects, including p-norm regression using m^{1/3} linear system solves, p-norm flow in undirected unweighted graphs in almost-linear time, and further improvements to the dependence on p in the runtime.

Network data: Modeling and Statistical Analysis

Series
Job Candidate Talk
Time
Thursday, January 10, 2019 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Subhabrata SenMIT
Network data arises frequently in modern scientific applications. These networks often have specific characteristics such as edge sparsity, heavy-tailed degree distribution etc. Some broad challenges arising in the analysis of such datasets include (i) developing flexible, interpretable models for network datasets, (ii) testing for goodness of fit, (iii) provably recovering latent structure from such data.In this talk, we will discuss recent progress in addressing very specific instantiations of these challenges. In particular, we will1. Interpret the Caron-Fox model using notions of graph sub-sampling, 2. Study model misspecification due to rare, highly “influential” nodes, 3. Discuss recovery of community structure, given additional covariates.

A modern maximum-likelihood approach for high-dimensional logistic regression

Series
Job Candidate Talk
Time
Tuesday, January 8, 2019 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Pragya SurStatistics Department, Stanford University
Logistic regression is arguably the most widely used and studied non-linear model in statistics. Classical maximum-likelihood theory based statistical inference is ubiquitous in this context. This theory hinges on well-known fundamental results—(1) the maximum-likelihood-estimate (MLE) is asymptotically unbiased and normally distributed, (2) its variability can be quantified via the inverse Fisher information, and (3) the likelihood-ratio-test (LRT) is asymptotically a Chi-Squared. In this talk, I will show that in the common modern setting where the number of features and the sample size are both large and comparable, classical results are far from accurate. In fact, (1) the MLE is biased, (2) its variability is far greater than classical results, and (3) the LRT is not distributed as a Chi-Square. Consequently, p-values obtained based on classical theory are completely invalid in high dimensions. In turn, I will propose a new theory that characterizes the asymptotic behavior of both the MLE and the LRT under some assumptions on the covariate distribution, in a high-dimensional setting. Empirical evidence demonstrates that this asymptotic theory provides accurate inference in finite samples. Practical implementation of these results necessitates the estimation of a single scalar, the overall signal strength, and I will propose a procedure for estimating this parameter precisely. This is based on joint work with Emmanuel Candes and Yuxin Chen.

Finite Dimensional Balian-Low Theorems

Series
Applied and Computational Mathematics Seminar
Time
Monday, January 7, 2019 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 154
Speaker
Dr. Michael NorthingtonGT Math
Gabor systems, or collections of translations and modulations of a window function, are often used for time-frequency analysis of signals. The Balian-Low Theorem and its generalizations say that if a Gabor system obeys certain spanning and independence properties in L^2(R), then the window function of such a system cannot be well localized in both time and frequency. Recently, Shahaf Nitzan and Jan—Fredrik Olsen show that similar behavior extends to Gabor systems of finite length signals in l^2(Z_d). In this talk, I will discuss these finite dimensional results as well as recent extensions proven in collaboration with Josiah Park.

The Technique to Solve the Variable Coefficients Homological Equations

Series
CDSNS Colloquium
Time
Monday, December 17, 2018 - 11:15 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Hongyu ChengMSRI & Nankai University
In the infinite-dimensional KAM theory, solving the homological equations is the one of the main parts. Generally, the coefficients of the homological equations are constants, by comparing the coefficients of the functions, it is easy to solve these equations. If the coefficients of homological equations depend on the angle variables, we call these equations as the variable coefficients homological equations. In this talk we will talk about how to solve these equations.

Congruence subgroups of braid groups

Series
School of Mathematics Colloquium
Time
Friday, December 7, 2018 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Tara BrendleUniversity of Glasgow
The Burau representation plays a key role in the classical theory of braid groups. When we let the complex parameter t take the value -1, we obtain a symplectic representation of the braid group known as the integral Burau representation. In this talk we will give a survey of results on braid congruence subgroups, that is, the preimages under the integral Burau representation of principal congruence subgroups of symplectic groups. Along the way, we will see the (perhaps surprising) appearance of braid congruence subgroups in a variety of other contexts, including knot theory, homotopy theory, number theory, and algebraic geometry.

Pages