Search arXiv⌕ Search

subject

cs.CE

cs.CE: explore 24 source-linked works published from 2024 to 2026, with original documents and citations.

This collection is a preview while coverage and quality are evaluated.

Search within this collection

Coverage and selection

Includes records with this source-supplied label or an explicit phrase match in their metadata. Matches indicate a mention, not proof that a paper uses a method or tests a material. Source versions are consolidated by DOI.

Sources: arxiv. Collection updated 2026-09-15. Counts describe this index, not the complete source archives.

arXiv2026

The PUR-1 Cyber-Physical Digital Twin

Digital twin technologies have the potential to improve operational flexibility and responsiveness capabilities of nuclear systems. To provide decision support, cyber event characterization, state estimation, predictive control, and real-time dynamic processing of operational data, however, an efficient digital twin needs to integrate multiple models (data-driven as well as physics-based) with explainability while at the same time maintain two-way synchronization with the physical facility at a time constant less than its operational cycle. In this work, we present the Purdue University Reactor One Digital Twin (PUR-1 DT), a cyber-physical digital twin with a complete high-fidelity physics-based and AI-driven virtual model stack (neutronics, thermal-hydraulics, point kinetics) which provides closed-loop explainable diagnostics, forecasting, predictive control, and action recommendation back to the reactor via two-way communications and a cyber-physical testbed. We demonstrate real-time synchronized state estimation and short-term forecasting over a full reactor operational cycle and conduct a series of benchmarking experiments to validate accuracy and latency. Our results show good agreement with experimental results and lay the groundwork for further development and experimental demonstration of DT-enabled functionalities in real-world facilities.

cs.CE↗
arXiv2026

FaVOR: LLM-Based Agentic Framework for Factor Mining via Empirical Validation

Traditional finance relies on experts to hand-craft factors through a principled process grounded in economic rationale. Recent LLM-based multi-agent systems have automated this process, scaling factor mining far beyond manual effort. However, these automated approaches optimize directly for returns and rarely check whether a generated factor still expresses the economic hypothesis that motivated it. We identify this inconsistency between mathematical form and economic meaning as a structural failure mode of return-oriented automation. The resulting factors blur the line between real signals and spurious correlations and break down across regime shifts. We propose FaVOR (Factor Validation through Observable Reasoning), an agentic framework that restructures factor mining around hypothesis-level evidence rather than return outcomes. In place of the standard hypothesis-to-formula leap, FaVOR enforces a three-stage consistency loop tying mathematical form to economic rationale throughout. (1) Decomposition splits a broad economic hypothesis into independent observable conditions. (2) Validation checks whether each factor reflects its intended condition. (3) Integration merges them into a composite whose structure remains interpretable. On the CSI 500 and S&P 500 in 2025, FaVOR outperforms existing baselines while remaining effective across regimes. FaVOR shows that hypothesis-grounded factor discovery produces signals that are interpretable by construction, regime-robust, and economically faithful. The code is available at https://github.com/damilab/FaVOR.

cs.AI↗
arXiv2026

Redefining Stablecoins from Nominal to Real Value: A Maximum Likelihood Approach

Stablecoins, typically pegged to fiat currencies, cannot achieve true stability because they inherit fluctuations in the underlying unit of account. To overcome this limitation, we introduce a stablecoin pegged to the Maximum Likelihood Value (MLV), a newly defined unit of account derived as the most probable configuration of latent real-value movements that explains observed nominal-value (price) changes. Grounded in inferential statistics and modern portfolio theory, MLV represents the most stable unit of account, as it enforces a zero real return on the minimum-variance portfolio. Empirical results confirm the operational viability of an MLV-pegged stablecoin: MLV can be computed in real time from 500 asset price series and improves annualized returns and Sharpe ratios while substantially reducing turnover in portfolio optimization.

cs.CE↗
arXiv2026

Efficient Parameter Calibration of Numerical Weather Prediction Models via Evolutionary Sequential Transfer Optimization

The configuration of physical parameterization schemes in Numerical Weather Prediction (NWP) models plays a critical role in determining the accuracy of the forecast. However, existing parameter calibration methods typically treat each calibration task as an isolated optimization problem. This approach suffers from prohibitive computational costs and necessitates performing iterative searches from scratch for each task, leading to low efficiency in sequential calibration scenarios. To address this issue, we propose the SEquential Evolutionary Transfer Optimization (SEETO) algorithm driven by the representations of the meteorological state. First, to accurately measure the physical similarity between calibration tasks, a meteorological state representation extractor is introduced to map high-dimensional meteorological fields into latent representations. Second, given the similarity in the latent space, a bi-level adaptive knowledge transfer mechanism is designed. At the solution level, superior populations from similar historical tasks are reused to achieve a "warm start" for optimization. At the model level, an ensemble surrogate model based on source task data is constructed to assist the search, employing an adaptive weighting mechanism to dynamically balance the contributions of source domain knowledge and target domain data. Experiments on multiple calibration tasks with varying source--target similarities demonstrate that SEETO consistently improves early-stage calibration efficiency under limited expensive evaluation budgets, while maintaining competitive overall optimization performance. This provides a practical approach for efficient automated calibration of NWP model parameters.

cs.CE↗
arXiv2026

Frontiers in FinTech: Multimodal Foundation Models for Financial Reporting and Decision Science

Financial information no longer arrives in a single format. Research reports come as PDFs, financial statements live in spreadsheets, market trends are captured in images, and policy documents reach analysts as scans, each carrying part of the picture the others cannot supply. Accounting information systems built around single-modality extraction pipelines and rule-based tools therefore struggle to assemble the full picture, slowing financial statement analysis, complicating audit evidence corroboration, and limiting investment decision support. This study presents FinVision, a multimodal large language model that unites vision-language models with domain-specific financial reasoning. Instead of processing documents in isolation, FinVision reads text, tables, and images together, converts them into consistent structured data, and verifies cross-modal agreement, in the same spirit as auditors corroborating evidence from independent sources. The model is trained in two stages, pre-trained on large-scale public financial corpora and fine-tuned on institution-specific investment data, so it can apply established valuation methodologies and audit risk assessment frameworks while outperforming zero-shot and single-stage baselines. A natural-language decision pipeline lets users describe what they need and turns those descriptions into executable workflows, supporting portfolio optimization, real-time risk monitoring, and refinement through multi-turn dialogue. Across 200 listed companies, FinVision reduced valuation error by 19 percent relative to the strongest baseline; a user study with 48 accounting and investment professionals reported a 51 percent reduction in task completion time. These results carry implications for audit automation, financial reporting quality, and more inclusive access to expert-level financial analysis.

cs.CE↗
arXiv2026

QoI-Aware Provisional Rollout and Retrospective Reconciliation for Reduced-State Scientific Twins

Scientific twins may need to continue operating when updates from an authoritative primary system are temporarily unavailable. Once synchronization resumes, the new boundary can also be used to revise the intervening history. We distinguish an immediately available causal provisional trajectory from a delayed, future-conditioned reconciled trajectory. For reduced-state twins, we introduce a deterministic, calibration-based reconciliation method. A smooth temporal bridge carries the residual observed at the next synchronization block backward through the provisional interval. An analytic energy-matching stage then applies smooth regional gains and a global rescaling to match a component-energy trajectory estimated by cubic regression in log-energy space from synchronized frames on both sides of the gap. The method uses no additional correction network and revises decoded history without changing the latent state used for later rollouts. We evaluate 64 spatial patches from 16 JHTDB isotropic-turbulence slices for both velocity components and gaps S in {4, 6, 8}. During the longest gap, field error and gradient-sensitive QoI error degrade at markedly different rates, so field error alone does not characterize provisional fidelity. At S = 8, full reconciliation reduces window-averaged NRMSE by about 60% for both components and global gradient-intensity error from 4.21% to 2.91% for vx, whereas future-aware physical interpolation reaches 20.40% on the same metric. Energy matching additionally makes the reconciled history match its boundary-inferred global energy trajectory exactly. Future boundary information therefore substantially improves scientifically relevant properties within the evaluated regime.

cs.CE↗
arXiv2026

OmniClimate-TC: Physics-Aware Visual Abstractions for Multimedia Reasoning over Tropical Cyclones

Meteorological reanalysis encodes extreme weather through continuous, physically constrained fields, posing a fundamental challenge for vision-language models (VLMs) whose perceptual assumptions are shaped by natural images. Tropical cyclones exemplify this mismatch: critical properties such as intensity extrema, asymmetry, spatial extent, and physical impacts arise from field-level organization rather than object-centric visual cues. Existing approaches address this gap through text alignment or annotation, treating the problem as multimodal supervision rather than representation design. We introduce Physics-Aware Visual Abstraction (PAVA), a plug-and-play physics-aware representation and annotation interface that maps physical reanalysis fields to visually identifiable and semantically grounded perceptual abstractions for supervision and evaluation in vision-language reasoning. Building on PAVA, we construct OmniClimate-TC, a benchmark for tropical cyclone analysis spanning five classes of reasoning and nine tasks, with 243,890 physically grounded instruction-tuning pairs. Using PAVA-aligned supervision, we adapt VLMs and provide evidence that this representation design improves reasoning over tropical cyclone hazard fields. Our results position OmniClimate-TC as a benchmark for multimedia reasoning over structured geophysical fields, and highlight representation design as a key ingredient for physically grounded reasoning in scientific media.

cs.CE↗
arXiv2026

Intrinsic Finite Element Methods for Fluids on Riemannian Manifolds Compared with Surface FEM

We present an intrinsic finite element formulation for the incompressible Navier--Stokes equations on Riemannian manifolds. We derive the corresponding weak formulation and prove that the backward Euler discretisation is energy stable. The proposed framework is validated on several representative manifolds, with particular attention paid to the long-time behaviour of the flow and its convergence to steady-state solutions represented by Killing vector fields. Comprehensive comparisons are performed with the surface finite element method and a corresponding eigenvalue formulation for Killing vector fields. The numerical results demonstrate that the intrinsic formulation provides an accurate, computationally efficient, and geometrically transparent alternative to embedded surface finite element formulations, while naturally extending to higher-dimensional Riemannian manifolds.

cs.CE↗
arXiv2026

Accelerated Patient-Specific Hemodynamic Simulations with Hybrid Physics-Based Neural Surrogates

Physics-based 0D reduced-order models provide computationally lightweight predictions of cardiovascular flows, resolving bulk hemodynamics in fractions of a second that would take days to solve using traditional 3D finite-element techniques. However, the accuracy of 0D models is limited as a result of the dramatic simplifications made in their derivations. In this work, we use 0D parameters learned from high-fidelity 3D data to improve 0D model accuracy without sacrificing its low computational cost or interpretability. We use the resistor-quadratic resistor-inductor (RRI) model to predict pressure drops over 0D vessels and bifurcations, where the resistances and inductance (0D parameters) are predicted from the bifurcation or vessel geometry using neural networks trained on high-fidelity 3D simulations. We validate the hybrid physics-based data-driven framework in three types of patient-specific vasculature - aortic, aortofemoral, and pulmonary anatomies. Use of learned 0D parameters reduces error by at least 50% compared to baseline 0D parameters across all anatomical cohorts. The improvements are especially marked for the more complex pulmonary anatomies, where 0D models with learned parameters reduced error from 30% to 7%. Exclusion of the quadratic resistor in the RRI model improved convergence compared to using the full RRI model. The resulting hybrid model presents a means of real-time (personal laptop runtime of <2 seconds for the most complex pulmonary anatomies), interpretable, and accurate cardiovascular flow modeling, enabling digital twins that support clinical decision-making as well as cardiovascular science and engineering research.

cs.CE↗
arXiv2026

Summoning the Oracle to Slay It: Mitigating Look-Ahead Bias in Financial Backtesting with Large Language Models

Backtesting large language models (LLMs) on historical financial data is unreliable when their pre-training data include the evaluated events. An LLM trained in 2024 may already encode how stocks moved during 2018-2020. We name this failure parametric look-ahead bias and propose FinCAD, an inference-time adaptation of Context-Aware Decoding that attenuates contributions from memorised historical outcomes without retraining. FinCAD pairs an adversarial bias-discovery pipeline that learns a model-specific memory-activating prior prompt with an entity- and date-adaptive rule that scales the CAD strength using a per-(entity, date) confidence signal. Across five 7-14B LLMs and five mega-cap equities, the largest model-level mean in-sample return correction is -67.1%. For the three larger models, 2025 out-of-sample returns remain within $8K and mean Sharpe within $\pm$0.10 of baseline; mean general-benchmark accuracy remains positive or within -1.7 points for four of five models. On an eleven-model leaderboard, FinCAD raises the subset-averaged in-sample/out-of-sample Spearman correlation from +0.779 to +0.846, yielding rankings that are more closely aligned with post-cutoff performance.

cs.AI↗
arXiv2026

Refined Thompson Learning for Adaptive Bandits: Power-Efficient Flexibility Scheduling Across Data Centers

The rapid growth of large-scale AI workloads in data centers has placed increasing pressure on power grids in recent years. Since power systems must continuously balance supply and demand, there is growing interests in leveraging data-center workload flexibility as a grid service. We propose a contextual restless multi-armed bandit (CRMAB) framework in which a grid operator requests load reductions without observing internal job-scheduling decisions. Under index-ability guarantee, each data center or physical machine is modeled as a Markov decision process (MDP) over a cyclic virtual-machine (VM) job queue, with unknown rewards and transition dynamics learned online using Thompson sampling and Whittle-index policies. To improve learning under sparse and noisy observations, the framework augments an adaptive Thompson--Whittle (TW) policy with domain-informed transition priors and gated prior mixing. In baseline experiments, the best adaptive refined variant achieves 91.4\% of the oracle reward after 100 rounds and 96.8\% after 1,000 rounds. Across a 16-setting stress test spanning different state-space sizes and levels of contextual noise, the best refined variant consistently outperforms the original TW policy with high confidence while remaining competitive with EXP4. A graph-based prior further incorporates data-center hardware constraints, including computing-resource limits. Overall, the results demonstrate the economic potential of data-center flexibility as a grid service and highlight the importance of high-quality, open-source AI workload traces for developing and evaluating such services.

cs.CE↗
arXiv2026

A Reduced Magnetic Vector Potential Approach with Higher-Order Splines

This work presents a high-order isogeometric formulation for magnetoquasistatic eddy-current problems based on a decomposition into Biot-Savart-driven source fields and finite-element reaction fields. Building upon a recently proposed surface-only Biot-Savart evaluation, we generalize the reduced magnetic vector potential framework to the quasistatic regime and introduce a consistent high-order spline discretization. The resulting method avoids coil meshing, supports arbitrary winding paths, and enables high-order field approximation within a reduced computational domain. Beyond establishing optimal convergence rates, the numerical investigation identifies the requirements necessary to recover high-order accuracy in practice, including geometric regularity of the enclosing interface, accurate kernel quadrature, and compatible trace spaces for the source-reaction coupling.

math.NA↗
arXiv2026

Report of the 2026 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science

Scientific computing is undergoing rapid transformation as advances in artificial intelligence, heterogeneous computing, automation, and data-intensive research reshape not only computational tools but also the institutions, workforce models, and collaborative practices that support scientific discovery. This report synthesizes insights from the 2026 Workshop on Next-Generation Ecosystems for Scientific Computing, the second in a three-year series focused on strengthening scientific computing ecosystems through socio-technical co-design. Workshop discussions identified four interdependent strategic themes: software ecosystems for AI-enabled scientific discovery; trust, validation, and traceability; human-AI teaming and paradigm shifts; and workforce, pedagogy, and governance. The report translates these themes into eight priorities for community action spanning shared research infrastructure, trust and traceability, user experience, human-AI teaming, workforce development, cross-sector coordination, stewardship and sustainability, and evaluation of scientific value. Together, these priorities outline directions for building scientific computing ecosystems that remain trustworthy, sustainable, innovative, and resilient as AI assumes a growing role in scientific work.

cs.CE↗
arXiv2026

Machine-learning-assisted multiscale topology optimization of functionally graded superimposed lattice structures

Functionally graded lattice structures enable lightweight designs with spatially tunable stiffness and density, but their use in multiscale topology optimization is limited by the cost of repeated computational homogenization. This work presents a machine learning-assisted multiscale optimization framework for regular superimposed lattice structures. The unit cell is formed by combining body-centered cubic, face-centered cubic, and simple cubic lattice components, each controlled by an independent geometric parameter. Offline computational homogenization is used to generate effective stiffness data, which are then used to train a Cholesky-constrained neural network surrogate. This representation reconstructs the homogenized stiffness tensor in a physically admissible form. A separate neural network is trained to predict relative density from Monte Carlo-based density estimates. We incorporate our surrogates into a two-stage topology optimization strategy. First, a macroscale topology is obtained using the solid isotropic material with penalization (SIMP) method. The resulting solid region is then used for microscale lattice optimization, where the local lattice parameters are updated using the method of moving asymptotes (MMA). The trained stiffness and density surrogates replace repeated online homogenization during this stage. The method is demonstrated on a three-dimensional Messerschmitt-Bölkow-Blohm (MBB) beam benchmark, producing spatially varying lattice parameters and relative density fields consistent with compliance minimization under a material constraint.

cs.CE↗
arXiv2026

Pragmatic Information, Computation, and the Efficient Market Hypothesis

We address a long standing gap in standard information theory, namely the inability of that theory to assign a measure to the amount of meaning in a transmitted message. \cite{Weinberger24} argues for a particular quantitative measure of meaning that \cite{Weinberger24} calls pragmatic information, which has many of the properties expected of it. We then prove that the amount of pragmatic information of a given message that can be extracted by a given receiver depends on the computational capacities of the receiver, in particular, the receiver's ability to recognize symbol strings at various levels of complexity within the Chomsky hierarchy of formal languages. A string may appear essentially random to a given receiver, but not to a receiver at a higher level in the hierarchy; hence, this receiver may not be able to extract any pragmatic information from such a string, even though another receiver at the appropriate level in the hierarchy could. Also, the maximum processing rates at which messages of different levels of complexity serve as a kind of pragmatic channel capacity, leading to a tradeoff between the amount of pragmatic information extracted and the extraction time. We then propose a re-framing of the efficient market hypothesis of quantitative finance to that of a participant-specific ``computational efficiency'', {\it i.e.} the claim that participants lack the computational resources necessary to use available pragmatic information to ``beat the market''. Given that market participants vary widely in computational resources, it is therefore no surprise some participants will find a given market computationally efficient, even though others will find inefficiencies. We argue that this situation will persist even in the face of any conceivable increase in compute.

cs.CE↗
arXiv2026

A priori Assessment of Tensor-Network Encoding for Isotropic Turbulent Flows

Tensor networks (TNs), originally developed for simulating many-body quantum systems, provide a systematic framework for approximating high-dimensional fields. This is achieved by factorizing the field into interconnected tensors with small bond dimensions, thereby restricting the correlations captured across field bipartitions. Belonging to the family of TNs, the matrix product state (MPS) ansatz is utilized here as a reduced-order modeling framework to construct truncated representations of isotropic turbulent flow data. Two direct numerical simulation (DNS) datasets are considered: the hydrodynamic field of an incompressible three-dimensional flow, and a conserved Fickian scalar in a similar flow. Each field is encoded as an MPS through a sequence of singular value decompositions (SVDs) in which small singular values are discarded. The truncated representation is contracted back to the full grid, and the resulting reconstructed field is compared against DNS. An interleaved ordering of the spatial tensor indices of the transport variables is applied prior to decomposition in order to localize the dominant inter-tensor correlations. Velocity reconstructions achieve $99.8\%$ fidelity using only $5\%$ of the original DNS memory, while the scalar field reaches the same fidelity at $15\%$ memory usage. A wide range of lower- and higher-order statistics, including velocity gradients, dissipation, and structure functions, are systematically examined. At these compression levels, the total kinetic energy and the scalar energy are both recovered within $0.2\%$ relative error, while the mean dissipation and mean scalar dissipation remain within approximately $10\%$ of the DNS generated values. These findings support the suitability of MPS for scalable reduced-order analysis of complex turbulent datasets and motivate further exploration of TN-based methods in computational turbulence.

physics.flu-dyn↗
arXiv2026

Dimension Bridging for 3D RANS with Neural Network Accelerated Gaussian Functional Regression

In many computational science and engineering problems, repeatedly solving fully resolved physics-based models to design for a quantity of interest (QoI) can quickly become intractable, requiring the use of low-fidelity models to predict the same QoI but introduce errors where some features are neglected or are otherwise inaccurately resolved. We use Gaussian Functional Regression (GFR) to learn a correction to a 2D Reynolds-Averaged Navier-Stokes (RANS) model to predict the aerodynamic coefficients from a 3D RANS model. This model pair has a disparity in the governing physics from the reduced dimensionality, a previously unexplored application for GFR. Empirically, our results show that with a proper choice of low-dimensional (LD) model, the proposed kernel allows for the use of fewer high-dimensional (HD) evaluations to regress a response surface to the same level of accuracy as standard stationary kernels. Moreover, the new kernel provides more informative uncertainty quantification, which we show is advantageous when used to drive an adaptive sampling algorithm. Finally, we propose a novel neural network accelerated kernel, which we show offers predictions in good agreement while speeding up evaluations by millions of times in wall clock measurements, bringing the computational budget within the real-time regime.

cs.CE↗
Compare source metadata on this page
WorkPublishedSource identifierSource
The PUR-1 Cyber-Physical Digital Twin2026-08-312608.30186arxiv
FaVOR: LLM-Based Agentic Framework for Factor Mining via Empirical Validation2026-08-312608.30192arxiv
Redefining Stablecoins from Nominal to Real Value: A Maximum Likelihood Approach2026-08-312608.30225arxiv
Efficient Parameter Calibration of Numerical Weather Prediction Models via Evolutionary Sequential Transfer Optimization2026-08-302601.08663arxiv
Frontiers in FinTech: Multimodal Foundation Models for Financial Reporting and Decision Science2026-08-302608.22724arxiv
QoI-Aware Provisional Rollout and Retrospective Reconciliation for Reduced-State Scientific Twins2026-08-302608.29633arxiv
OmniClimate-TC: Physics-Aware Visual Abstractions for Multimedia Reasoning over Tropical Cyclones2026-08-302608.29661arxiv
Intrinsic Finite Element Methods for Fluids on Riemannian Manifolds Compared with Surface FEM2026-08-302608.29754arxiv
Accelerated Patient-Specific Hemodynamic Simulations with Hybrid Physics-Based Neural Surrogates2026-08-292604.01549arxiv
Summoning the Oracle to Slay It: Mitigating Look-Ahead Bias in Financial Backtesting with Large Language Models2026-08-292605.24564arxiv
Refined Thompson Learning for Adaptive Bandits: Power-Efficient Flexibility Scheduling Across Data Centers2026-08-292608.00921arxiv
A Reduced Magnetic Vector Potential Approach with Higher-Order Splines2026-08-282602.22997arxiv
Report of the 2026 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science2026-08-282608.26519arxiv
Towards Stellarator Geometry Optimisation for Nuclear Fusion2026-08-282608.28224arxiv
Machine-learning-assisted multiscale topology optimization of functionally graded superimposed lattice structures2026-08-282608.28513arxiv
Pragmatic Information, Computation, and the Efficient Market Hypothesis2026-08-282608.28803arxiv
A priori Assessment of Tensor-Network Encoding for Isotropic Turbulent Flows2026-08-282608.28869arxiv
Dimension Bridging for 3D RANS with Neural Network Accelerated Gaussian Functional Regression2026-08-272608.27639arxiv

These are bibliographic comparisons, not experimental rankings. Follow the original document for methods and conditions.