Evolving symbolic density functionals
- URL: http://arxiv.org/abs/2203.02540v1
- Date: Thu, 3 Mar 2022 07:02:26 GMT
- Title: Evolving symbolic density functionals
- Abstract summary: We propose a new framework, Symbolic Functional Evolutionary Search (SyFES), that automatically constructs accurate functionals in the symbolic form.
Our framework opens a new direction in leveraging computing power for the systematic development of symbolic density functionals.
- Score: 5.846106754490333
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Systematic development of accurate density functionals has been a
decades-long challenge for scientists. Despite the emerging application of
machine learning (ML) in approximating functionals, the resulting ML
functionals usually contain more than tens of thousands parameters, which makes
a huge gap in the formulation with the conventional human-designed symbolic
functionals. We propose a new framework, Symbolic Functional Evolutionary
Search (SyFES), that automatically constructs accurate functionals in the
symbolic form, which is more explainable to humans, cheaper to evaluate, and
easier to integrate to existing density functional theory codes than other ML
functionals. We first show that without prior knowledge, SyFES reconstructed a
known functional from scratch. We then demonstrate that evolving from an
existing functional $\omega$B97M-V, SyFES found a new functional, GAS22 (Google
Accelerated Science 22), that performs better on main-group chemistry. Our
framework opens a new direction in leveraging computing power for the
systematic development of symbolic density functionals.
Related papers
- Agentic Discovery of Exchange-Correlation Density Functionals [6.373702912974026]
Development of accurate exchange-correlation (XC) functionals remains a longstanding challenge in density functional theory (DFT)<n>Recent advances in large language models enable a systematic, automated alternative to this human-driven design loop.<n>This report presents an agentic search system in which an LLM proposes structured functional-form changes guided by evolutionary history.
arXiv Detail & Related papers (2026-05-06T21:36:43Z) - Neural Approximation and Its Applications [73.11802084858294]
We introduce the neural basis function by leveraging an untrained neural network as the basis function.<n>We suggest the neural approximation (NeuApprox) paradigm for multivariate function approximation.<n>Experiments on diverse multi-dimensional images, light field data, videos, traffic data, and point cloud data demonstrate the promising performance of NeuApprox.
arXiv Detail & Related papers (2026-03-04T06:05:43Z) - Neural Functional: Learning Function to Scalar Maps for Neural PDE Surrogates [7.136205674624813]
We propose a new architecture for PDE surrogates that learns function to scalar mappings.<n>For the first time, this allows for an extension of Hamiltonian mechanics to neural PDE surrogates.
arXiv Detail & Related papers (2025-05-19T15:55:38Z) - On the practical applicability of modern DFT functionals for chemical computations. Case study of DM21 applicability for geometry optimization [55.88862563823878]
This study focuses on evaluating the efficiency of DM21 functional in predicting molecular geometries.
We implement geometry optimization in PySCF for the DM21 functional in geometry optimization problem.
Our findings reveal both the potential and the current challenges of using neural network functionals for geometry optimization in DFT.
arXiv Detail & Related papers (2025-01-21T14:01:06Z) - DimOL: Dimensional Awareness as A New 'Dimension' in Operator Learning [63.5925701087252]
We introduce DimOL (Dimension-aware Operator Learning), drawing insights from dimensional analysis.
To implement DimOL, we propose the ProdLayer, which can be seamlessly integrated into FNO-based and Transformer-based PDE solvers.
Empirically, DimOL models achieve up to 48% performance gain within the PDE datasets.
arXiv Detail & Related papers (2024-10-08T10:48:50Z) - A physics-inspired evolutionary machine learning method: from the Schrödinger equation to an orbital-free-DFT kinetic energy functional [0.0]
We introduce a machine learning (ML) supervised model function that is inspired by the variational principle of physics.
fundamental equations of physics can be derived from this ML-Omega evolutionary method when provided the proper training data.
Method is applied to find a local orbital-free (OF) functional expression of the independent electron kinetic energy functional Ts based on the gamma-TF-lambda-vW model.
arXiv Detail & Related papers (2024-05-28T17:57:15Z) - Emergent Modularity in Pre-trained Transformers [127.08792763817496]
We consider two main characteristics of modularity: functional specialization of neurons and function-based neuron grouping.
We study how modularity emerges during pre-training, and find that the modular structure is stabilized at the early stage.
It suggests that Transformers first construct the modular structure and then learn fine-grained neuron functions.
arXiv Detail & Related papers (2023-05-28T11:02:32Z) - Data-Driven Learning of Feedforward Neural Networks with Different
Activation Functions [0.0]
This work contributes to the development of a new data-driven method (D-DM) of feedforward neural networks (FNNs) learning.
arXiv Detail & Related papers (2021-07-04T18:20:27Z) - Evolution of Activation Functions: An Empirical Investigation [0.30458514384586394]
This work presents an evolutionary algorithm to automate the search for completely new activation functions.
We compare these new evolved activation functions to other existing and commonly used activation functions.
arXiv Detail & Related papers (2021-05-30T20:08:20Z) - eQE 2.0: Subsystem DFT Beyond GGA Functionals [58.720142291102135]
subsystem-DFT (sDFT) can dramatically reduce the computational cost of large-scale electronic structure calculations.
The key ingredients of sDFT are the nonadditive kinetic energy and exchange-correlation functionals which dominate it's accuracy.
eQE 2.0 delivers excellent interaction energies compared to conventional Kohn-Sham DFT and CCSD(T)
arXiv Detail & Related papers (2021-03-12T22:26:36Z) - Task-Agnostic Morphology Evolution [94.97384298872286]
Current approaches that co-adapt morphology and behavior use a specific task's reward as a signal for morphology optimization.
This often requires expensive policy optimization and results in task-dependent morphologies that are not built to generalize.
We propose a new approach, Task-Agnostic Morphology Evolution (TAME), to alleviate both of these issues.
arXiv Detail & Related papers (2021-02-25T18:59:21Z) - UNIPoint: Universally Approximating Point Processes Intensities [125.08205865536577]
We provide a proof that a class of learnable functions can universally approximate any valid intensity function.
We implement UNIPoint, a novel neural point process model, using recurrent neural networks to parameterise sums of basis function upon each event.
arXiv Detail & Related papers (2020-07-28T09:31:56Z) - Discovering Parametric Activation Functions [17.369163074697475]
This paper proposes a technique for customizing activation functions automatically, resulting in reliable improvements in performance.
Experiments with four different neural network architectures on the CIFAR-10 and CIFAR-100 image classification datasets show that this approach is effective.
arXiv Detail & Related papers (2020-06-05T00:25:33Z) - DeepRetinotopy: Predicting the Functional Organization of Human Visual
Cortex from Structural MRI Data using Geometric Deep Learning [125.99533416395765]
We developed a deep learning model capable of exploiting the structure of the cortex to learn the complex relationship between brain function and anatomy from structural and functional MRI data.
Our model was able to predict the functional organization of human visual cortex from anatomical properties alone, and it was also able to predict nuanced variations across individuals.
arXiv Detail & Related papers (2020-05-26T04:54:31Z) - Evolutionary Optimization of Deep Learning Activation Functions [15.628118691027328]
We show that evolutionary algorithms can discover novel activation functions that outperform the Rectified Linear Unit (ReLU)
replacing ReLU with evolved activation functions results in statistically significant increases in network accuracy.
These novel activation functions are shown to generalize, achieving high performance across tasks.
arXiv Detail & Related papers (2020-02-17T19:54:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.