Time and Date: Tuesdays 3:30 - 4:30, unless noted otherwise.
Unless otherwise noted, all talks will take place in Math Sciences Building 110 at the University of Missouri.
Organized by Tim Duff and Dan Edidin. Contact Tim if you want to be on the mailing list.
Abstract: In this talk, we study the problem of minimizing the distance from a data point to a subvariety of the Grassmannian from the perspective of metric algebraic geometry. An important invariant in this line of work is the number of critical points of this optimization problem for general data. When the data is a general point in the ambient space, this number is called the Euclidean distance (ED) degree of the variety. However, we focus mainly on the case when the data is a general point in the Grassmannian, and call the number of critical points the Grassmann distance (GD) degree. As we will see, the GD degree is more subtle than the ED degree. We give formulas for the ED and GD degrees of prominent subvarieties of the Grassmannian, including Schubert and matroid varieties.
Title: Solver-in-the-Loop Joint Operator Learning for Inverse Problems
Abstract: The Transformer from "Attention Is All You Need" is now the ubiquitous architecture in state-of-the-art models such as GPT and AlphaFold. At Transformer's heart and soul is the "attention mechanism". We propose an attention-based deep direct sampling method for solving Electrical Impedance Tomography, a class of boundary value inverse problems. We try to provide an example of whether and how one can benefit from the theoretical structure of a mathematical problem to develop task-oriented and structure-conforming neural operators. Then, inspired by the idea of employing partial differential equation (PDE) solvers as preconditioners for this inverse problem, we investigate a "solver-in-the-loop" training mechanism for Transformer-based neural operators. It allows the interaction between learnable parameters in a PDE solver module and those in neural networks for image reconstruction. The new method achieves superior reconstruction quality compared with its predecessors and is robust to noise.
Title: Neural Networks for Parametrized Systems of Real Polynomials
Abstract: We study the use of feedforward neural networks for solving parametrized systems of polynomial equations over the real numbers. Our model involves a classifier network to predict the number of real solutions for a given parameter and a regressor network for each realizable number of solutions. We highlight the interaction between algebraic geometry and machine learning throughout. In particular, the classifier training is sensitive to the singularities of the real discriminant locus, and the regressor training is sensitive to the presence of nontrivial real monodromy loops. We demonstrate the model on toy problems as well as systems of equations arising in dynamical systems and robotics. This is based on joint work with Julianne Barnhart, Jon Hauenstein, Ikenna Nometa, Maggie Regan, Matthew Trang, and Charles Wampler.
Joint Algebra- Data Seminar: Unusual Seminar Date/Time: Monday 4:00 - 4:50 PM
Title: What we know and don’t about the invariant ring for 5 qubits
Abstract: Invariant polynomials have been recently shown to be useful for finding maximally entangled quantum systems for small numbers of particles. Invariant rings for spaces of tensors are particularly nice: they are finitely generated, and Cohen-Macaulay, and in the tame cases (the set of orbits depending on finitely many parameters) they are even polynomial rings. We can compute their Hilbert series via computations with finite groups. But what if we want to really get our hands on computations with invariants? Schur-Weyl duality and Young symmetrizers provide a way to access and evaluate these functions at least in low degrees. The first case of qubits with wild orbit type is with 5 qubits, and in this case it might be too difficult to compute all generators of the invariant ring. Instead, we could be happy with a set of primary invariants. I will discuss our implementations of these invariant theory computations in Macaulay2 and attempts to find sets of primary invariants in this case.