跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 20:21 — 2026-11-18 20:21(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 61 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.22522

Coordinating integration of multidisciplinary design analysis and optimisation codes with design structure matrices

W. J. Rutten, L. F. P. Etman, F. Warmer

原文摘要

The integrated analysis and optimisation codes used to design nuclear fusion reactors need to become increasingly large scale, multidisciplinary and complex to computationally verify design requirements more thoroughly and earlier in the design process. Though the manner in which the integrated models are coupled can have significant implications for computational efficiency, the structure of couplings typically remains hidden in the implementation of a design framework. As this problem is not unique to fusion, we frame integrated design problems as applications of the broader field of Multidisciplinary Design Analysis and Optimisation (MDAO). Originally developed for complex system design problems in e.g. aerospace, the MDAO field uses (extended) Design Structure Matrices (DSMs) to display the architecture of integrated analysis and optimisation codes. The aim of this work is to introduce these DSM methods and demonstrate how they can be used to improve the transparency and efficiency of design codes in fusion. As a proof of concept, DSM methods are applied to two case studies: stellarator optimisation with SIMSOPT and the PROCESS systems code. With these cases, we illustrate how a DSM can help identify structural assumptions in the code, and how architectural insight can be used to improve computational efficiency. In particular, we demonstrate the computational impact by modifying the PROCESS solver architecture based on the feedback loops revealed in an automatically generated DSM, yielding a significant reduction in model evaluations. Such architectural changes are considered especially impactful for future design frameworks that combine higher fidelity models with large numbers of inexpensive models.

physics.comp-ph · cs.CE · cs.SE

版本更新 · v2arXiv:2606.04100

Stein Kernelized Molecular Dynamics for Active Learning of Interatomic Potentials

Joanna Zou, Fraser Birks, Dallas Foster, Youssef Marzouk

原文摘要

Machine learning interatomic potentials (MLIPs) enable efficient and accurate atomistic simulations but depend critically on the quality and diversity of the training data. We introduce Stein kernelized molecular dynamics (SKMD), an enhanced sampling method that uses interacting particle dynamics to acquire informative training configurations for the fine-tuning of MLIPs. SKMD corresponds to a stochastic variant of Stein variational gradient descent that is adapted for molecular dynamics by incorporating asynchronous particle updates and a kernel of global atomic descriptors, which provides a symmetry-aware measure of configurational similarity. Unlike other enhanced samplers used in molecular dynamics, SKMD maintains the Boltzmann distribution as a stationary distribution of its dynamics in the appropriate asymptotic limit. This property enforces a balance between the exploration of diverse configurations and attraction toward high-probability regions of the energy landscape. We further propose an approach to efficient online data acquisition using an adaptive stopping criterion that selects non-redundant training data over the course of simulation. We demonstrate SKMD for the active learning of a neural network model of the Müller--Brown potential, a MACE interatomic potential for alanine dipeptide, and a MACE foundation model with a DFT oracle for predicting the Pandey reconstruction of the Si(111) surface. Compared to active learning baselines, our method achieves higher model accuracy in fewer training iterations.

cs.LG · physics.comp-ph

新论文 · v1arXiv:2611.21541

SciResearch-Eval:评估自主实验智能体的科学判断力

SciResearch-Eval: Evaluating Scientific Judgment in Autonomous Experimental Agents

Brian T. Weston, Alondra Torres Contreras, Aldair E. Gongora

AI 速读 基于摘要

作者提出一个交互式基准,让智能体自行设计热学实验、使用可能欠分辨或物理错误的模拟器,并对带95%区间的材料性质估计进行校准评分。

cs.AI · cs.LG · physics.comp-ph

查看原文摘要

We introduce SciResearch-Eval, an interactive benchmark of scientific judgment built on a standard laboratory problem: measuring a material's thermal properties by heating it and fitting a heat-conduction simulator. An agent designs its own experiments, uses a supplied simulator that may be under-resolved or physically wrong, and reports each property with a 95% interval. To our knowledge it is the first benchmark to combine agent-designed experiments, a deliberately flawed simulator, and proper scoring of calibrated intervals against exact ground truth. On a held-out split (93 tasks, 9 models, 2,511 episodes), models handle procedural traps. When the simulator is missing physics, most report wrong values while stating they are 95% sure: their ranges contain the truth in 20-62% of cases, against 94% for GPT-6 Astra and 99% for Claude Fable 5.2. At default effort the failing Claude 5.5 models rarely diagnose the missing physics (Opus in 35% of episodes, against 66% for Astra), and even when they do, their ranges often miss; Astra and Fable design experiments in which the flawed simulator is accurate, such as gentle heating, which keeps Astra calibrated even when it does not name the cause. Asking for wider intervals does not help; stating the strategy improves interval scores 1.6-2.5-fold, replicated on a pre-registered fresh split, but coverage barely moves. A pre-registered effort ablation shows that the correction is latent in the Claude 5.5 models: at maximum effort Opus improves more than tenfold and is no longer detectably behind Astra at default, but only with 13-31 times more reasoning; older and open-weight models gain nothing. Fable 5.2 is the most accurate model at default effort (interval score 1.9 times better than Astra's) but writes 6 times as many tokens, and at Astra's token count it falls short. We release the environment, graders and harness.

新论文 · v1arXiv:2611.21434

Variational Monte Carlo for Quantum Excited States via Nested Low-Rank Approximation

Minchan Jeong, J. Jon Ryu, Se-Young Yun, Gregory W. Wornell

原文摘要

The electronic Schrödinger equation encodes a molecule's electronic structure and quantum properties, but solving it scales exponentially with the number of electrons. Solving this equation with neural-network variational Monte Carlo (VMC) has reached chemical accuracy on the ground state of small molecules; extending this success to excited states is constrained by two existing paradigms. Penalty-based methods need $K$ Laplacians per step but require tuning the overlap-penalty weights against the energy gaps they aim to compute. Natural excited states VMC (NES-VMC) is penalty-free, but it combines the $K$ ansatzes into one determinant, whose local energy requires $K^2$ Laplacians per step. We resolve this trade-off via low-rank approximation (LoRA) reparameterization of the rank-$K$ variational objective. The reparameterized objective admits a VMC-compatible stochastic gradient estimator via MCMC sampling from the per-state Born densities, and a sequential nesting scheme recovers the lowest $K$ eigenstates in eigenvalue order. The resulting algorithm, NestedLoRA-VMC, inherits a global optimality guarantee from the LoRA principle. On the first-row atoms Li through Ne at $K=10$, its accuracy is comparable to that of NES-VMC and of a state-of-the-art penalty-based method.

cs.LG · physics.chem-ph · physics.comp-ph

版本更新 · v2arXiv:2609.28782

When a better baseline makes delta learning worse: separating residual scale from learnability to guide target design

Kareem M. Gameel, Ihor Neporozhnii, Sjoerd Hoogland, Oleksandr Voznyy

原文摘要

In scientific machine learning, $Δ$-learning trains models on residual errors relative to approximate baselines, assuming that smaller residual scales inherently yield better downstream accuracy. Here, we demonstrate that residual scale alone is an insufficient heuristic for learnability. For molecular total energies, replacing a linear baseline with a neural network fitted to the same elemental counts reduced the residual scale, yet more than doubled GemNet's prediction error. Across local structural descriptors, more flexible baselines produced smaller residuals that varied sharply between structurally similar molecules. By contrast, semi-empirical baselines left larger residuals, yet yielded lower test error and improved out-of-domain transferability. Across the targets studied, scale-normalized graph Dirichlet roughness tracked scale-normalized prediction error, suggesting its use as a pre-training diagnostic for target selection. These results motivate baseline complementarity as a target-design principle in scientific machine learning: a useful baseline captures contributions the downstream architecture struggles to predict.

cs.LG · physics.chem-ph · physics.comp-ph

新论文 · v1arXiv:2611.21295

Deep Learning for Physicists: From Linear Regression to Reasoning Models

Masanori Hanada

原文摘要

These lecture notes are based on an introductory course on neural networks and deep learning that the author taught in the School of Mathematical Sciences at Queen Mary University of London in 2023/24 and 2024/25. The author, however, is a physicist, and it shows: wherever possible, ideas are explained with physical intuition rather than heavy formalism. Readers with a background in physics or mathematics who want a self-contained, introductory route into modern machine learning may therefore find these notes particularly friendly. The notes start from maximum likelihood, least squares, linear regression and (stochastic) gradient descent. They then cover neural networks, backpropagation, the vanishing gradient problem, batch and layer normalization, overfitting and regularization, adversarial examples, and the kernel method. The second half turns to natural language processing: word embeddings, recurrent networks and LSTMs, the attention mechanism and Transformers, and large language models, including scaling laws, the history of GPT, instruction tuning, reinforcement learning from human feedback, hallucination, alignment faking, chain-of-thought reasoning and test-time scaling. The emphasis on large language models reflects requests from the students. The notes are aimed at third- and fourth-year students in the UK system. Because the course was also taken by students from other departments, very little is assumed: even basic material such as matrix multiplication is explained from scratch, so readers familiar with it can safely skip such parts. No originality is claimed; the aim is a coherent, intuitive path through the material. Developments after spring 2025 are not covered, but the basic ideas emphasized here are unlikely to go out of date soon.

cs.LG · hep-lat · hep-th · physics.comp-ph

新论文 · v1arXiv:2611.21063

A Hierarchically Compressed Immittance Operator Formulation for Fast Statics-to-Full-Wave Electromagnetic Simulation with the Boundary Element Method

Shashwat Sharma

原文摘要

The boundary element method allows the electromagnetic simulation of three-dimensional problems with a two-dimensional discretization, using a surface integral representation of Maxwell's equations. For applications involving broadband simulations or multiscale geometries, the well-known low-frequency breakdown of conventional integral equation formulations must be addressed, while ensuring that dielectric, semiconducting, and lossy metallic regions are modeled rigorously, including the skin effect. In this work, a new boundary element formulation based on an immittance operator is proposed, where the underlying integral equations are inherently valid from statics to the full-wave regime. To enable efficient matrix assembly and solution, a hierarchical matrix compression strategy is devised, leveraging fast direct factorization as an intermediate step, and fast matrix-vector products for the iterative solution of the final system of equations. The proposed formulation is capable of electrostatic, magnetostatic, quasistatic, and full-wave simulations of dielectrics, semiconductors, and lossy metals. Representative numerical examples drawn from a variety of applications demonstrate the accuracy and efficiency of the proposed method.

cs.CE · physics.comp-ph

新论文 · v1arXiv:2611.20990

Transferable neural-network preconditioners for Wilson--Clover propagator inversions

Shiyi Zhong, Yuanyi Zhang, Jian-Hui Zhang, Dian-Jun Zhao

原文摘要

We investigate two single--layer neural-network architectures for accelerating four-dimensional Wilson--Clover propagator inversions on lattice ensembles in practical use; both transfer directly without retraining. The first is a gauge-covariant parallel transport convolution (PTC) network that directly reduces the number of generalized conjugate residual (GCR) solver iterations. The second is a CNN-like network used together with a multigrid-inspired algorithm. The two approaches can be combined to further reduce GCR iterations. PTC transfers without retraining across lattice volumes, lattice spacings, and pion masses while maintaining comparable acceleration, whereas the CNN-like network transfers directly from small- to large-volume ensembles with strong acceleration. A cost comparison accounting for both basis construction and solves shows that the proposed scheme is more advantageous for large-volume ensembles than for small-volume ones.

hep-lat · cs.LG · physics.comp-ph

版本更新 · v2arXiv:2611.14562

A Neural Physics Solver for Richards Equation

Katherine MacKenzie, James Rand, Ben Ashby, Tristan Pryer, Claire E. Heaney, Christopher C. Pain, Thomas Rodding Kjeldsen

原文摘要

A new approach to discretise and solve Richards equation based on the finite element method (FEM) is presented. The novelty of the approach, called the Neural Physics method, is that it expresses the discretisation as a convolution neural network (CNN) whose weights are predetermined by the integrals of the basis functions in the FEM. The Neural Physics method is physically consistent as it represents a discretisation of the governing equation and can run on CPUs, GPUs and the latest AI accelerators, resulting in an increase in computational speed. The Neural Physics method is demonstrated for two different discretisations of Richards equation, including a multigrid method that is realised through a U-Net architecture. The accuracy and speed of these methods is tested on a problem with a known analytical solution and compared to a standard FEM, and shows that the Neural Physics method is almost an order of magnitude faster than a comparable FEM. Finally, the Neural Physics method is applied to a real-world test case with integrated experimental data and simulates the infiltration of water through a rain garden. This new approach therefore provides a route to efficiently and accurately solve Richards equation for a wide array of hydrological applications.

cs.CE · math.NA · physics.comp-ph

版本更新 · v3arXiv:2608.17032

Validating direct solvers for Newton's gravitational N-body problem, and the systematic comparison between IEEE floating point and Posits

Simon Portegies Zwart

原文摘要

We present a systematic comparison between arbitrary precise arithmetic and integration, IEEE-754 compliant floating point arithmetic (fp16, bfp16, fp32, double precision fp64, and quadruple precision fp128), and two implementations of Posits (type III unum) for solving Newton's chaotic N-body problem. Each implementation is benchmarked with arbitrary precise calculations to objectively evaluate their performance in precision as well as speed. We rely on hardware and compiler implementations for fp64, and software implementations for arbitrary-precision arithmetic and Posits. Half precision arithmetic (fp16, bfp16, and Posits$<16,1>$) are insufficiently precise for solving Newton's equations of motion. Single precision (fp32, and Posits$<32,2>$) could be used for statistical ensemble calculations, but lead to relatively large errors in any individual strong encounter. All 64-bit implementations fp64 as well as Posits (Posits$<64,3>$) experience difficulty in our tests. One of the implementations of Posits (Universal) gives precision comparable to fp64 but is slow (by at least an orders of magnitude compared to fp64 after correcting for the more efficient hardware support for the latter). The other (CPPPosits) has a speed comparable to fp64 but has systematically larger errors (by about an order of magnitude compared to fp64 with excesses exceeding two orders of magnitude). As a consequence, this implementation leads to a systematic drift in the result space and has difficulty resolving close encounters. Posits and fp64 have difficulty when integrating a dynamical system in a moving reference frame; testing Galileo invariancy. In their current implementation, Posits do not seem to be the ideal alternative for fp64 when integrating chaotic or stiff ordinary differential equations, such as Newton's equations of motion.

physics.comp-ph · astro-ph.IM · cs.PL · nlin.CD

新论文 · v1arXiv:2611.20609

Newton-PINet: A fast physics-informed neural network with Newton linearization for meta-learning nonlinear PDEs

Yuchen Fan, Chang Wei, Pao-Hsiung Chiu, Chin Chun Ooi, Heyang Wang, Jian Cheng Wong

原文摘要

Scientific machine learning has opened new avenues for solving parameterized partial differential equations (PDEs), enabling models to learn a family of PDEs and generalize to unseen instances. In this context, data-driven operator learning methods typically require large training datasets, while physics-informed neural networks (PINNs) suffer from difficult optimization and limited generalization, especially for nonlinear PDEs. We propose Newton-PINet, a physics-informed network enhanced by Newton linearization, offering an effective meta-learning framework for nonlinear PDEs. Newton-PINet (i) employs a physics-informed multilayer network with skip connections, where the output-layer weights are solved by least squares; (ii) adopts a two-stage learning strategy that first leverages gradient-based training to learn robust representations from the available training tasks, and then performs gradient-free fine-tuning on the output layer for fast task-specific generalization; and (iii) incorporates a Newton linearization method to speed up the least-squares iteration for nonlinear PDE problems. On a challenging nonlinear reaction-diffusion benchmark, Newton-PINet achieves up to three orders of magnitude lower relative error than recent neural solvers, while using 16x fewer training tasks and over an order of magnitude less training time (about 5 minutes versus several hours). This work advances the meta-learning of PINNs toward data-efficient, fast, and generalizable physics solvers. The code and datasets are publicly available at: https://github.com/fycAIwj/Newton-PINet.

cs.LG · cs.AI · cs.CE · physics.comp-ph

新论文 · v1arXiv:2611.20551

GranularGPT: Natural-Language-Driven End-to-End Discrete Element Method Simulations

Erlei Li, Sirui Tang, Ai Wang, Mingwei Hu, Yuchen Dai, Geoff Wang

原文摘要

Discrete element method (DEM) simulations are widely used to investigate granular and particulate systems, but their application often requires specialized expertise in particle physics, numerical modelling, and simulation post-processing. Large language models (LLMs) offer new opportunities to simplify these workflows by enabling users to interact with simulation tools through natural language. This study offers GranularGPT, an LLM-assisted agentic framework for end-to-end DEM simulation workflows, from natural-language problem descriptions to simulation execution and automated post-processing. The framework enables users to generate DEM simulation cases, execute and monitor simulations, and automatically extract and report physical and process-level metrics. Evaluation across 60 normal-condition cases covering 12 DEM scenarios and parameter variations achieve a simulation success rate of 91.7%. In the error-handling evaluation, all 10 repairable errors are detected and 9 are successfully resolved, while all 5 non-repairable cases are correctly identified and reported. The framework automatically extracts a range of DEM-relevant metrics, including particle size distributions, packing and density measures, velocity profiles, discharge rates, mixing indices, contact force characteristics, and thermal quantities. GranularGPT provides a foundation for improving the accessibility and efficiency of DEM simulation workflows while reducing the specialized expertise required for their operation.

physics.comp-ph · cs.AI

新论文 · v1arXiv:2611.20316

Solving the Discretised Shallow Water Equations on Distorted Structured Grids with Neural Physics

Boyang Chen, Claire E. Heaney, Christopher C. Pain

原文摘要

This paper presents a method for solving the shallow water equations on highly distorted structured grids using convolution-based operators following the Neural Physics approach. By mapping distorted physical grids to a uniform computational domain with Jacobian transformations, the governing advection and diffusion operators are reformulated in a structured convolutional form. This enables the use of efficient stencil-based operations and, following the Neural Physics concept, we do this through convolutional layers whose weights are determined by the chosen numerical methods rather than by training. The method introduces consistent mass-lumped formulations, conservative and non-conservative advection forms, and a diffusion operator, all expressed as convolutions. A nonlinear Petrov-Galerkin stabilisation is incorporated to control numerical oscillations on distorted meshes. Two approximations for the Laplacian operator are also proposed to accelerate pressure and diffusion solves. The framework is validated using the Carlisle 2005 flood event, demonstrating accurate predictions of water depth and velocity on distorted meshes for both linear and quadratic discretisations. The results show that distorted structured grids can retain conservation, stability and accuracy, whilst adapting the mesh statically. The convolutional formulation makes the method well suited to Neural Physics implementations and GPU acceleration, offering a scalable approach for flood modelling and large-scale geophysical simulations.

physics.comp-ph · cs.CE · physics.flu-dyn

新论文 · v1arXiv:2611.20035

U-HamGNN: a universal model for magnetic Hamiltonians conditioned on spin and Hubbard U

Hongyu Yu, Yinze Hu, Yizhou Chen, Yang Cheng, Yingwei Chen, Xingao Gong, Yang Zhong, Hongjun Xiang

原文摘要

The electronic structure of a magnetic crystal depends jointly on its spin configuration and the on-site Hubbard correction U, requiring a separate DFT+U calculation for each combination. We introduce U-HamGNN, an equivariant network that takes these two inputs directly and predicts spin-resolved Hamiltonians across diverse crystal chemistries. A spectral-hybrid optimizer that weights each update direction by how consistently the gradient points along it reaches 8% lower Hamiltonian error than Muon and 26% lower than AdamW in a ten-epoch benchmark. The predicted bands reproduce U-dependent gap opening and altermagnetic spin splitting within the trained window and beyond it; exchange couplings and magnetic-order calls derived from the Hamiltonian agree with DFT+U on a calibration set. This universal model provides a new tool for magnetic research.

physics.comp-ph · cond-mat.mtrl-sci · cs.LG

新论文 · v1arXiv:2611.19793

IANN: A Unified Framework for Equivariant InterAtomic Neural Networks with User-Friendly Implementation

Changzhi Ai, Xueping Qin, Dimosthenis Sokaras, Frank Abild-Pedersen, Johannes Voss

原文摘要

Machine-learning interatomic potentials (MLIPs) now approach density functional theory (DFT) accuracy at a fraction of its cost, but the practical benefit is limited by software fragmentation: each state-of-the-art architecture is released as a separate codebase, with its own data format, configuration system, training loop and molecular-dynamics interface. Comparing two architectures on the same dataset, or moving a trained model into a production simulation, therefore requires substantial re-engineering. We introduce IANN (InterAtomic Neural Network), an open-source PyTorch framework that reimplements equivariant graph neural networks - PaiNN, NequIP, MACE, Allegro, EquiformerV2, EquiformerV3 and UMA - behind a unified data object, a unified trainer and a single deployment route, so that the architecture is a one-word change in a configuration dictionary. Forces, stresses and virials are obtained for every architecture from one analytic differentiation of the energy with respect to the edge vectors of the atomic graph, exact under periodic boundary conditions. Distributed training is configured automatically from the SLURM, PBS or MPI environment, so the same script runs unchanged from a workstation to a multi-node GPU allocation. Self-describing checkpoints serve directly as ASE calculators, as ensembles reporting uncertainties, or as TorchScript models run inside LAMMPS through bundled C++ pair styles with single- and multi-GPU inference. Trained on a common dataset of millions of structures, the architectures can be compared under identical conditions. We further release PaiNN foundation models trained on 41.9 million curated DFT structures from MPtrj, Alexandria, OMat24, MatPES, OC20, OC22, OC25, MPr2SCAN and MatPESr2SCAN, spanning the PBE, RPBE and r2SCAN functionals. Additionally, IANN provides an agent interface to facilitate integration with autonomous agents.

cond-mat.mtrl-sci · cs.LG · physics.comp-ph

新论文 · v1arXiv:2611.19676

Score-Based Stochastic Closure Modeling via Offline Indirect Learning and Online Data Assimilation

Xinghao Dong, Huchen Yang, Jin-Long Wu

原文摘要

Stochastic closure modeling is an emerging area in reduced-order modeling of large and complex (e.g., multiscale, multi-physics) systems, for which the computationally affordable reduced-order physical descriptions (e.g., digital twins for additive manufacturing, world models for AI agents) in numerical simulations inevitably lead to information losses that cannot be well addressed by classical deterministic closures. However, learning stochastic closures typically requires closure data that are difficult to obtain from measurements or often prohibitively expensive to compute using first-principles simulations. In this work, we develop a stochastic closure modeling framework that builds on score-based diffusion models, leveraging indirect offline training and online data assimilation without requiring the direct data of closures. Numerical experiments on two-dimensional turbulent flows demonstrate that indirect offline learning captures key closure statistics and improves predictions of system state. In addition, combining the learned closure with known physical dynamics leads to better generalization capability across different regimes than purely data-driven models that directly predict system state. Compared to standard data assimilation methods with a Gaussian assumption, the posterior-score assimilation better represents non-Gaussian features of the learned closure, and its combination with state-level data assimilation further improves prediction of the system state. The proposed framework enables stochastic closure modeling in realistic and challenging scenarios of complex dynamical systems in mechanics and engineering problems, where non-Gaussian statistics of model-form uncertainties are non-negligible (e.g., due to the nonlinearities of the system dynamics and/or the observations) and true closure data are not available, for both offline learning and online assimilation.

cs.LG · physics.comp-ph · physics.flu-dyn

新论文 · v1arXiv:2611.18420

Graph diffusion transformer for interpretable generation and inverse design of disordered atomic structures

Jiani Hu, Chenyan Wang, Yongkun Yang, Guanyu Hou, Jihaochen Zhang, Lei Liu, Ji Chen

原文摘要

Atomic disorder offers a potent degree of freedom to tailor material properties, yet the resulting vast configuration space obscures structure-property relations and hinders rational inverse design. Here we introduce Graph Amorphous Diffusion Transformer (GaDiT), a generative model that combines dynamic periodic graphs, masked conditioning and an interval-weighted training-noise distribution. GaDiT generates high-quality disordered structures while accelerating sampling by two orders of magnitude compared with existing corrector-based approaches, as demonstrated across two-dimensional amorphous carbon and three-dimensional amorphous silicon and silica. Moreover, GaDiT supports conditional generation under single or combined structural features, physical properties and preparation conditions in a unified model, and enables inverse design that expands accessible structure-property ranges beyond the training distribution. To interpret these structures and the trained network, we propose a conditioned atomic response mapping analysis, revealing both the global structural descriptors and the local atomic environments that govern target properties. Overall, GaDiT establishes a general framework for interpretable generation, inverse design and structure-property discovery for disordered atomic structures.

cond-mat.mtrl-sci · cond-mat.dis-nn · cond-mat.mes-hall · cs.LG · physics.comp-ph

新论文 · v1arXiv:2611.18012

ADfiRe: An empirical- and CFD-informed advection-diffusion-reaction thermal model for wildfire spread

Konstantinos Vogiatzoglou, Nikolaos Sdiros, Costas Papadimitriou, Konstantinos Ampountolas, Petros Koumoutsakos, Vasilis Bontozoglou

原文摘要

Real-time wildfire forecasting requires a trade-off between rapid yet physically relevant models and high fidelity but computationally costly models of flame spread over heterogeneous, multiphase solid fuel. The present study introduces ADfiRe, a hybrid framework that integrates empirical correlations and CFD-informed parameterizations into a physics-based advection-diffusion-reaction (ADR) formulation. The key features of ADfiRe are the use of established fuel databases, the capacity to handle multiple fuels, and a methodology to capture the effect of arbitrary topography. Furthermore, it includes the effect of flame tilting due to wind, thus accounting for the differences between plume- and wind-dominated fire propagation. ADfiRe resolves explicitly the coupled thermochemical degradation as well as heat and mass transport mechanisms of the advancing fire front. The wind field is modeled based on an appropriately defined Byram number. The model is validated against five well-documented experimental field-scale fires in Mediterranean shrublands, showing quantitative agreement with key metrics such as the rate of spread (ROS) and the fireline intensity, through a two-stage, Arrhenius-based heterogeneous reaction scheme coupling solid-fuel pyrolysis and oxygen-limited char/volatile combustion.

physics.comp-ph · cs.CE · math-ph · physics.flu-dyn

新论文 · v1arXiv:2611.17560

Generative Design with Real-time Physics Explainability: Towards Product Definition in the Age of AI

M. de Campos, C. Drygala, E. Ross, A. Bruce, M. Bohon, H. Gottschalk

原文摘要

In this article, we explore opportunities from using generative AI in mechanical engineering. On the one hand, generative methods based on invertible neural networks have been recently proposed for the solution of inverse design problems, allowing to infer design parameters from performance labels. On the other hand, generative AI models have shown that they can act as real time capable surrogates for physics based simulations. Here we suggest that these two streams should be combined in a unified framework, where INN are used to control the design process from the customer requirements perspective and the generative simulation of the systems physics adds a layer of explainability, why the proposed design fulfils the requirements. As generative design is prone to hallucinations, we propose uncertainty quantification to fend off physically infeasible requests. Finally, validation with classical tools is a requirement for generative design process. To demonstrate the capabilities of our novel generative design paradigm, we develop two interactive environments, one for airfoil design based on simulator data and one for the combustor design space exploration based on measured data.

cs.LG · physics.comp-ph

版本更新 · v4arXiv:2512.04954

Amortized Inference of Multi-Modal Posteriors using Likelihood-Weighted Normalizing Flows

Rajneil Baruah

原文摘要

We present a technique for posterior estimation using Normalizing Flows trained with likelihood-weighted importance sampling, the special case of neural importance sampling in which the proposal is the prior. This approach allows for the efficient inference of theoretical parameters in high-dimensional inverse problems without the need for posterior training samples. We implement the method on multi-modal benchmark tasks in 2D and 3D to check for the efficacy. A critical observation of our study is the impact of the base distribution on the modelled posteriors. We find that standard unimodal base distributions leave spurious probability \textit{bridges} between well-separated modes. We demonstrate that initializing the flow with a Gaussian Mixture Model that matches the number of target modes significantly improves reconstruction fidelity, as measured by some distance and divergence metrics. Finally, we apply this method to a curated problem in heavy flavour physics --- the extraction of the Wolfenstein parameters from the CP asymmetry in $B^0\to J/ψ\,K^0$; it is multimodal, non-Gaussian, and asymmetric in its mode weights --- and compare the results against a well-converged Markov Chain Monte Carlo reference and an exact reference computed by quadrature, using different metrics. Used as a proposal for importance sampling, the trained flow removes its remaining bias and gives the evidence.

cs.LG · hep-ex · hep-ph · physics.comp-ph · physics.data-an

新论文 · v1arXiv:2611.16082

Gradient-Aware AI Agents for Autonomous Turbulence Model Discovery via Differentiable CFD

Yi Liu, Xiantao Fan, Mingqi Xu, Jian-Xun Wang

原文摘要

Turbulence modeling relies on human choices of closure form, physical inputs, and tunable parameters. Training closures a posteriori is efficient only with gradients through long chaotic rollouts, which few solvers provide. Most a posteriori approaches therefore resort to gradient-free optimization, and nearly all fix the closure form in advance, learning only its parameters. In this work, we introduce a gradient-aware agentic framework that poses closure discovery as a bilevel problem: a multi-agent large language model (LLM) system searches over closure forms, while a GPU-native differentiable computational fluid dynamics (CFD) solver supplies gradients, making differentiable a posteriori learning an action of the autonomous AI agent. For each proposal, the agents construct a differentiable training program by embedding the analytical, neural, or hybrid closure in the solver, implementing a differentiable objective, and validating the gradient path. They then decide whether to evaluate the closure, compute its parameter sensitivities, or train it a posteriori, select the optimization settings, and revise subsequent proposals using the simulation outcomes and returned gradients. Truncated-horizon gradients make this training usable under chaotic dynamics for closures with tens of thousands of parameters. Demonstrations include dissipation-law and subgrid-scale closure discovery in two-dimensional turbulence and wall-model discovery for large-eddy simulation of three-dimensional channel flow. With gradient-based training, the agent recovers reference coefficients that forward evaluation alone does not reach within the same budget, and autonomously discovers and trains analytical and neural closures that improve agreement with the targeted reference statistics. These results demonstrate the feasibility of end-to-end autonomous turbulence model development in time-resolved flows.

physics.flu-dyn · cs.LG · cs.MA · physics.comp-ph

版本更新 · v2arXiv:2512.15476

QuantGraph: A Receding-Horizon Quantum Graph Solver

Pranav Vaidhyanathan, Aristotelis Papatheodorou, David R. M. Arvidsson-Shukur, Mark T. Mitchison, Natalia Ares, Ioannis Havoutis

原文摘要

Dynamic programming is a cornerstone of graph-based optimization. While effective, it scales unfavorably with problem size. In this work, we present QuantGraph, a two-stage quantum-enhanced framework that casts local and global graph-optimization problems as quantum-searches over discrete trajectory spaces. The solver is designed to operate efficiently by first finding a sequence of locally optimal transitions in the graph (local stage), without considering full trajectories. The accumulated cost of the resulting candidate acts as a threshold that prunes the search space (up to 60% reduction for certain examples). The subsequent global stage, based on this threshold, refines the solution. To achieve scalability and robustness, we draw on principles from control theory and embed QuantGraph's global stage within a receding-horizon model-predictive-control scheme. This classical layer stabilizes and guides the quantum search, improving precision and reducing computational burden. In practice, the resulting closed-loop system exhibits robust behavior and lower query complexity. Notably, for a fixed control horizon and query budget, QuantGraph supports approximately twice as many control discretization bits while still benefiting from Grover-search's inherent quadratic speedup compared to classical methods.

quant-ph · cs.RO · eess.SY · physics.comp-ph

版本更新 · v3arXiv:2503.08907

From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facility

Stefano Riva, Andrea Missaglia, Carolina Introini, J. Nathan Kutz, Antonio Cammi

原文摘要

The Shallow Recurrent Decoder networks are a novel paradigm recently introduced for state estimation, combining sparse observations with high-dimensional model data. This architecture features important advantages compared to standard data-driven methods including: the ability to use only three sensors (even randomly selected) for reconstructing the entire dynamics of a physical system; the ability to train on compressed data spanned by a reduced basis; the ability to measure a single field variable (easy to measure) and reconstruct coupled spatio-temporal fields that are not observable and minimal hyper-parameter tuning. This approach has been verified on different test cases within different fields including nuclear reactors, even though an application to a real experimental facility, adopting the employment of in-situ observed quantities, is missing. This work aims to fill this gap by applying the Shallow Recurrent Decoder architecture to the DYNASTY facility, built at Politecnico di Milano, which studies the natural circulation established by internally heated fluids for Generation IV applications, especially in the case of Circulating Fuel reactors. The RELAP5 code is used to generate the high-fidelity data, and temperature measurements extracted by the facility are used as input for the state estimation. The results of this work will provide a validation of the Shallow Recurrent Decoder architecture to engineering systems, showing the capabilities of this approach to provide and accurate state estimation.

cs.LG · physics.comp-ph · physics.flu-dyn

版本更新 · v2arXiv:2607.27741

Three-Photon Bayesian Imaging of Ortho-Positronium

L. Raczynski, W. Krzemien, A. Coussat, M. Bala, B. C. Hiesmayr, K. Klimaszewski, M. Obara, R. Y. Shopa

原文摘要

PET provides functional images relying on two-photon coincidences from positron-electron annihilation. In human tissue, about 40\% of annihilations are preceded by Ps formation, of which o-Ps component partially decays into three photons, with the remainder annihilating via pick-off or spin-exchange into two photons. This three-photon channel carries additional information about the surrounding micro-environment, including the three-to-two-photon yield ratio as a potential diagnostic marker. We propose the TRIO algorithm, a novel three-photon event-by-event image reconstruction algorithm formulated as a Bayesian maximum a posteriori inference problem. TRIO unifies time-based trilateration, energy-based reconstruction and, for the first time, a physics-informed prior derived from the QED description of Ps decay within a single probabilistic framework. In contrast to positronium lifetime imaging, which requires a prompt photon and is therefore restricted to specific radionuclides, TRIO relies solely on the three photons and is fully compatible with standard radionuclides such as 18F. Monte Carlo simulation modelled after the Siemens Biograph Quadra scanner demonstrates a mean position error of 1.65~cm, improving by a factor of about 2.8 over the time-based trilateration (4.59 cm) and a factor of about 5.3 over energy-based reconstruction alone (8.7 cm). More importantly, the proposed Bayesian approach is compatible with existing TOF-PET scanners that can register three-photon annihilation coincidences.

physics.med-ph · cs.CV · physics.comp-ph

版本更新 · v2arXiv:2610.13292

Recovering Irreducible Three-Body Interactions with Lagrangian Neural Networks

Sena Kalabalik, Sukru Caglar, Abdullah Umut Hamzaogullari, Arkadas Ozakin

原文摘要

Lagrangian Neural Networks (LNNs) learn mechanical systems from trajectory data by parameterizing a scalar Lagrangian and deriving the dynamics through the Euler-Lagrange equations, biasing the model toward motion that respects the variational structure of mechanics. The interactions studied so far have been pairwise-additive, leaving open whether LNNs can recover an irreducible many-body interaction from motion alone. We address this using the Axilrod-Teller triple-dipole interaction, the leading three-body dispersion term, whose dependence on the collective geometry of three particles cannot be represented by any sum of pairwise terms. We prescribe the kinetic energy exactly and learn only the potential, as a function of interparticle distances and angles. Combined with a signal-aware sampling strategy that concentrates training data where the three-body signal is strongest while preserving broad coverage of configuration space, this recovers the interaction from accelerations alone. The learned potential reproduces the radial scaling, angular dependence, and characteristic sign reversal of the Axilrod-Teller interaction, and generates stable trajectories. Embedding it within a pairwise Lennard-Jones potential lets us examine its observability: the three-body term is recovered once its dynamical signature exceeds the residual modeling error, which it does cleanly at amplified coupling but not at the coupling of a real noble gas, bracketing the transition between the two. Finally, symbolic regression on the trained potential, with no assumed functional form, returns the Axilrod-Teller expression with angular numerator, radial law, and coupling constant intact. An LNN with domain-specific structure can thus recover an irreducible three-body interaction from trajectories as a closed-form law, pointing toward learning interaction laws whose structure is not known a priori.

cs.LG · physics.atom-ph · physics.comp-ph

新论文 · v1arXiv:2611.14796

Selecting and verifying load-bearing periodic cells for elastic-wave band gaps with numerical acceptance checks

Shaoliang Yang, Jun Wang

原文摘要

A lattice mount must be stiff enough to support equipment and block vibration over a specified frequency range. Fast simulations help rank designs, but their errors can lead to a wrong acceptance decision. We present AMM (AgenticMetamaterials), an open-source Python tool that searches repeating cubic cells for targets on stiffness, the fraction of the cell that is solid, and band gaps. A complete band gap is an interval with no elastic-wave propagation in any direction. A separate checker allows for changes as the simulation grid gets finer. For gaps, it also tests for modes at sampled wave directions and wavelengths, so it can miss modes between samples. In 1,500 near-threshold tests of stiffness and solid fraction, the checker accepted 454 of 750 claims supported by the reference and none of the 750 false claims. Using the finest grid estimate alone accepted 42 false claims. In an independent finite-element comparison on ten new cells built from cubes joined by bars, the checker accepted one of two true gap claims and left all 17 false claims undecided. The reference could not classify the remaining claim. The protocol required every reported edge to err on the side of a narrower gap. The checker failed this test when it placed one upper edge too high, even though it left that thin-bar cell's claim undecided. Separating search from acceptance shows which targets the evidence supports and where a calculation needs further refinement.

cs.CE · physics.comp-ph

版本更新 · v2arXiv:2606.20467

智能体符号搜索:超越手工表达式、网格与神经网络的偏微分方程近似求解

Agentic Symbolic Search: Approximating Solutions of PDEs Beyond Hand-crafted Expressions, Meshes, and Neural Networks

Zongmin Yu, Jun Zhai, Liu Yang

AI 速读 基于摘要

提出 Agentic Symbolic Search(ASYS),让编码智能体结合进化搜索与梯度拟合,从已知 PDE 和数学知识出发构造并改进显式符号近似。

cs.LG · math.NA · physics.comp-ph

查看原文摘要

Numerical methods and neural networks have transformed our understanding of nonlinear partial differential equations (PDEs), yet discovering mathematical representations that explain their dynamics remains largely an expert task. We introduce Agentic Symbolic Search (ASYS), in which coding agents construct and refine explicit approximations from a known PDE and supplied mathematical knowledge. ASYS couples evolutionary search over differentiable symbolic programs with gradient-based fitting, using the governing equation to evaluate candidates and guide their revision. For a singular generalized Constantin-Lax-Majda profile, ASYS infers a missing decay term that sets how fast the field approaches its singular-time limit, and builds a basis that fits the profile to a median error of $3.90\times10^{-5}\%$. For Fujita blow-up, separating diffusion from reaction and deriving a local response lowers the supplied formula's error from 55.5% to 0.0879%. For Allen-Cahn interfaces, a 14-parameter construction yields a mode-coupling law confirmed by independent simulations. These studies show how agentic search develops mathematical starting points into accurate, analyzable approximations.

新论文 · v1arXiv:2611.14158

Neural network scaling and generalization for 3D strain fields in heterogeneous materials

Lucas Fourel, Paul Devianne, Marine Debouvry, Tristan Destruhaut, Russell Gunn, Ashwini Gupta, Lori Graham-Brady, Jean-François Molinari

原文摘要

Computational homogenization and coupled multiscale simulations of heterogeneous materials require repeated solution of mechanical fields on Representative Volume Elements, which becomes prohibitively expensive for high-resolution three-dimensional microstructures. Machine-learning surrogates can accelerate these computations, yet most existing approaches predict fields for fixed macroscopic loadings and provide limited guidance on how to scale network architectures for high-resolution 3D tensor-field prediction. This work presents a U-Net surrogate trained to predict the full 36-component strain localization tensor field in voxelized concrete mesostructures at resolutions up to $256^3$. Training localization tensors are generated with an FFT-based linear elastic solver, and an extensive hyperparameter optimization is performed to derive scaling rules and an accuracy-speed trade-off analysis. The results show that only network width and depth need to be scaled with problem complexity, while several conventional U-Net design choices, such as doubling channels after downsampling, are suboptimal for this problem. The final neural network achieves a Mean Absolute Error of 1.118% on both the validation and the held-out test sets, and an inference speedup of approximately 8.7x over the FFT-based solver on an Nvidia H100 GPU. Generalization experiments reveal transfer across aggregate volume fractions and highlight the importance of training on diverse morphologies. To safeguard reliability, a Maximum Mean Discrepancy metric computed on internal feature maps is proposed for detecting out-of-distribution microstructures without costly reference computations.

physics.comp-ph · cs.CE

版本更新 · v2arXiv:2609.02982

Equation Recast for Canonical Operator Learning Across Parametric PDEs

Qiyun Cheng, Valentin Duruisseaux, Cesar F. Clauser, Md Hossain Sahadath, Huihua Yang, Shaowu Pan, Nathaniel Ferraro, Anima Anandkumar 等 10 位作者

原文摘要

Learning solution operators across broad parameter ranges can require substantial coverage of both input functions and physical parameters, particularly for purely data-driven parametric models. In addition, the resulting models may fail silently outside the training distribution. We introduce equation recast, which reformulates parametric operator learning as the learning of a single canonical operator. Parameter-induced operator variations are derived analytically from the governing equation and absorbed into effective sources, enabling zero-shot prediction across new parameter regimes. Across multi-parameter, nonlinear, and singular PDE settings, equation recast supports extrapolation, integrates sparse heterogeneous datasets in a shared canonical representation, and uses loss of convergence as an internal warning signal for failure of the recast iteration. In high-fidelity tokamak simulations for nuclear fusion, the framework unifies electron-temperature data across four device geometries through canonical-domain mapping within one jointly trained operator. Equation recast provides a route toward reusable neural PDE solvers combining equation-guided transfer, data efficiency, and monitorable inference.

cs.LG · physics.comp-ph · physics.plasm-ph

版本更新 · v2arXiv:2610.24074

QRecoupling.jl:经典与量子重耦合系数的数值与精确计算

QRecoupling.jl: numerical and exact computation of classical and quantum recoupling coefficients

Seth K. Asante

AI 速读 基于摘要

介绍 Julia 包 QRecoupling,用于数值、精确和符号地计算 Clebsch-Gordan 系数、3j/6j 符号及用户自定义阶乘乘积求和。

cs.MS · gr-qc · math-ph · physics.comp-ph

查看原文摘要

The Julia package QRecoupling evaluates classical and quantum recoupling coefficients, such as Clebsch-Gordan coefficients and $3j$ and $6j$ symbols, and user-defined sums of factorial products, with numerical, exact and symbolic targets. One compact factorial rule covers classical and deformed evaluations, while its cyclotomic exponents reveal common factors and determine which terms contribute at unitary levels. Adaptive arithmetic resolves strongly cancelling sums, while exact tests in quantum integers distinguish algebraic zeros from small nonzero values without a computer-algebra system. At spin cutoff 500, classical $3j$ and $6j$ symbols are evaluated about 7 and 15 times faster than with WIGXJPF. For the tested quantum deformations, relative errors remain below $4\times10^{-14}$ through spin cutoff 400. Recurrences compute fusion matrices with 401 channels about 100 times faster than loops over their entries. The resulting coefficients support recoupling identities, changes of coupling basis and tensor-network calculations.