Algebra and Combinatorics Seminar: Emily McGovern, NC State, Thesis Defense
SAS 1216Speaker's website
Speaker's website
In this article, we study feature attributions of Machine Learning (ML) models originating from linear game values and coalitional values defined as operators on appropriate functional spaces. The main focus is on random games based on the conditional and marginal expectations. The first part of our work formulates a stability theory for these explanation operators…
Consider a collection of particles whose state evolution is described through a system of interacting diffusions in which each particle is driven by an independent individual source of noise and also by a small amount of noise that is common to all particles. The interaction between the particles is due to the common noise and…
Programs Preparing Graduate Students to Teach Undergraduate Mathematics Zoom link
Zoom Link
A metric Lie algebra is a real Lie Algebra with an inner product. In this talk, we will outline a complete classification of all three-dimensional metric Lie algebras up to notions of equivalence determined by isomorphism and scaling and investigate the Ricci flow on the resulting parameter spaces of equivalence classes.
Polyhedral fans are geometric objects, which arise naturally in many areas of mathematics, for example in toric geometry, the theory of hyperplane arrangements and representation theory. In many cases, there are natural ways of identifying some of the polyhedral cones defining a fan, thus giving a "partition of the fan". To each such partitioned fan…
We will discuss a special family of 2D incompressible inviscid fluid flows in the form of logarithmic spiral vortex sheets. Such flows are determined by a vorticity distribution of a curve R^2, and they are notoriously hard to study analytically. In the talk we will discuss several results regarding logarithmic spiral vortex sheets: well-posedness of the spirals as…
Spreading (diffusion) of new products is a classical problem. Traditionally, it has been analyzed using the compartmental Bass model, which implicitly assumes that all individuals are homogeneous and connected to each other. To relax these assumptions, research has gradually shifted to the more fundamental Bass model on networks, which is a particle model for the…
We study Merton’s expected utility maximization problem in an incomplete market, characterized by a factor process in addition to the stock price process, where all the model primitives are unknown. We take the reinforcement learning (RL) approach to learn optimal portfolio policies directly by exploring the unknown market, without attempting to estimate the model parameters.…
Reduced-order models (ROMs) are a critical tool for sensitivity analysis, parameter inference, and uncertainty quantification where high-fidelity models would be computationally intractable. Galerkin POD-ROMs are one particular class of ROMs which project high-fidelity model equations onto a set of model solutions to construct ROMs retaining original model parameters and physics, enabling accurate sensitivity analysis, parameter inference,…
Gene co-expression graphs are a rich source of information, revealing critical insights into cellular functions, states, and activities. Yet, extracting meaningful signals from these graphs presents a formidable challenge. This complexity arises due to the presence of multiple, overlapping sources of information and the inherent noise, which is particularly pronounced in data derived from single-cell…
In this talk we discuss partial data inverse boundary problems for magnetic Schrödinger operators on bounded domains in the Euclidean space as well as some Riemannian manifolds with boundary. In particular, we show that the knowledge of the set of the Cauchy data on a portion of the boundary of a domain in the Euclidean…
The pop-stack sorting method takes an ordered list or permutation and reverses each descending run without changing their relative positions. In this talk we will review recent combinatorial results on the pop-stack sorting method, and we will extend the pop-stack sorting method to certain pattern avoiding permutations, called c-sortable. If time permits, we will describe…
I first give a quick introduction to front propagations, Hamilton-Jacobi equations, level-set forced mean curvature flows, and homogenization theory. I will then show the optimal rates of convergence for homogenization of both first-order and second-order Hamilton-Jacobi equations. Based on joint works with J. Qian, T. Sprekeler, and Y. Yu. Zoom meeting: Link
In the past decade, deep learning has made astonishing breakthroughs in various real-world applications. It is a common belief that deep neural networks are good at learning various geometric structures hidden in data sets. One of the central interests in deep learning theory is to understand why deep neural networks are successful, and how they…
In this talk, I will go through some old and new results concerning the rigidity and flexibility of scalar curvature.
Mean field game theory was developed to analyze Nash games with large numbers of players in the continuum limit. The master equation, which can be seen as the limit of an N-player Nash system of PDEs, is a nonlinear PDE equation over time, space, and measure variables that formally gives the Nash equilibrium for a given…
We consider a class of disordered mean-field combinatorial optimization problems, focusing on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a general distribution. We prove Central Limit Theorems for the log-partition function, the weight of a typical configuration, and the…