Expander attention as exchange-correlation

• URL: http://arxiv.org/abs/2605.10265v1
• Date: Mon, 11 May 2026 09:27:38 GMT
• Title: Expander attention as exchange-correlation
• Abstract summary: A persistent challenge in this area is the trade-off between accuracy and computational cost.<n>We propose a linearly scaling non-local XC approximation based on an expander graph transformer ansatz.<n>We show that it recovers the correct $mathrmH$ curve in the strongly correlated regime, with promising results on planar $mathrmH_4$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Kohn-Sham density functional theory (DFT) is the workhorse of quantum chemistry, offering an attractive balance between accuracy and computational cost. Although exact in principle, DFT in practice relies on an approximation to the unknown exchange-correlation (XC) functional, which encodes the many-body quantum effects beyond the mean-field treatment. Many such approximations exist, and machine-learned XC functionals have proliferated in recent years. A persistent challenge in this area is the trade-off between accuracy and computational cost: while high-accuracy ML functionals have shown success on strongly correlated systems that are notoriously difficult for conventional approximations, their unfavorable scaling has limited broader adoption. Here, we propose a linearly scaling non-local XC approximation based on an expander graph transformer ansatz, improving the scaling of $O(N^2)$ or worse for previous ML functionals capable of reliably capturing strongly correlated systems. We show that it recovers the correct $\mathrm{H_2}$ dissociation curve in the strongly correlated regime, with promising results on planar $\mathrm{H_4}$, a system where even high-level coupled cluster methods break down. Our approach thus charts a path toward ML functionals that are both accurate on strongly correlated systems and cheap enough to deploy at scale.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• SAQ: Stabilizer-Aware Quantum Error Correction Decoder [8.458339111154585]
  Quantum Error Correction (QEC) decoding faces a fundamental accuracy-efficiency tradeoff.<n>Recent neural decoders reduce complexity but lack the accuracy needed to compete with computationally expensive classical methods.<n>We introduce SAQ-Decoder, a framework combining transformer-based learning with constraint post-processing.
  arXiv  Detail & Related papers  (2025-12-09T18:51:35Z)
• Muti-Fidelity Prediction and Uncertainty Quantification with Laplace Neural Operators for Parametric Partial Differential Equations [6.03891813540831]
  Laplace Neural Operators (LNOs) have emerged as a promising approach in scientific machine learning.<n>We propose multi-fidelity Laplace Neural Operators (MF-LNOs), which combine a low-fidelity base model with parallel linear/nonlinear HF correctors and dynamic inter-fidelity weighting.<n>This allows us to exploit correlations between LF and HF datasets and achieve accurate inference of quantities of interest.
  arXiv  Detail & Related papers  (2025-02-01T20:38:50Z)
• Adaptive Federated Learning Over the Air [108.62635460744109]
  We propose a federated version of adaptive gradient methods, particularly AdaGrad and Adam, within the framework of over-the-air model training. Our analysis shows that the AdaGrad-based training algorithm converges to a stationary point at the rate of $mathcalO( ln(T) / T 1 - frac1alpha ).
  arXiv  Detail & Related papers  (2024-03-11T09:10:37Z)
• Non-convex Bayesian Learning via Stochastic Gradient Markov Chain Monte Carlo [4.656426393230839]
  The rise of artificial intelligence (AI) hinges on efficient of modern deep neural networks (DNNs) for non-trips and uncertainty. In this thesis we propose a tool to handle the problem of Monte Carlo exploitation. We also propose two dynamic importance sampling algorithms for the underlying ordinary equation (ODE) system.
  arXiv  Detail & Related papers  (2023-05-30T18:25:11Z)
• FeDXL: Provable Federated Learning for Deep X-Risk Optimization [105.17383135458897]
  We tackle a novel federated learning (FL) problem for optimizing a family of X-risks, to which no existing algorithms are applicable. The challenges for designing an FL algorithm for X-risks lie in the non-decomability of the objective over multiple machines and the interdependency between different machines.
  arXiv  Detail & Related papers  (2022-10-26T00:23:36Z)
• Revisiting Active Sets for Gaussian Process Decoders [0.0]
  We develop a new estimate of the log-marginal likelihood based on recently discovered links to cross-validation. We demonstrate that the resulting active sets (SAS) approximation significantly improves the robustness of GP decoder training.
  arXiv  Detail & Related papers  (2022-09-10T10:49:31Z)
• 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)
• On Function Approximation in Reinforcement Learning: Optimism in the Face of Large State Spaces [208.67848059021915]
  We study the exploration-exploitation tradeoff at the core of reinforcement learning. In particular, we prove that the complexity of the function class $mathcalF$ characterizes the complexity of the function. Our regret bounds are independent of the number of episodes.
  arXiv  Detail & Related papers  (2020-11-09T18:32:22Z)
• Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension [124.7752517531109]
  We establish a provably efficient reinforcement learning algorithm with general value function approximation. We show that our algorithm achieves a regret bound of $widetildeO(mathrmpoly(dH)sqrtT)$ where $d$ is a complexity measure. Our theory generalizes recent progress on RL with linear value function approximation and does not make explicit assumptions on the model of the environment.
  arXiv  Detail & Related papers  (2020-05-21T17:36:09Z)

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.