arXiv Machine Learning

Neural Constitutive Learning for Generalized Reaction-Diffusion Systems

arXiv Machine Learning
Sep 4

Differentiable Hybrid Modelling for Learning and Optimising Chemical Transport Processes from Experimental Data

The paper presents a differentiable hybrid modelling framework that combines a JAX finite volume population balance solver with learnable neural network components. This approach learns constitutive laws and initial conditions directly from experimental data, improving the fidelity of transport models in chemical engineering. The framework’s differentiability also enables optimisation of experimental settings for desired process outcomes.

By Arthur Jessop, Mohammed Alsubeihi, Ben Moseley, Ashwin Kumar Rajagopalan
Hugging Face Trending Papers
Sep 3

Differentiable Hybrid Modelling for Learning and Optimising Chemical Transport Processes from Experimental Data

The paper presents a differentiable hybrid modelling framework that combines a JAX finite volume population balance solver with neural network components to learn constitutive laws and initial conditions directly from experimental data. This approach addresses biases from hand‑picked models and the limitations of black‑box surrogates, enabling more accurate transport predictions. The framework’s differentiability also facilitates optimisation of experimental settings for desired process outcomes.

arXiv Machine Learning
Oct 9

Transferability of Learned States in Neural PDE Solvers

The paper introduces a framework for evaluating how well learned states from neural PDE solvers can be reused in new contexts. By separating solution accuracy, learning contribution, and numerical utility through paired state comparisons and cost accounting, the authors audit 12 papers and conduct experiments on linear PDE families, Fourier neural operators, and convolutional networks. Their results show that matched state comparisons and downstream computational evidence can lead to significant savings in conjugate‑gradient iterations and demonstrate finite‑budget pretraining value.

By Shunye Wang, Haochen Wen, Shuo Li Liu, Xuanyi Wang, Lihao Liu, Zhongying Deng
arXiv AI
Sep 25

RD-JEPA: Predictive latent pretraining for few-trajectory transfer across reaction--diffusion equations

RD‑JEPA is a joint‑embedding predictive architecture designed for self‑supervised pretraining on reaction‑diffusion trajectories. The model is pretrained on five parameterized systems and then adapted to three held‑out systems that were not seen during pretraining. Using as few as one, five, or ten complete trajectories from a held‑out system, RD‑JEPA outperforms five supervised surrogate baselines, an independently trained control that removes the trajectory‑dependent predictive latent pathway, and an architecture‑matched model trained from scratch, achieving lower mean relative discrete β field error and mean absolute spatial first‑difference error across various output resolutions, forecast horizons, and adaptation trajectory choices.

By Chenhao Si, Ming Yan
arXiv Machine Learning
Oct 8

Physics-Informed Neural Plasticity: PDE Solvers That Reshape Themselves

Physics-informed neural PDE solvers typically keep a fixed representation while adapting parameters, which limits performance on heterogeneous problems. The authors propose physics-informed neural plasticity, allowing the representation itself to reshape during training. Their ReCAP method dynamically redistributes capacity via local enrichment, residual-directed splitting, gate-based pruning, and function-aware merging, achieving the lowest relative $L^2$ error on five challenging 3D and 4D benchmarks and reducing error by 10.7%–27.5% compared to the best competing solvers.

By Chun-Wun Cheng, Bingcheng Hu, Angelica I. Aviles-Rivero
arXiv Machine Learning
Oct 3

One-Step Generative Modeling via Training Dynamics Action

The paper introduces TDAction, a method for one‑step generative modeling that selects transport targets during training based on a cost reflecting shared‑parameter effort and terminal mismatch. By formulating this as a soft‑terminal control problem, the authors derive a closed‑form Batch Tangent Action‑to‑Go value that captures cross‑sample interactions and can be efficiently implemented with randomized tangent probes. Experiments on ImageNet 256×256 demonstrate that TDAction achieves an FID below 1.1 without distillation.

By Zhangyong Liang, Ying Huang, Haibin Ling