跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 150 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.07364

Asymptotic-Preserving Tensor Neural Networks for 3D High-Field Kinetic Equations with Applications to Uncertainty Quantification

Shi Jin, Tian-ai Zhang

原文摘要

Kinetic equations in the high-field regime describe particle transport dominated by electric-field acceleration and collisional relaxation. These equations are widely used in simulations of plasmas and semiconductor devices. Typical models include the Vlasov--Poisson--Fokker--Planck (VPFP) and Boltzmann--Poisson systems. Their high dimensionality and multiscale nature pose two of the major challenges to accurate and efficient numerical solution. To address these challenges, we propose an asymptotic-preserving tensor neural network (APTNN) method. Specifically, to reduce high-dimensional computational costs and memory requirements, we adopt the canonical polyadic (CP) decomposition structure of TNNs to approximate their solutions. We show that the equation residuals retain this decomposition form, allowing high-dimensional loss integrals to be evaluated through combinations of one-dimensional integrals. The resulting computational and storage costs are reduced from exponential to polynomial growth with dimension. To improve the prediction accuracy in the high-field limit, we enhance the baseline AP loss by incorporating the first moment equation. The added loss term directly constrains the limiting flux closure to reduce its approximation error in the high-field regime. The enhanced AP loss can still be evaluated dimension-wise. Numerical results show that APTNN improves prediction accuracy in the high-field regime with significantly reduced computational costs and memory usage. For a 3D3V VPFP problem with multiple random inputs, training takes less than 30 minutes on a single GPU.

math.NA · cs.LG

版本更新 · v3arXiv:2601.21623

LAMP: Look-Ahead Mixed-Precision Inference of Large Language Models

Stanislav Budzinskiy, Marian Gloser, Tolunay Yilmaz, Ying Hong Tham, Yuanyi Lin, Wenyi Fang, Fan Wu, Philipp Petersen

原文摘要

Mixed-precision computations are a hallmark of the current stage of AI, driving the progress in large language models towards efficient, locally deployable solutions. This article addresses the floating-point computation of compositionally-rich functions, concentrating on transformer inference. Based on the rounding error analysis of a composition $f(g(\mathrm{x}))$, we provide an adaptive strategy that selects a small subset of components of $g(\mathrm{x})$ to be computed more accurately while all other computations can be carried out with lower accuracy. We then explain how this strategy can be applied to different compositions within a transformer and illustrate its overall effect on transformer inference. We study the effectiveness of this algorithm numerically on GPT-2 models and demonstrate that already very low recomputation rates allow for improvements of up to two orders of magnitude in accuracy.

cs.LG · math.NA

新论文 · v1arXiv:2611.06665

To lift or not to lift: Operator inference for nonlinear PDEs with boundary control

Zhuoyuan Wang, Yorie Nakahira, Wael H. Ali, Saviz Mowlavi

原文摘要

Operator inference (OpInf) provides a nonintrusive framework for learning projection-based reduced-order models directly from data, but its standard formulations do not explicitly account for the fact that boundary actuation changes the admissible solution space of a PDE. This paper develops and evaluates a boundary-consistent, lifting-based OpInf formulation for nonlinear PDEs with time-varying inhomogeneous boundary conditions. The proposed approach decomposes the state into a known lifting component that satisfies the prescribed boundary conditions and a homogeneous component represented in a POD basis. Substituting this decomposition into the governing dynamics reveals a boundary-consistent reduced model structure in which the learned dynamics includes bilinear state-input and quadratic input-input interactions for quadratically nonlinear PDEs. The resulting operators are inferred from data, preserving the nonintrusive character of OpInf while guaranteeing boundary condition satisfaction by construction. Numerical experiments on boundary-actuated heat, Burgers, and lid-driven cavity problems show that the lifted formulation improves boundary compliance and can enhance prediction accuracy, solver stability, and computational efficiency, although these gains vary across problems and reduced model dimensions. Overall, this study establishes lifting as a principled extension of OpInf for boundary-actuated PDEs, clarifies when and how this formulation improves performance, and indicates that standard OpInf can remain an effective alternative in certain regimes.

math.NA · cs.CE · eess.SY

版本更新 · v3arXiv:2604.16512

Medial Axis Aware Learning of Signed Distance Functions

Samuel Weidemaier, Christoph Norden-Smoch, Martin Rumpf

原文摘要

We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher-order variational formulation that enforces linear growth along the gradient direction away from this discontinuity set. The eikonal equation and the zero-level set of the SDF are enforced as constraints. To make this variational problem computationally tractable, a phase field approximation of Ambrosio-Tortorelli type is employed. The associated phase field function implicitly describes the medial axis. The method is implemented for surfaces represented by unoriented point clouds using neural network approximations of both the SDF and the phase field. Experiments demonstrate the method's accuracy both in the near field and globally. Quantitative and qualitative comparisons with other approaches show the advantages of the proposed method.

cs.CV · cs.CG · cs.GR · cs.LG · math.NA

版本更新 · v2arXiv:2609.30809

Deep-Learning Solvers and Surrogates for Infinity and p-Laplace Problems

Tak Shing Au Yeung, Ka Chun Cheung, Hannah Potgieter, Steven J. Ruuth, Simon See

原文摘要

We investigate the use of neural network solvers for infinity and $p$-Laplace problems, which are fundamental in nonlinear analysis and have practical applications. Our approach employs Physics-Informed Neural Networks (PINNs) and Deep Operator Networks (DeepONets) to address computational challenges associated with large $p$ values, ranging from $2$ to $1000$, on various 2D and 3D domains. Our method offers advantages over traditional physics-based solvers, especially in three dimensions where mesh-based solvers become very costly for these problems. We also establish conditional convergence results for PINN approximations of both problems and a universal approximation result for DeepONet on the parametric $p$-Poisson problem. We demonstrate the effectiveness of these neural network solvers through numerical experiments and compare their performance with conventional methods.

math.NA · cs.LG

版本更新 · v2arXiv:2610.08701

大幅增长确实会发生:随机矩阵上带部分主元的高斯消元

Large Growth Happens: Gaussian Elimination with Partial Pivoting on Random Matrices

Daniel A. Spielman, Xifan Yu

AI 速读 基于摘要

作者证明对高斯随机矩阵做带部分主元的高斯消元时,出现大幅增长的概率至少是逆拟多项式级别,从而挑战了平滑分析与平均情形分析中的标准猜想。

math.NA · cs.DS · math.PR

查看原文摘要

We prove that the probability that Gaussian elimination with partial pivoting on $n \times n$ Gaussian random matrices has growth $ρ$ is at least inverse quasi-polynomial: $Ω\left(\exp\left(-c \log^2 \left(\fracρ{\sqrt{n}}\right)\log(n)\right)\right)$ for some constant $c > 0$. In particular, the probability of growth $ρ\ge n^{1/2 + ε}$ is at least $\exp(- O (ε^2 \log^3 (n) ))$. This lower bound breaks standard conjectures in the smoothed and average-case analysis of Gaussian elimination. To the best of our knowledge, it is the first non-trivial lower bound on the probability of large growth for Gaussian random matrices.

新论文 · v1arXiv:2611.05276

面向PINN与含拓扑孔洞PDE的de Rham上同调架构

De Rham cohomological architectures for PINNs and PDEs with topological holes

Andrew Gracyk

AI 速读 基于摘要

作者提出基于Hodge-Morrey-Friedrichs分解与de Rham上同调的PINN变体,试图缓解经典PINN在带孔洞、极点、空洞等拓扑病态场景下的失效模式。

cs.LG · math.NA

查看原文摘要

We attempt to alleviate failure modes of classical physics-informed neural networks (PINNs) in scenarios of topological pathologies corresponding to punctures, holes, poles, and voids by introducing de Rham cohomological augmentations, or Hodge-de Rham PINNs. Vanilla PINNs often encounter pitfalls in hole-based settings due to discontinuous interfaces, nonzero closed path integration, path dependence, correspondence to exact forms via the exterior derivative, etc., therefore we absolve traditional failures via parameterizing a 1-form by the Hodge-Morrey-Friedrichs (HMF) decomposition for manifolds with boundary, drawing a connection to de Rham cohomology such as through the HMF isomorphism theorem. 1-forms can act as representations of scalar-valued PDE solutions through integral operator mappings. We propose performing a PINN-based loss on the parameterized 1-form through an associated PDE, which subsequently solves the potential-based PINN problem and moreover remedies the failures of vanilla PINNs via the Sobolev-regular operator under a Fréchet differentiation interconnection. The operator relationship often has a nontrivial closed-form and often requires integration or a case-by-case analysis, which we address thoroughly in our experiments. When an integrability condition is not met on our losses, we can equip exhaustion functions to train the networks. We demonstrate our methods on the Aharonov-Bohm effect, which, to our understanding, is largely nonexistent in PINN literature. We develop theoretical guarantees of our methods and demonstrate our pathological safeguards on a broad selection of topologically-adverse problems, including scenarios of inexact forms, and those of nontrivial harmonics and coexact terms.

新论文 · v1arXiv:2611.05211

Physics-informed traditional and generative Mori-Zwanzig-reduced models for multiscale systems

Emily Williams, Saad Qadeer, Amanda Howard, Panos Stinis

原文摘要

Model reduction via the Mori-Zwanzig (MZ) formalism is well understood for coarse-grained representations constructed from standard basis functions such as Fourier functions. We show that the same formalism can be used to build reduced-order models in bases discovered by physics-informed machine learning. The fluctuation-dissipation theorem (FDT) is used to close the resulting non-Markovian evolution equations for the expansion coefficients of the learned basis. We further introduce a complementary, generative closure model. Relative to the Markovian dynamics alone, both the MZ and generative closures substantially improve predictions of the filtered states.

math.NA · cs.LG

版本更新 · v2arXiv:2611.00721

Representation-Aware Closed-Surface Parameterization: Exact Sensitivity Analysis and Pole-Aware Planar Preconditioning

Zixi Yi, Gary P. T. Choi

原文摘要

Surface parameterization is a fundamental task in geometry processing and shape analysis. For topologically closed surfaces, it is common to parameterize them onto a standardized closed domain in $\mathbb{R}^3$, with a prime example being a unit sphere for genus-0 closed surfaces. Many mapping methods use planar projections and perform computations on the plane rather than directly on the 3D surface. However, perturbations introduced before projection or geometric evolution propagate through the computation and may affect map quality, convergence, stopping behavior, and geometric validity. In this work, we formulate representation sensitivity as a branchwise input--output problem, separating smooth propagation through active Jacobians from changes in anchors, stopping rules, and fallback events. Under consistent piecewise-linear assembly, the unmodified south-pole Beltrami correction in the FLASH method for spherical conformal parameterization reduces exactly to source-mesh harmonic extension. On a fixed-anchor branch, the corrected map factors into chart transition, harmonic propagation, and inverse stereographic projection, yielding an explicit sensitivity Jacobian and a finite-triangle conditioning bound. Separately, we introduce a bounded five-parameter affine preconditioner over planar scale, translation, and anisotropy and evaluate candidates on the corrected spherical map. Across 30 genus-0 surfaces, it reduces median polar upper-tail log-condition and chord-angle distortion by $10.17\%$ and $10.97\%$, respectively, with both measures improving on every mesh. We also apply the framework to other spherical mapping methods including the conformalized mean-curvature flow and spherical density-equalizing maps. Altogether, our work highlights the importance of representation selection as a structural and practical component of spherical parameterization and downstream computation.

cs.CG · cs.GR · math.NA

版本更新 · v2arXiv:2406.14936

On the growth of the parameters of approximating ReLU neural networks

Erion Morina, Martin Holler

原文摘要

This work focuses on the analysis of fully connected feed forward ReLU neural networks as they approximate a given, smooth function. In contrast to conventionally studied universal approximation properties under increasing architectures, e.g., in terms of width or depth of the networks, we are concerned with the asymptotic growth of the parameters of approximating networks. Such results are of interest, e.g., for error analysis or consistency results for neural network training. The main result of our work is that, for a ReLU architecture with state of the art approximation error, the realizing parameters grow at most polynomially. The obtained rate with respect to a normalized network size is compared to existing results and is shown to be superior in most cases, in particular for high dimensional input.

cs.LG · math.NA

版本更新 · v4arXiv:2607.25494

Automated Numerical Stability Analysis of Deep Learning Operators

Xinye Chen

原文摘要

Finite-precision arithmetic unavoidably introduces numerical approximation errors. Numerical computations may use insufficient precision or an improper formulation, which leads to numerical instability. In this paper, we introduce a unified software tool for stochastic numerical validation of deep-learning operators. The tool follows CESTAC on supported exposed operations and uses an operator-level data-perturbation approximation for GEMM-like kernels. Our developed software not only enables numerical validation with a single computation pass but also detects the sources of numerical instability and provides numerical stability monitoring during deep learning training and inference. We verified its effectiveness on the detection of polluted operators with injected numerical instabilities across various tasks. We believe that our developed method and tools provide valuable insights into developing numerically stable computing kernels, which are particularly critical for numerically stable and efficient deep learning training and inference.

math.NA · cs.AI

版本更新 · v3arXiv:2601.22307

Exact Gaussian Moment Matching for Residual Networks: a Second-Order Method

Simon Kuang, Xinfan Lin

原文摘要

We study the problem of propagating the mean and covariance of a general multivariate Gaussian distribution through a deep (residual) neural network using layer-by-layer moment matching. We close a longstanding gap by deriving exact moment matching for the probit, GeLU, ReLU (as a limit of GeLU), Heaviside (as a limit of probit), and sine activation functions; for both feedforward and generalized residual layers. On large-variance random networks, median KL-divergence improvements over common baselines range from tens to thousands of times. On a variational Bayes neural network, we show that our method improves upon a state-of-the-art deterministic inference method by an order of magnitude in KL divergence from Monte Carlo ground truth. We also give a smooth-distance error bound showing that, under regularity assumptions, moment matching removes the leading low-variance errors and propagates higher-order local accuracy through the layers of a network.

cs.LG · math.NA

版本更新 · v3arXiv:2503.01036

Data-Efficient Kernel Methods for Learning Differential Equations and Their Solution Operators: Algorithms and Error Analysis

Bamdad Hosseini, Alexander Hsu, Yasamin Jalalian, Juan Felipe Osorio Ramirez, Houman Owhadi

原文摘要

We introduce a novel kernel-based framework for learning differential equations and their solution maps. The framework is efficient in its data requirements in terms of the number of observed states and the amount of data available per state. Our formulation also allows us to employ efficient Gauss-Newton-type optimization algorithms in the training procedure to improve accuracy and speed of the training procedure. We also support our algorithm with rigorous theoretical guarantees in the form of quantitative worst-case error bounds for the learned equation that can be extended to the subsequent solution operators under smoothness assumptions. Numerical benchmarks demonstrate significant improvements in computational complexity and robustness while achieving one to two orders of magnitude improvements in terms of accuracy compared to certain state-of-the-art algorithms.

stat.ML · cs.LG · math.NA

新论文 · v1arXiv:2611.03461

Unrolled gradients in disguise: bridging interpolation-based and Jacobian regularization for stable neural dynamics

Maya Janvier, Etienne Meunier

原文摘要

Hybrid models and neural differential equations (NDEs) are becoming increasingly important for modelling physical systems; however, they often encounter stability and accuracy issues during long-term integration. Training on unrolled trajectories is known to limit these divergences but quickly becomes too computationally expensive due to the need to compute gradients over an iterative process, making this method impractical for large-scale physical systems (e.g. weather and climate forecasting). Two popular paradigms for improving the stability of learned dynamics are to train on interpolated or noisy samples or to regularize the Jacobian of the learned representation. In this work, we demonstrate that these paradigms can be understood under a common lens and that they both correspond to an approximation of the gradients obtained in an unrolled learning strategy. Building on this understanding, we derive a principled and complete approach to regularize training and demonstrate its impact on the stability of learned dynamical systems.

cs.LG · math.NA

版本更新 · v3arXiv:2601.06514

Inference-Time Alignment for Diffusion Models via Variationally Stable Doob's Matching

Jinyuan Chang, Chenguang Duan, Yuling Jiao, Ruoxuan Li, Yi Xu, Jerry Zhijian Yang

原文摘要

Inference-time alignment for diffusion models aims to adapt a pre-trained reference diffusion model toward a target distribution without retraining the reference score network, thereby preserving the generative capacity of the reference model while enforcing desired properties at inference time. A central mechanism for achieving such alignment is guidance, which modifies the sampling dynamics through an additional drift term. In this work, we introduce variationally stable Doob's matching, a novel framework for provable guidance estimation grounded in Doob's $h$-transform. Our approach formulates guidance as the gradient of the logarithm of an underlying Doob's $h$-function and employs gradient-regularized regression to simultaneously estimate both the $h$-function and its gradient, resulting in a consistent estimator of the guidance. Theoretically, we establish non-asymptotic convergence rates for the estimated guidance. Moreover, we analyze the resulting controllable diffusion processes and prove non-asymptotic convergence guarantees for the generated distributions in the Wasserstein-2 distance. Finally, we show that variationally stable guidance estimators are adaptive to unknown low dimensionality, effectively mitigating the curse of dimensionality under low-dimensional linear subspace assumptions. Numerical experiments demonstrate the effectiveness of our proposed method and show the advantages compared to the baselines.

stat.ML · cs.LG · math.NA · math.OC · math.ST

新论文 · v1arXiv:2611.03419

Scaling global tractography with ExaTract: from large cohorts to ultra-high-resolution datasets

Simon Legeay, Felix Matuschke, Bastien Herlin, Jan André Reuter, Christophe Destrieux, Markus Axer, Ivy Uszynski, Cyril Poupon

原文摘要

Global tractography offers a theoretical framework for reconstructing white matter connectivity from diffusion MRI by jointly inferring all streamlines and their consistency with the diffusion signal and underlying anatomical priors. However, its sequential nature and log-linear complexity make it computationally prohibitive at the scales demanded by neuroimaging, from large population cohorts such as the Human Connectome Project (HCP) to ex vivo ultra-high-field acquisitions at mesoscopic resolution. In this work, we present ExaTract, a parallelized spin-glass tractography framework designed for high-performance computing (HPC) architectures. Implemented as an open-source MPI+Kokkos application, ExaTract partitions the tractography domain into spatially overlapping regions processed across distributed memory nodes, with regular synchronization of boundary modifications to preserve global convergence guarantees. We validate ExaTract on both in vivo and ex vivo diffusion MRI data: the complete HCP dataset demonstrates population-scale throughput, while the high-resolution Chenonceau dataset provides the first mesoscopic structural connectome derived from global tractography.

eess.IV · cs.DC · math.NA

版本更新 · v3arXiv:2501.19214

A SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization

Wei Liu, Yangyang Xu

原文摘要

Many real-world problems, such as those with fairness constraints, involve complex expectation constraints and large datasets, necessitating the design of efficient stochastic methods to solve them. Most existing research focuses on cases with no {constraint} or easy-to-project constraints or deterministic constraints. In this paper, we consider nonconvex nonsmooth stochastic optimization problems with expectation constraints, for which we build a novel exact penalty model. We first show the relationship between the penalty model and the original problem. Then on solving the penalty problem, we present a single-loop SPIDER-type stochastic subgradient method, which utilizes the subgradients of both the objective and constraint functions, as well as the constraint function value at each iteration. Under certain regularity conditions (weaker than Slater-type constraint qualification or strong feasibility assumed in existing works), we establish an iteration complexity result of $O(ε^{-4})$ to reach a near-$ε$ stationary point of the penalized problem in expectation, matching the lower bound for such tasks. Building on the exact penalization, an $(ε,ε)$-KKT point of the original problem is obtained. For a few scenarios, our complexity of either the {objective} sample subgradient or the constraint sample function values can be lower than the state-of-the-art results by a factor of $ε^{-2}$. Moreover, on solving two fairness-constrained problems and a multi-class Neyman-Pearson classification problem, our method is significantly (up to 466 times) faster than the state-of-the-art algorithms, including switching subgradient method and inexact proximal point methods.

math.OC · cs.CC · cs.LG · math.NA

版本更新 · v2arXiv:2609.22349

Domain-decomposed Evolutional Deep Neural Network with Random Features for Transient Pressure Diffusion with Discontinuous and High-Contrast Coefficients

Peiqi Li, Jie Chen, Hui Zhang, Simon Hands

原文摘要

Transient pressure diffusion in heterogeneous porous media becomes difficult to resolve efficiently when permeability is discontinuous and spans several orders of magnitude. In this paper, we develop a domain-decomposed random-feature evolutional deep neural network (DD RF-EDNN) that separates spatial approximation from temporal evolution. Permeability-informed random features are compressed into an orthonormal pressure space, and a conservative finite-volume operator is projected onto this space so that only the reduced coordinates are advanced in time. This formulation retains the dissipative structure of the discrete flow problem without repeated neural-network optimization. The analysis quantifies dictionary and singular-value truncation errors, proves contractivity under an energy-consistent dissipativity correction, and derives a conditional grid-level estimate for homogeneous dynamics and time-independent data admitting a steady lifting. Numerical experiments on low-permeability inclusions, high-conductivity blocks and channels, and three-dimensional grids assess the accuracy of the method across distinct coefficient configurations. The method reaches a final-time relative $L^2$ error of $9.54\times10^{-4}$ in the principal benchmark and maintains errors on the order of $10^{-2}$ at a permeability contrast of $10^3$. Numerical diagnostics further show that the observed error balance and temporal convergence are consistent with the analysis. These results support DD RF-EDNN as a structure-preserving and interpretable reduced formulation for transient simulations on prescribed heterogeneous media.

math.NA · cs.LG · math-ph

新论文 · v1arXiv:2611.03012

Low-rank corrections to a shared reference Jacobian for GPU-parallel AC $N\!-\!1$ contingency analysis

Marc Hunkemöller, Nico Westerbeck, Joost van Dijk, Lars Schewe, Dirk Witthaut

原文摘要

Contingency analysis repeatedly solves the power-flow equations under many single-element outages, an increasingly demanding workload as operating margins tighten and renewable variability grows. Graphics processing units (GPUs) are attractive for this task, but a change in topology alters the sparsity pattern of the Jacobian, preventing the uniform batched factorization on which efficient GPU solvers rely. This paper presents a GPU-parallel Newton--Raphson solver for $N\!-\!1$ contingency analysis that separates the change in operating state from the change in topology. A single reference Jacobian is inverted once and reused across all contingencies. Each topology change is expressed as a low-rank Woodbury correction, while the residual state-dependent perturbation is handled by an inner iterative solve, a truncated Neumann series or the biconjugate gradient stabilized method. We analyze the spectral radius and condition number of the resulting iteration matrices and show that the reference Jacobian is an effective preconditioner. On transmission-scale benchmarks, the method attains per-topology solve times competitive with an optimized 80-core central processing unit baseline, with the low-rank correction accounting for approximately 1--2\% of the workload. This makes GPU-parallel $N\!-\!1$ contingency analysis feasible at transmission scale without per-topology refactorization.

eess.SY · cs.DC · math.NA

新论文 · v1arXiv:2611.02787

POD-CNF: reduced order modeling of parametrized stochastic PDEs via normalizing flows and proper orthogonal decomposition

Andrea Violante, Nicola Rares Franco, Andrea Manzoni

原文摘要

Reduced-order models (ROMs) learned from trusted numerical simulations enable the real-time simulation of complex physical systems, making computationally prohibitive tasks-such as uncertainty quantification and optimal control-tractable. In particular, data-driven ROMs are opening the opportunity to learn from both numerical simulations and experimental data. However, integrating these sources of information is far from straightforward. Real-world measurements often involve multiple sources of uncertainty, including non-Gaussian noise, latent heterogeneities, unknown or hidden system parameters, and multiscale phenomena occurring below the resolution of the data. Consequently, real-world data are better described by parametrized stochastic partial differential equations, for which the development of effective ROMs remains relatively unexplored. In this work, we introduce POD-CNF, a data-driven generative ROM for efficient uncertainty quantification of parametrized high-dimensional systems. The approach combines projection-based model reduction and deep generative modeling. First, Proper Orthogonal Decomposition (POD) is employed to obtain a low-dimensional representation of the solution manifold. A Conditional Normalizing Flow (CNF) is then trained to approximate the density of the reduced coefficients conditionally on the input parameters. This formulation allows the surrogate to capture complex, multimodal output distributions, going beyond standard regression-based ROMs and least-squares predictions. We assess the effectiveness of POD-CNF through numerical experiments, demonstrating its ability to accurately reproduce output distributions while substantially reducing computational costs. Finally, a proof-of-concept application illustrates how the generative paradigm facilitates integration into Bayesian inverse problems, highlighting promising directions for future research.

math.NA · cs.LG

新论文 · v1arXiv:2611.02337

Embedding a de Rham Complex Structure into Eig-PIELM for Maxwell Eigenvalue Problems

Hao Kang, Liang Li, Xing Li

原文摘要

The perfect electric conductor (PEC) boundary condition alone does not eliminate the gradient nullspace of the Maxwell curl-curl operator. Consequently, a boundary-only Maxwell implementation of Eig-PIELM, an eigenvalue extension of the physics-informed extreme learning machine (PIELM), may retain represented gradient modes in its reduced trial space, producing nonphysical, gradient-contaminated modes. We develop dR-Eig-PIELM, a finite-dimensional structure-preserving extension that retains the linear-coefficient, boundary-null-space, and one-shot multimode architecture of Eig-PIELM. It combines compatible tensor-product grad--curl trial spaces with a constrained null-space construction to restrict the sampled PEC space to the mass-orthogonal complement of the represented gradient image before the eigensolve. Symmetric weak-form Gram assembly yields a symmetric-definite reduced eigenproblem without an eigenvalue cutoff under the stated sampling and material-positivity assumptions. For rectangles and cuboids, we establish fixed-degree exactness at the PEC vector-field space and derive rank and dimension identities. Numerical experiments show that dR-Eig-PIELM excludes the spurious eigenmodes with significant gradient components observed in the boundary-only baseline. The method exhibits rapid convergence with increasing polynomial degree and competitive work--precision performance in the tested configurations. A covariantly mapped waveguide example illustrates the potential of dR-Eig-PIELM for integration into design optimization workflows through a constrained local geometry update driven by computed cutoff frequencies and their sensitivities. This work provides a mathematical and computational framework for separating represented gradient modes from physical Maxwell eigenmodes within Eig-PIELM and supports its use in waveguide spectral analysis and geometry design.

math.NA · cs.LG

新论文 · v1arXiv:2611.02084

Black Hole Love Numbers with Physics-Informed Neural Networks

Maria J. Rodriguez, Luis Fernando Temoche, Pavlos Protopapas

原文摘要

We develop and validate a physics-informed neural network (PINN) framework for computing the tidal Love numbers of black holes directly from their perturbation equations. We consider static perturbations of the Kerr black hole, whose exact hypergeometric solutions provide a controlled benchmark for both the numerical solver and the extraction of the physical response. The framework combines exact enforcement of the horizon boundary conditions with an $H^2$-Sobolev loss that incorporates derivatives of the differential-equation residual. The Love number is then obtained by extracting the asymptotic coefficients of the learned solution, without using the analytic connection formula. Across the tested scalar, vector, and tensor perturbations, the method recovers the finite dissipative response with relative errors below $10^{-5}$. Controlled comparisons show that the higher-derivative loss terms improve solution accuracy by orders of magnitude, while independent tests of the extraction procedure distinguish solver errors from errors in recovering the response coefficients. The conservative response, which vanishes analytically, is constrained by the numerical error floor. These results demonstrate that PINNs can accurately compute black-hole tidal response and establish a validated framework for future extensions to frequency-dependent and non-separable perturbation problems.

gr-qc · cs.LG · hep-th · math.NA

版本更新 · v2arXiv:2608.22418

Optimal Condition Numbers in Low-Rank Positive Semidefinite Matrix Sensing

Mingxuan Sun, Zhiqiang Xu

原文摘要

In this paper we focus on the stability of positive semidefinite matrix sensing maps $Φ_{\mathcal{A}}=(\langle A_i,X\rangle)_{i=1}^m$ where $A_i\succeq 0$, $X\succeq0$ and $\operatorname{rank}(X)\le r$. We introduce the bi-Lipschitz constants of $Φ_{\mathcal{A}}$ and define the global condition numbers as the ratio of upper and lower Lipschitz constants. We give deterministic universal lower bounds for these condition numbers that depend only on the rank $r$ and on the underlying field. We then show that rank-one Gaussian measurements asymptotically attain these bounds, except for the operator-norm condition number over $\mathbb R$ when $r=1$. For this exceptional case, we establish a sharper universal lower bound and prove its asymptotic sharpness. As an application, we derive stability guarantees for an $\ell_1$-residual PhaseLift-type estimator at the optimal sampling scale. These results identify the intrinsic limits of conditioning in positive semidefinite matrix sensing and connect these limits to stable low-rank recovery.

cs.IT · math.FA · math.NA

版本更新 · v2arXiv:2505.23565

DRO: A Python Library for Distributionally Robust Optimization in Machine Learning

Tianyu Wang, Jiashuo Liu, Henry Lam, Hongseok Namkoong, Jose Blanchet

原文摘要

We introduce dro, an open-source Python library for distributionally robust optimization (DRO) for regression and classification problems. The library implements 15 DRO formulations and 9 backbone models, enabling 85 distinct DRO methods. Furthermore, dro is compatible with both scikit-learn and PyTorch through a unified interface, and uses approximation techniques to reduce runtime for some computationally demanding formulations. Comprehensive documentation is available at https://python-dro.org.

cs.LG · cs.MS · math.NA

新论文 · v1arXiv:2611.01300

Accelerating posterior sampling in Bayesian inverse problems with diffusion models: an online-offline perspective

Duc-Lam Duong

原文摘要

Bayesian inverse problems require both informative prior models and computationally feasible posterior inference. Score-based diffusion models provide expressive learned priors, but their use for inversion introduces a conditioning problem: the score of a noised posterior is generally unavailable from a prior score alone. This selective survey reviews the principal approaches to that problem, including likelihood guidance, spectral and projection methods, sequential Monte Carlo corrections, and amortized conditional training. We organize methods by how they split cost between offline preparation and online inference, and compare their assumptions, advantages and limitations, with emphasis on computational speedups. Some ongoing directions and open questions are gathered at the end.

cs.LG · math.NA · math.ST · stat.ML

新论文 · v1arXiv:2610.40528

NEOPIC:面向粒子动理学等离子体模拟的神经算子框架

NEOPIC: A Neural Operator Framework for Particle-based Kinetic Plasma Simulations

Sriramkrishnan Muralikrishnan, Chelsea Maria John, Jeffrey Kelling, Michael Bussmann, Robert Speck, Paul Gibbon

AI 速读 基于摘要

提出NEOPIC,一种直接作用于粒子经验测度的神经算子,作为即插即用的场求解器,用于粒子动理学等离子体模拟。

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

查看原文摘要

We introduce NEOPIC, a framework for learning the field operator in particle-based methods applied to kinetic plasma simulations. Its key novelty is a neural operator that acts directly on the empirical measure of the particles, rather than on a grid, and is evaluated at the particle positions. No mesh or tree is needed and, unlike grid-based neural operators, no deposition onto a mesh takes place, so the particle noise that dominates the inputs of particle simulations is not aliased. Since it replaces only the field solve, it serves as a plug-and-play field solver for particle-based methods: it can be trained on data from particle-in-cell, particle-in-Fourier or tree codes, and combined with any time integrator, including implicit schemes. We prove that the discrete evaluation coincides with the continuous operator at any number of particles (representation equivalence) and derive an error analysis that separates sampling, learning and time-stepping errors: up to the learning error, NEOPIC has the error structure of standard Monte Carlo particle methods. We show that the particle noise in the training data acts as an implicit regularizer, which gives guidance on the number of training particles in relation to the particle numbers used at inference. A complexity analysis shows that NEOPIC is an $O(N_p)$ method whose constants are set by the architecture alone, independently of any mesh or tree. Numerical experiments on electrostatic benchmarks in two and three dimensions, including Landau damping, two-stream and bump-on-tail instabilities, a cyclotron mini-app and a Penning trap, confirm the theoretical findings. A single model trained on several mini-apps generated by different reference methods captures all of them and remains stable up to twice the training time window, which points towards foundation models for fields in particle-based methods.

新论文 · v1arXiv:2610.40195

New hierarchical matrices for fast kernel matrix-vector products with Applications to Gaussian processes and kernel ridge regression

Ritesh Khan, Sivaram Ambikasaran

原文摘要

This article presents two new multilevel hierarchical matrices to perform fast kernel matrix-vector products in $d$ dimensions $(d>1)$, namely $\mathcal{H}_{hw}^{\prime}$, $\mathcal{H}_{hw}^{\prime \prime}$. We introduce a novel hybrid weak admissibility condition to construct these hierarchical matrices. More precisely, at coarser levels of the tree (i.e., larger blocks), we use a weak admissibility condition, wherein \textbf{far-field} and \textbf{vertex-sharing} clusters are considered admissible, while at the finer levels (i.e., smaller blocks), the \textbf{adjacent} clusters are treated as admissible. The admissible blocks at coarser levels of $\mathcal{H}_{hw}^{\prime}$ and $\mathcal{H}_{hw}^{\prime \prime}$ are represented using semi-nested and fully nested bases, respectively. In both hierarchical matrices, the finer levels at which adjacent clusters are treated as admissible are constructed in a non-nested fashion. Thus, they can be viewed as a hybrid of $\mathcal{H}$ and $\mathcal{H}^2$ matrices. We use adaptive cross approximation (ACA) and nested cross approximation (NCA) to construct non-nested and nested bases, respectively. The fast matrix-vector products are performed using the proposed hierarchical matrix formats. To evaluate the performance and usefulness of the proposed hierarchical matrices, we conduct some numerical experiments. The numerical results show that they outperform their uniform admissibility counterparts in terms of storage and matrix-vector product cost, demonstrating the effectiveness of the proposed hybrid formats. We also show that the proposed formats are competitive with the standard (or strong) admissibility-based $\mathcal{H}^2$-matrices. Furthermore, we showcase some interesting applications of the proposed hierarchical matrices.

math.NA · cs.MS · stat.CO

版本更新 · v4arXiv:2601.16884

Multigrade Neural Network Approximation

Shijun Zhang, Zuowei Shen, Yuesheng Xu

原文摘要

We study multigrade deep learning (MGDL) as a principled framework for structured error refinement in deep neural networks. While the approximation power of neural networks is now relatively well understood, training very deep architectures remains challenging due to highly nonconvex and often ill-conditioned optimization landscapes. In contrast, for relatively shallow networks, most notably certain one-hidden-layer ReLU models, training admits convex reformulations with global guarantees under appropriate settings, motivating learning paradigms that improve stability while scaling to depth. MGDL builds on this insight by training deep networks grade by grade: previously learned grades are frozen, and each newly added grade-wise subnetwork is composed on top of the previously learned grades and trained to fit the residual left by the current approximation, yielding a structured and interpretable hierarchical refinement process. We develop an operator-theoretic foundation for MGDL and prove that, for any continuous target function defined on a hypercube, there exists a fixed-width multigrade ReLU scheme whose residuals are pointwise nonincreasing in magnitude and converge uniformly to zero, with strict $L^p$-norm decay at every nontrivial grade for $p\in [1,\infty)$. To the best of our knowledge, this work provides the first rigorous constructive approximation guarantee showing that a grade-wise residual refinement scheme can achieve vanishing error in a fixed-width multigrade ReLU architecture.

cs.LG · math.NA · stat.ML

新论文 · v1arXiv:2610.40134

Integer-Quantized Hierarchical Matrices with Adaptive Bit Allocation

Erin Carson, Xinye Chen, Ritesh Khan

原文摘要

We present an adaptive bitwidth allocation method for quantizing low-rank factors in hierarchical matrices in order to decrease storage while meeting a given constraint on their reconstruction error. For the bitwidth allocation we formulate a discrete storage minimization problem and show that an optimal assignment can give larger singular values at least as many bits as smaller ones. We further develop a greedy algorithm that meets the specified max-norm quantization error budget. We investigate a hierarchical block partition in which all of the non-diagonal blocks are represented by quantized low-rank factors and only dense blocks remain dense; in this way a global reconstruction bound related to $η_k$ and $R_k$ is obtained, with the former and latter being bounds on the truncation and reconstruction arithmetic errors, respectively. Extensive simulations, carried out with kernel and BEM matrices under block-relative budgets, indicate that the proposed method achieves a reduction in storage of up to $44.3\times$ when compared to storing the complete matrix densely in FP64, and a reduction of up to $5.70\times$ when compared to the FP64 low-rank factors within the same partition, together with measured reconstruction errors that remained below the maximum norm bounds in all the hierarchical tests.

math.NA · cs.MS · cs.PF

新论文 · v1arXiv:2610.39897

Data-driven Random-feature Approximation of Koopman Generators of Nonlinear Continuous-time Systems

Ana Čukarska, Maximilian Gollwitzer, Viola Muning Li, Vladyslav Fediukov, Zahra Monfared, Felix Dietrich

原文摘要

Learning continuous-time dynamical systems from data is an active area of research. The Koopman formalism is often used here, because it is a flexible approach that is informative about the system's fundamental properties. The formalism represents dynamical systems through linear operators acting on a suitable function space. A practical difficulty arising in the numerical approximation of Koopman operators is the choice of a ``dictionary'', meaning an effective finite-dimensional representation of the function space. In this paper, we focus on learning dynamical systems in continuous-time, and so we consider numerical approximations of the Koopman generator instead of the Koopman operator. Our main contribution is a data-driven random-feature method to obtain a parsimonious and effective function representation for Galerkin approximation methods such as gEDMD. The representation we construct is data-informed, which allows us to improve upon data-agnostic methods. We empirically demonstrate the suitability of our method for forecasting tasks and system analysis. The numerical experiments show that our approach is accurate, and faster than iterative optimization. Further, we prove convergence of our approximation of the vector field and the resulting trajectories. In addition to the numerical results, we also make theoretical contributions, including a general convergence criterion for the semigroup generated by the gEDMD approximation and a counterexample showing that gEDMD does not generally preserve exponential boundedness. With our contribution, we advance the frontier of efficiently learning continuous-time dynamics from data, towards interpretable and mathematically robust modelling based on the Koopman framework.

cs.LG · math.NA