skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on May 1, 2026

Title: Sparse identification of nonlocal interaction kernels in nonlinear gradient flow equations via partial inversion
We address the inverse problem of identifying nonlocal interaction potentials in nonlinear aggregation–diffusion equations from noisy discrete trajectory data. Our approach involves formulating and solving a regularized variational problem, which requires minimizing a quadratic error functional across a set of hypothesis functions, further augmented by a sparsity-enhancing regularizer. We employ a partial inversion algorithm, akin to the CoSaMP and subspace pursuit algorithms, to solve the basis pursuit problem. A key theoretical contribution is our novel stability estimate for the PDEs, validating the error functional ability in controlling the 2-Wasserstein distance between solutions generated using the true and estimated interaction potentials. Our work also includes an error analysis of estimators caused by discretization and observational errors in practical implementations. We demonstrate the effectiveness of the methods through various 1D and 2D examples showcasing collective behaviors.  more » « less
Award ID(s):
2340631 2111303
PAR ID:
10625974
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
World Scientific
Date Published:
Journal Name:
Mathematical Models and Methods in Applied Sciences
Volume:
35
Issue:
05
ISSN:
0218-2025
Page Range / eLocation ID:
1073 to 1131
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Protein–DNA interactions play an important role in various biological processes such as gene expression, replication, and transcription. Understanding the important features that dictate the binding affinity of protein-DNA complexes and predicting their affinities is important for elucidating their recognition mechanisms. In this work, we have collected the experimental binding free energy (ΔG) for a set of 391 Protein-DNA complexes and derived several structure-based features such as interaction energy, contact potentials, volume and surface area of binding site residues, base step parameters of the DNA and contacts between different types of atoms. Our analysis on relationship between binding affinity and structural features revealed that the important factors mainly depend on the number of DNA strands as well as functional and structural classes of proteins. Specifically, binding site properties such as number of atom contacts between the DNA and protein, volume of protein binding sites and interaction-based features such as interaction energies and contact potentials are important to understand the binding affinity. Further, we developed multiple regression equations for predicting the binding affinity of protein-DNA complexes belonging to different structural and functional classes. Our method showed an average correlation and mean absolute error of 0.78 and 0.98 kcal/mol, respectively, between the experimental and predicted binding affinities on a jack-knife test. We have developed a webserver, PDA-PreD (Protein-DNA Binding affinity predictor), for predicting the affinity of protein-DNA complexes and it is freely available at https://web.iitm.ac.in/bioinfo2/pdapred/ 
    more » « less
  2. We introduce an individually fitted screened-exchange interaction for the time-dependent Hartree–Fock (TDHF) method and show that it resolves the missing binding energies in polymethine organic dye molecules compared to time-dependent density functional theory (TDDFT). The interaction kernel, which can be thought of as a dielectric function, is generated by stochastic fitting to the screened-Coulomb interaction of many-body perturbation theory (MBPT), specific to each system. We test our method on the flavylium and indocyanine green dye families with a modifiable length of the polymethine bridge, leading to excitations ranging from visible to short-wave infrared. Our approach validates earlier observations on the importance of inclusion of medium range exchange for the exciton binding energy. Our resulting method, TDHF@vW, also achieves a mean absolute error on a par with MBPT at a computational cost on a par with local-functional TDDFT. 
    more » « less
  3. The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made to mimic an adiabatic schedule, and in the p → ∞ limit the final state is an exact maximal eigenstate in accordance with the adiabatic theorem. In this work, the connection between QAOA and adiabaticity is made explicit by inspecting the regime of p large but finite. By connecting QAOA to counterdiabatic (CD) evolution, we construct CD-QAOA angles which mimic a counterdiabatic schedule by matching Trotter "error" terms to approximate adiabatic gauge potentials which suppress diabatic excitations arising from finite ramp speed. In our construction, these "error" terms are helpful, not detrimental, to QAOA. Using this matching to link QAOA with quantum adiabatic algorithms (QAA), we show that the approximation ratio converges to one at least as 1 − C ( p ) ∼ 1 / p μ . We show that transfer of parameters between graphs, and interpolating angles for p + 1 given p are both natural byproducts of CD-QAOA matching. Optimization of CD-QAOA angles is equivalent to optimizing a continuous adiabatic schedule. Finally, we show that, using a property of variational adiabatic gauge potentials, QAOA is at least counterdiabatic, not just adiabatic, and has better performance than finite time adiabatic evolution. We demonstrate the method on three examples: a 2 level system, an Ising chain, and the MaxCut problem. 
    more » « less
  4. Machine learning (ML) offers an attractive method for making predictions about molecular systems while circumventing the need to run expensive electronic structure calculations. Once trained on ab initio data, the promise of ML is to deliver accurate predictions of molecular properties that were previously computationally infeasible. In this work, we develop and train a graph neural network model to correct the basis set incompleteness error (BSIE) between a small and large basis set at the RHF and B3LYP levels of theory. Our results show that, when compared to fitting to the total potential, an ML model fitted to correct the BSIE is better at generalizing to systems not seen during training. We test this ability by training on single molecules while evaluating on molecular complexes. We also show that ensemble models yield better behaved potentials in situations where the training data is insufficient. However, even when only fitting to the BSIE, acceptable performance is only achieved when the training data sufficiently resemble the systems one wants to make predictions on. The test error of the final model trained to predict the difference between the cc-pVDZ and cc-pV5Z potential is 0.184 kcal/mol for the B3LYP density functional, and the ensemble model accurately reproduces the large basis set interaction energy curves on the S66x8 dataset. 
    more » « less
  5. Abstract In this paper, we augment the modified embedded atom method formalism to include magnetic spin–spin interactions for elements with a persistent magnetic moment. While previous spin coupling methods have been based on pair potentials, our Magnetic MEAM formalism, which we term MagMEAM, incorporates the many-body and angular effects of MEAM allowing for the strength of the magnetic interaction to vary with atomic environment. In particular, this allows potentials using this formalism to differentiate the magnetic interaction of different stable phases of magnetic elements such as the ferritic and austenitic phases of iron. This, in turn, allows for a more robust and realistic description of magnetism in polymorphic materials than was previously possible. The motivation for MagMEAM, including the insufficiency of magnetic pair potentials, is presented and the structure of the formalism is developed. A sample iron potential is developed using this formalism and shown to exceed the capabilities of existing magnetic pair potentials by simultaneously reproducing the magnetic energy of both martensite and austenite as well as the dynamic mechanical and magnetic properties of martensite. This newly designed formalism will allow for deeper explorations in the the complex interaction between different phases of polymorphic magnetic materials at the molecular dynamics scale. 
    more » « less