2697 Publications

Pandemic Control, Game Theory, and Machine Learning

Yao Xuan, Robert Balkin, J. Han, Ruimeng Hu, Hector D Ceniceros

Game theory has been an effective tool in the control of disease spread and in suggesting optimal policies at both individual and area levels. In this AMS Notices article, we focus on the decision-making development for the intervention of COVID-19, aiming to provide mathematical models and efficient machine learning methods, and justifications for related policies that have been implemented in the past and explain how the authorities' decisions affect their neighboring regions from a game theory viewpoint.

Show Abstract

RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression

Nidham Gazagnadou, Mark Ibrahim, R. M. Gower

We propose new variants of the sketch-and-project method for solving large scale ridge regression problems. First, we propose a new momentum alternative and provide a theorem showing it can speed up the convergence of sketch-and-project, through a fast sublinear convergence rate. We carefully delimit under what settings this new sublinear rate is faster than the previously known linear rate of convergence of sketch-and-project without momentum. Second, we consider combining the sketch-and-project method with new modern sketching methods such as Count sketch, SubCount sketch (a new method we propose), and subsampled Hadamard transforms. We show experimentally that when combined with the sketch-and-project method, the (Sub)Count sketch is very effective on sparse data and the standard Subsample sketch is effective on dense data. Indeed, we show that these sketching methods, combined with our new momentum scheme, result in methods that are competitive even when compared to the conjugate gradient method on real large scale data. On the contrary, we show the subsampled Hadamard transform does not perform well in this setting, despite the use of fast Hadamard transforms, and nor do recently proposed acceleration schemes work well in practice. To support all of our experimental findings, and invite the community to validate and extend our results, with this paper we are also releasing an open source software package: RidgeSketch. We designed this object-oriented package in Python for testing sketch-and-project methods and benchmarking ridge regression solvers. RidgeSketch is highly modular, and new sketching methods can easily be added as subclasses. We provide code snippets of our package in the appendix.

Show Abstract

Geometry of the Phase Retrieval Problem: Graveyard of Algorithms

Recovering the phase of the Fourier transform is a ubiquitous problem in imaging applications from astronomy to nanoscale X-ray diffraction imaging. Despite the efforts of a multitude of scientists, from astronomers to mathematicians, there is, as yet, no satisfactory theoretical or algorithmic solution to this class of problems. Written for mathematicians, physicists and engineers working in image analysis and reconstruction, this book introduces a conceptual, geometric framework for the analysis of these problems, leading to a deeper understanding of the essential, algorithmically independent, difficulty of their solutions. Using this framework, the book studies standard algorithms and a range of theoretical issues in phase retrieval and provides several new algorithms and approaches to this problem with the potential to improve the reconstructed images. The book is lavishly illustrated with the results of numerous numerical experiments that motivate the theoretical development and place it in the context of practical applications.

Show Abstract

Triple electron–electron–proton excitations and second-order approximations in nuclear–electronic orbital coupled cluster methods

F. Pavosevic, Sharon Hammes-Schiffer
The accurate description of nuclear quantum effects, such as zero-point energy, is important for modeling a wide range of chemical and biological processes. Within the nuclear-electronic orbital (NEO) approach, such effects are incorporated in a computationally efficient way by treating electrons and select nuclei, typically protons, quantum mechanically with molecular orbital techniques. Herein, we implement and test a NEO coupled cluster method that explicitly includes the triple electron-proton excitations, where two electrons and one proton are excited simultaneously. Our calculations show that this NEO-CCSD(eep) method provides highly accurate proton densities and proton affinities, outperforming any previously studied NEO method. These examples highlight the importance of the triple electron-electron-proton excitations for an accurate description of nuclear quantum effects. Additionally, we also implement and test the second-order approximate coupled cluster with singles and doubles (NEO-CC2) method, as well as its scaled-opposite-spin (SOS) versions. The NEO-SOS'-CC2 method, which scales the electron-proton correlation energy as well as the opposite-spin and same-spin components of the electron-electron correlation energy, achieves nearly the same accuracy as the NEO-CCSD(eep) method for the properties studied. Because of its low computational cost, this method will enable a wide range of chemical and photochemical applications for large molecular systems. This work sets the stage for a wide range of developments and applications within the NEO framework.
Show Abstract

Absence of localization in interacting spin chains with a discrete symmetry

B. Kloss, Jad C. Halimeh, Achilleas Lazarides, Yevgeny Bar Lev
We prove that spin chains symmetric under a combination of mirror and spin-flip symmetries and with a nondegenerate spectrum show finite spin transport at zero total magnetization and infinite temperature. We demonstrate this numerically using two prominent examples: the Stark many-body localization system and the symmetrized many-body localization system. We provide evidence of delocalization at all energy densities and show that the delocalization mechanism is robust to breaking the symmetry. We use our results to construct two localized systems which, when coupled, delocalize each other.
Show Abstract

Generalization and Overfitting in Matrix Product State Machine Learning Architectures

A. Strashko, E. Miles Stoudenmire
While overfitting and, more generally, double descent are ubiquitous in machine learning, increasing the number of parameters of the most widely used tensor network, the matrix product state (MPS), has generally lead to monotonic improvement of test performance in previous studies. To better understand the generalization properties of architectures parameterized by MPS, we construct artificial data which can be exactly modeled by an MPS and train the models with different number of parameters. We observe model overfitting for one-dimensional data, but also find that for more complex data overfitting is less significant, while with MNIST image data we do not find any signatures of overfitting. We speculate that generalization properties of MPS depend on the properties of data: with one-dimensional data (for which the MPS ansatz is the most suitable) MPS is prone to overfitting, while with more complex data which cannot be fit by MPS exactly, overfitting may be much less significant.
Show Abstract

The Generalized Green’s function Cluster Expansion: A Python package for simulating polarons

Matthew R. Carbone, Stepan Fomichev, Andrew J. Millis, Mona Berciu, D. Reichman, John Sous
We present an efficient implementation of the Generalized Green's function Cluster Expansion (GGCE), which is a new method for computing the ground-state properties and dynamics of polarons (single electrons coupled to lattice vibrations) in model electron-phonon systems. The GGCE works at arbitrary temperature and is well suited for a variety of electron-phonon couplings, including, but not limited to, site and bond Holstein and Peierls (Su-Schrieffer-Heeger) couplings, and couplings to multiple phonon modes with different energy scales and coupling strengths. Quick calculations can be performed efficiently on a laptop using solvers from NumPy and SciPy, or in parallel at scale using the PETSc sparse linear solver engine.
Show Abstract

Unidirectional subsystem symmetry in a hole-doped honeycomb-lattice Ising magnet

Sambuddha Sanyal, A. Wietek, John Sous
We study a model of a hole-doped collinear Ising antiferromagnet on the honeycomb lattice as a route toward the realization of subsystem symmetry. We find nearly exact conservation of dipole symmetry verified both numerically with exact diagonalization (ED) on finite clusters and analytically with perturbation theory. The emergent symmetry forbids the motion of single holes -- or fractons -- but allows hole pairs -- or dipoles -- to move freely along a one-dimensional line, the antiferromagnetic direction, of the system; in the transverse direction, both fractons and dipoles are completely localized. This presents a realization of a `unidirectional' subsystem symmetry. By studying interactions between dipoles, we argue that the subsystem symmetry is likely to continue to persist up to finite (but probably small) hole concentrations.
Show Abstract

On the potentially transformative role of auxiliary-field quantum Monte Carlo in quantum chemistry: A highly accurate method for transition metals and beyond

James Shee, John Weber, David Reichman, Richard Friesner, S. Zhang
Approximate solutions to the ab initio electronic structure problem have been a focus of theoretical and computational chemistry research for much of the past century, with the goal of predicting relevant energy differences to within "chemical accuracy`` (1 kcal/mol). For small organic molecules, or in general for weakly correlated main group chemistry, a hierarchy of single-reference wavefunction methods have been rigorously established spanning perturbation theory and the coupled cluster (CC) formalism. For these systems, CC with singles, doubles, and perturbative triples (CCSD(T)) is known to achieve chemical accuracy, albeit at O(N\^7) computational cost. In addition, a hierarchy of density functional approximations of increasing formal sophistication, known as Jacob's ladder, has been shown to systematically reduce average errors over large data sets representing weakly-correlated chemistry. However, the accuracy of such computational models is less clear in the increasingly important frontiers of chemical space including transition metals and f-block compounds, in which strong correlation can play an important role in reactivity. A stochastic method, phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC), has been shown capable of producing chemically accurate predictions even for challenging molecular systems beyond the main-group, with relatively low O(N\^3-N\^4) cost and near-perfect parallel efficiency. Herein we present our perspectives on the past, present, and future of the ph-AFQMC method. We focus on its potential in transition metal quantum chemistry to be a highly accurate, systematically-improvable method which can reliably probe strongly correlated systems in biology and chemical catalysis, and provide reference thermochemical values (for future development of density functionals or interatomic potentials) when experiments are either noisy or absent. Finally, we discuss the present limitations of the method, and where we expect near term development to be most fruitful.
Show Abstract
  • Previous Page
  • Viewing
  • Next Page
Advancing Research in Basic Science and MathematicsSubscribe to Flatiron Institute announcements and other foundation updates