跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+92新增 AI 导读

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

找到 266 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
新论文 · v1arXiv:2611.04707

Methodological Assessment of Instrumented Indentation for Spatially Resolved Mesoscale Stiffness and Creep in Short Fiber-Reinforced Injection-Molded PBT Components

Eduard Klatt, Natalie Rauter

原文摘要

Instrumented indentation enables assessment of local mechanical properties in heterogeneous polymer systems, but specimen preparation and the selected indentation protocol significantly influence the quantitative interpretation of the measured response. This study develops and evaluates an experimental methodology for spatially resolved mesoscale characterization of both unreinforced and short fiber-reinforced composites. An unreinforced material system is used as a reference material to systematically examine the effects of indentation spacing, surface preparation, maximum indentation load, temporal loading parameters, and unloading evaluation. Indentation loads of 500, 1000, and 1750 mN are investigated in complementary experimental campaigns. The apparent indentation modulus exhibits moderate sensitivity to indentation load and loading time within the studied ranges. In contrast, indentation depth and the creep-related depth increment display greater sensitivity to the applied load history. Surface polishing minimizes topographical disturbances and enables reliable identification of residual indentation profiles and pile-up. Based on these methodological findings, a final load-hold-unload protocol with an indentation load of 1750 mN, a loading time of 6 s, a holding period of 300 s, and an unloading time of 4 s is applied to both unreinforced material and short fiber-reinforced composites. The mean apparent indentation modulus increases from 2.91 GPa for unreinforced material to 6.65 GPa for short fiber-reinforced composites, while the mean depth of indentation creep decreases from 2.36 to 1.91 microns. The coefficient of variation also increases for both quantities, indicating that short-fiber reinforcement enhances mean local stiffness and introduces pronounced spatial heterogeneity in both stiffness-related and time-dependent mesoscale indentation responses.

cs.CE · cond-mat.mtrl-sci

新论文 · v1arXiv:2611.04642

Stabilizing Neural Emulation of Spatiotemporal Physical Dynamics through Denoising Koopman Latent Dynamics

Chenxu Wu, Sixing Chen, Junming Hou, Jiahan Huang, Jianqiao Zeng, Peiming Luo, Liang Yan, Jian Wei You

原文摘要

Koopman operator theory provides a principled framework for reduced-order modeling of nonlinear spatiotemporal dynamics through linear evolution in an observable space. In practice, however, learned finite-dimensional representations are typically approximately invariant, causing unresolved dynamics and accumulated closure errors. Recent approaches, inspired by the Mori-Zwanzig formalism, address these effects through deterministic memory or closure modeling, yet robust extrapolation beyond the training horizon remains challenging. Here, we propose KoopFlow, an efficient prediction-correction framework based on the key insight that finite-dimensional Koopman error accumulation can be reinterpreted as a progressive distributional degradation process. Accordingly, KoopFlow treats Koopman predictions as noisy intermediate estimates, which are then transported toward the target latent distribution through a generative model, thereby mitigating accumulated errors while retaining computational efficiency and temporal flexibility. Moreover, we reveal a non-monotonic relationship between Koopman spectral coherence and predictive accuracy. Experiments across diverse nonlinear dynamical systems demonstrate improved long-horizon prediction accuracy and stability over representative baselines, particularly beyond the training horizon.

cs.CE

新论文 · v1arXiv:2611.04563

Optimized size, shape and orientation of rhombic transposition flaps and excisions by gradient-based methods

Niels Aage, Brandon Marshal Parks

原文摘要

This work presents a new method for gradient-based optimization of the rhombic transposition flap and the excision it closes, which set the strain of the skin after closure. Previous studies swept at most three parameters. Here, using structural optimization methods, up to eight variables, two flap angles, two cut lengths and the size, shape and position of the rhombic excision, are optimized under up to 32 geometric and stress constraints. The skin is a pre-stretched, incompressible hyperelastic membrane that wrinkles instead of carrying compression. Smoothed level-sets on a fixed grid represent the cuts, and springs between interpolated points the sutures, so designs change without remeshing and the adjoint method gives the sensitivities. The energy the surgery adds to the skin is minimized, and the model reproduces the energies of a published 48-design sweep with a median deviation of 5%. The optimal flap angles, $(-23^\circ, 31^\circ)$, lie outside the swept range and add 63% less energy than the Limberg flap and 15% less than the best swept design. Under unequal in-vivo tension, the optimal flap turns with the direction of the tension. Fitting the excision to the lesion and its margin lowers the energy by a further 35%, and with all eight variables it is 78% below the Limberg flap. This optimum is the same for finer grids, narrower cuts and wider undermining, although wider undermining reduces its gain. Lowering its suture-line stress by 41% costs only 2.3% more energy.

cs.CE · physics.med-ph

新论文 · v1arXiv:2611.04508

Theory-guided relational learning for data product pricing: An interpretable meta-path-guided graph neural network approach

Ruize Gao, Feng Xiao, Jinpu Li, Ke Tang, Shaoze Cui

原文摘要

Data products are non-standardized and context-dependent, so their prices are jointly shaped by product attributes and contextual factors such as provider reputation, product comparability, and industry structure. We formulate data product pricing as a learning task over a heterogeneous information network spanning data products, providers, marketplaces, industries, and pricing modes, and design theory-grounded meta-paths, brand-based, similarity-based, industry-based, and hybrid, to characterize distinct pricing mechanisms. Building on this network, we propose a Meta-Path-Guided Heterogeneous Graph Neural Network (MPGNN), which learns path-specific representations, fuses them through an attention-based gate, and is further augmented with large language model-generated textual features. Empirical evaluation shows that MPGNN achieves statistically significant improvements over baseline models in both regression and classification across different pricing modes, and that provider-involving meta-paths dominate the learned weights, yielding predictive evidence consistent with a brand-equity-related pricing mechanism. The proposed framework combines predictive accuracy with theory-driven interpretability, offering a transferable methodological template for pricing other non-standardized digital assets.

cs.CE

新论文 · v1arXiv:2611.04375

LLM-Generated Investment Research Memos Need Validation

Xukang Gong, Chenri Luo, Binyan Yu, Xiao-Yang Liu

原文摘要

LLMs are increasingly adopted to draft long-form investment research memos, but their reliability is judged claim by claim, while readers read each memo as a whole. In this paper, we show that a low claim-level error rate does not necessarily mean that a memo is reliable: even with a refutation rate of just 1-2%, roughly four in ten memos contain at least one claim contradicted by official filings. First, we generate 1,440 memos with four recent LLM-powered agents for 30 companies over 12 quarters, decompose them into 77,272 financial claims, and verify each against the same official source bundle by retrieving evidence, matching it to the claim, and verifying the outcome. Second, we find that only 1.17-1.77% of claims are refuted, yet 36.94-41.11% of memos contain at least one refuted claim, and agents differ in severity: Codex has the lowest memo-level rate; a qualitative review further groups errors into four patterns (time, unit, context, concept).

cs.CE

版本更新 · v3arXiv:2506.04235

A Comprehensive Benchmark of Computational Models for Antibody--Antigen Binding Affinity

Xinyan Zhao, Yi-Ching Tang, Victor J Cantu, Junseok Lee, Adam E Stogsdill, Ibraheem M Hamdi, Ashwin Kumar Ramesh, Zhiqiang An 等 10 位作者

原文摘要

Computational antibody design requires benchmarks that measure functional binding rather than similarity to natural sequences. Here we present AbBiBench, which treats the antibody--antigen complex as the evaluation unit and harmonizes 216,560 experimental measurements spanning 13 antibodies and 9 antigens. We compare 20 computational approaches without task-specific training or fine-tuning. The analyses show that global structure-conditioned inverse folding yields the strongest and most consistent affinity rankings, whereas antibody-specific fine-tuning does not consistently improve performance. Across models, rankings are more useful for prioritizing likely affinity gains than for excluding weak variants. In a subsequent case study, multi-objective evaluation of model-generated F045-092 CDR-H3 variants for H1N1 binding revealed a trade-off between predicted binding potential and evolutionary sequence plausibility; all 21 selected candidates produced H1-reactive ELISA signals. AbBiBench provides an open framework for developing and evaluating function-aware antibody design methods.

q-bio.QM · cs.AI · cs.CE · cs.LG · q-bio.BM

版本更新 · v2arXiv:2606.16219

Sparse stochastic digital twins can outperform exact ones

Zongren Zou, Théo Bourdais, Ricardo Baptista, Houman Owhadi

原文摘要

Digital twins are often built under the assumption that greater model fidelity leads to better downstream performance. We show that this is not always the case: retaining weakly dependent or auxiliary degrees of freedom can increase the dimensionality of learning and control problems enough that a sparse stochastic surrogate outperforms even an exact high-dimensional model. To identify such structure, we introduce a framework for dependence discovery directly at the level of the full conditional law. The method combines conditional generative modeling with Gaussian-process distillation and kernel mode decomposition to quantify how strongly individual variables enter the conditional distribution, including through variability, tails, multimodality, and other features invisible to the conditional mean. The resulting dependence structure can be used both to construct sparse stochastic digital twins from data and to reduce known high-dimensional models for downstream tasks. In a modified Lunar Lander problem, an eight-dimensional sparse surrogate yields better control performance than the exact 109-dimensional simulator despite lower transition fidelity. A stochastic heat-equation example shows that the framework recovers sparse structure in a 102-dimensional data-driven setting and produces a more effective surrogate than one conditioned on all candidate inputs, while economic data demonstrate its use for identifying time-varying memory structure. These results show that model fidelity and downstream utility are distinct objectives, and that dependence discovery provides a practical route to sparse stochastic digital twins.

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

新论文 · v1arXiv:2611.04077

From topology-optimization brief to solver-checked release: separating intent, admissibility and acceptance knowledge for language agents

Shaoliang Yang, Jun Wang

原文摘要

An engineering solver can converge even when a language agent has misread the user's problem. AgenticTO makes this distinction inspectable by keeping three records separate: the proposed problem specification, deterministic formulation checks, and numerical acceptance of the solved design. We evaluated the workflow on 50 author-built topology-optimization briefs, injected faults, five numerical problems, and complete agent sessions. The tests used linear-elastic models with one load case. Geometry tools raised the primary provider's correct specifications and refusals from 37 to 44 of 50, while also increasing wrong specifications delivered as finished. Input-format feedback alone recovered most of the accuracy gain. The wrong specifications passed the formulation rules, which also missed most injected faults that changed the intended problem. Clarification corrected the remaining errors when an oracle supplied reference facts, but also prompted questions on fully specified briefs. Perfect accuracy under that oracle therefore does not establish performance with engineers. Numerical trials reached 73.7 million elements, although released designs used finer grids than requested. The records expose how a proposed problem becomes an accepted numerical result; agreement with the brief still needs a separate judgment.

cs.CE

版本更新 · v4arXiv:2406.08375

Methods for Accelerating and Stabilizing Nonlinear Magnetic Equivalent-Circuit Analysis

Danial Kazemikia, Matthew Gardner

原文摘要

Design and optimization of electromagnetic devices require models that converge reliably and quickly and can represent intense localized magnetic saturation. This paper presents a parameterized 2D nonlinear magnetic equivalent circuit (MEC) and proposes solution methods for it: an approximate Jacobian that is symmetric positive definite, so each Newton-Raphson iteration can use sparse Cholesky factorization with fill-reducing reordering, and Anderson mixing as step control. These methods are compared with alternative nonlinear iterations, linear solvers, and step-control methods in convergence, computational cost, and prediction accuracy. Radial-flux magnetic gears (RFMGs) with structural bridges serve as a challenging test case, because their thin bridges exhibit intense local saturation. The methods are evaluated on three bridged base designs and on 1,024 bridged designs, each paired with the same design without the bridge. On the base designs, Newton-Raphson iteration with the approximate Jacobian reached much lower residuals than fixed-point iteration, which converged for none of them. Sparse Cholesky factorization with reordering was the fastest linear solver tested. Across the 1,024 design pairs, full-step Newton-Raphson converged for 193 bridged and 564 bridge-free designs, whereas Anderson mixing converged for 1,003 and 1,022 and required fewer iterations. Bridged designs converged less often and more slowly under every method. The nonlinear MEC was 2.17 and 1.84 times faster than fixed-mesh nonlinear finite element analysis (FEA) in total computation time for the bridged and bridge-free populations. The median outer-rotor torque discrepancy relative to FEA was 0.22%, and the Spearman rank correlations of the design rankings were at least 0.9996.

eess.SY · cs.CE

新论文 · v1arXiv:2611.04007

Physics-Informed Identification of Tensegrity Prestress across Taut-Slack Transitions

Sandesh Lamsal, Sumit Kumar, Rubi Bhandari, Subhamoy Sen, Andrzej Rutkiewicz, Leszek Małyszko, Landolf Rhode-Barbarigos

原文摘要

Prestress governs the stability, stiffness, and dynamic behavior of tensegrity structures, but it is not directly observable from sparse structural measurements, and it may decrease during service life. Under strong excitation, the cables may slacken and the dynamics become nonsmooth. Existing identification methods are limited to the taut regime, and physics-informed networks for tensegrities solve only the forward problem of predicting the response from known member parameters. This study formulates the inverse problem. Neural networks are trained on the equation-of-motion residual in constrained Cartesian coordinates, where the mass matrix is constant and the force densities enter linearly. The force densities, damping, and axial stiffness are trainable parameters, and the tension-only cable law is kept. A Fisher-information analysis shows, before inversion, which member parameters a record can determine. The method is tested on simulated planar tensegrity frames with up to five modules and a three-dimensional prism, and on measured records of a biomimetic leg and a full-scale tensegrity simplex. On the one-module frame, the identifiable force densities are recovered within 1.5% from noisy accelerations at half the free coordinates, on records with and without taut-slack transitions. Records with transitions determine members that taut records leave undetermined. On the five-module frame, a 16-cable two-span bridge, the median force-density error rises moderately, to 4.2%. On measured records, an identified spring stiffness is within 0.1% of its independently measured value on average, and the identified simplex prestress at 13 levels agrees with its cable force transducers to 2.9% root-mean-square.

cs.LG · cs.CE · eess.SP · physics.flu-dyn

新论文 · v1arXiv:2611.03974

Gather or Act? Belief-Level Counterfactual Labels for Deadline-Aware Incident Response in Cyber-Physical Systems

Ali Mohammadi Ruzbahani

原文摘要

When an industrial control system misbehaves, the defender often must choose between acting now on the most likely cause and first gathering evidence that separates two look-alike causes, while the process drifts toward a shutdown. Learning or evaluating such decisions requires the cost of every candidate action from the same situation, which no public cyber-physical security dataset provides. We present TE-GvA, a counterfactual decision dataset for fault-driven incident response on the revised Tennessee Eastman process, with 9,908 decision points from 1,990 simulated incidents, each with 4 to 35 candidate actions labelled by branched rollouts with common random numbers. Labels computed under the true hidden cause (hindsight labels) make gathering the best choice in only 1.1-1.3% of decisions. For the dominant look-alike pair, a failed network link versus a frozen I/O module, we add pair-conditioned belief labels from twin episodes that replay the defender's history under the other cause, weighted by the exact posterior. With them, gathering is best in 15.5% of ambiguous natural decisions and in 33.1% of ambiguous stress decisions without a backup channel. When the posterior is correct and the twin is faithful, belief labels have the same regression target as hindsight labels and lower variance. In a pre-specified, single-look test evaluation, a gradient-boosted rule trained on belief labels has 11% lower regret on the stress set than the same rule trained on hindsight labels, and 27% lower regret on ambiguous stress decisions without a backup channel, which remains significant after Holm correction. With a backup channel and in the natural distribution, the two label sets perform about the same. Soft labels tolerate moderate posterior errors, whereas hard labels that commit to one cause do worse than hindsight labels.

cs.CE · cs.CR

新论文 · v1arXiv:2611.03963

ProteoCraft: Protein Design as Proposal-Verification Search

Fang Wu, Hongbin Lin, Bingchen Duan, Yuchen Wang, Li Erran Li, Yanjie Huang, Mingxuan Cao, Yijun Ma 等 27 位作者

原文摘要

Protein-protein interactions underpin nearly all biological processes. Yet, designing proteins with desired interactions remains challenging due to the structural complexity governing molecular recognition. This study views protein design as a search optimization problem over a combinatorial sequence space under expensive structural evaluation. Toward this goal, we introduce a novel tree-based search framework, ProteoCraft, that employs approximate structural gradients from diffusion-based structure predictors as effective proposal policies to specify where the search should explore. Complete no-gradient inference of folding models separately assigns values to the resulting sequences, determining what is good. ProteoCraft allocates this verification budget through a coarse-to-fine paradigm: multi-site edits first explore distinct sequence basins, then verified promising states undergo strict single-site refinement. Across fourteen de novo binder-design settings spanning eight target proteins, five immune-relevant TCR-facing targets, and four localized CDR redesign tasks, ProteoCraft improves design quality and high-confidence yield. These improvements persist under independent AF2-IG and Rosetta-based interface evaluation. Prospective experimental validation further yielded an 82.9% binding hit rate for PD-L1 miniproteins, with a best measured KD of 0.879 nM, and confirmed binding of designed IFNAR2 VHH. Our code is available at https://github.com/smiles724/ProteoCraft_v1.

cs.CE · cs.AI · q-bio.BM

新论文 · v1arXiv:2611.03892

Isothermal-Isobaric Molecular Dynamics with a Foundation Interatomic Potential in LAMMPS across NVIDIA and Intel GPUs

Xiaoli Yan, Eliu Huerta

原文摘要

Foundation machine-learning interatomic potentials (MLIPs) offer one model for many chemistries, but their deep, globally coupled architectures do not fit the spatial decomposition that scales classical and short-ranged MLIPs. We present pair_style uma, a LAMMPS pair style that evaluates the Universal Model for Atoms (UMA) through LibTorch on NVIDIA and Intel GPUs from a single source tree. It reimplements FairChem's edge-sharded graph parallelism in C++ over exported TorchScript modules, with one MPI rank per device, NCCL or oneCCL collectives, and the whole energy and force path in double precision. The strain-gradient virial is carried through the exported modules and the cross-device reductions, so that fix npt runs on both vendors' hardware. We measure NPT capacity and cost on one 4xA100-40GB node, one 8xH200 node, and one 12-tile Intel node, and on up to 32 Intel nodes. Without activation checkpointing, one node holds NaCl cells of about 8,000 atoms (A100, 0.21 ns/day), 22,000 atoms (Intel, 0.10 ns/day), and 47,000 atoms (H200, 0.16 ns/day). Graph parallelism raises the capacity of a single device by 8.0x on H200 and 4.6x on A100. Across nodes, capacity grows to about 779,000 atoms on 32 Intel nodes, with a slower speed at 0.007 ns/day. On H200 and A100, a FLOP count of FairChem's graph-parallel predictor gives lower bounds of 31% and 51% of FP64 peak. From one omat checkpoint and with no refit, nine 100 ps NPT heating ramps (NaCl, equiatomic Pt-Ru, and equiatomic (HfNbTaTiZr)N, on all three node types) ran to completion.

physics.chem-ph · cs.CE

新论文 · v1arXiv:2611.03588

3D-BBDA: Backpropagation-Free Black-Box Domain Adaptation for Robust 3D Point Cloud Recognition

Shivangi Rai, Kunal Jangid, Vaibhav Kumar, Vinod K Kurmi

原文摘要

Robust 3D point-cloud recognition is critical for robotics, mapping, and urban sensing, yet point-cloud classifiers often suffer performance drops under domain shifts caused by sensor changes, environmental variation, and acquisition artifacts. Many existing adaptation methods are difficult to deploy in practice because they require access to source data or the internal parameters of the source model, which may be restricted by privacy, licensing, or security constraints. We present 3D-BBDA, a backpropagation-free black-box domain adaptation framework that adapts a source-trained predictor to unlabeled target data using only black-box outputs. Our method performs pseudo-label guided prototype-based alignment and employs a weighted prediction module to fuse source logits with alignment logits, reducing sensitivity to noisy pseudo-labels. To stabilize prototype memory when pseudo-label coverage is incomplete, we construct a Gaussian-perturbed prototype prior from unlabeled target predictions and use it as a fallback for missing or unreliable class prototypes during alignment. Experiments on four corrupted 3D benchmarks demonstrate consistent improvements over strong baselines. On ModelNet-40C, 3D-BBDA achieves mean errors of 32.08% (PointNet) and 29.62% (GDANet), outperforming Source-only (35.88% / 34.03%) and BFTT3D (33.78% / 32.36%). 3D-BBDA requires only a single forward pass with no gradient updates making it suitable for real-time, privacy-preserving deployment in transferable 3D recognition pipelines. Project page is available at https://visdomlab.github.io/3D_BBDA

cs.CV · cs.CE · cs.RO

新论文 · v1arXiv:2611.03473

Fracture-Bench: A Controlled Benchmark Suite for Machine Learning Surrogates in Phase-Field Fracture Mechanics

Meenu Krishnan U., Maryam Hakimzadeh, Indrashish Saha, Meer Mehran Rashid, Lori Graham-Brady, Somdatta Goswami

原文摘要

Machine-learning surrogates are increasingly proposed to replace phase-field fracture simulations in many-query tasks such as uncertainty quantification, inverse analysis and design. Little controlled evidence shows which architectures are reliable, for which fracture problems and how far beyond their training data. We introduce Fracture-Bench, an open benchmark of two phase-field datasets with fixed splits, common test metrics and a description of each dataset's physical regime. Dataset~1 contains 1,000 AT2 simulations of multiple cracks growing from a notched hole in a hyperelastic plate under random non-uniform biaxial boundary displacements (44 load steps, $128\times128$ grid). Dataset~2 contains 4,000 PF-CZM simulations of a pre-cracked plate with two inclusions, each ten times stiffer or more compliant than the matrix ($128\times256$ grid). We train a Fourier neural operator (FNO), DeepONet, Latent DeepONet, a UNet and a conditional diffusion model on identical splits and compare one test metric per dataset, training time, inference time and model size. On Dataset~1, FNO and Latent DeepONet attain mean test errors of order $10^{-6}$, about ten times lower than UNet and DeepONet. On Dataset~2, the diffusion model is most accurate, with about one sixth of the UNet error, but requires \SI{706}{s} per prediction versus \SI{6}{ms} for UNet. For all architectures, most of the error occurs in the final load steps, after crack localization. Dataset~2 contains initial cracks less than one grid cell apart that produce qualitatively different paths. Architecture rankings therefore depend on the task, and errors averaged over densely sampled inputs reveal little about near-bifurcation cases. Data, codes, splits, regime descriptors and generalization splits are public, with a protocol for adding under-represented regimes such as mixed-mode, three-dimensional and experimentally paired fracture.

physics.comp-ph · cs.CE

新论文 · v1arXiv:2611.03154

PaddleMaterials: An End-to-End Deep Learning Toolkit for Materials Science

Xuwei Liu, Zhimin Zhang, Xiaoguang Hu, Zhongwei Liu, Yuanhui Sun, Jun Huo, Hua Wu, Haifeng Wang

原文摘要

Machine learning supports materials design, atomistic simulation and experimental characterization, yet models and workflows remain fragmented. We present PaddleMaterials, an open-source framework integrating heterogeneous materials-learning tasks while preserving task-specific representations and scientific semantics. It unifies data processing, training, evaluation, pretrained-model management and workflows across six task classes: property prediction, structure generation, machine-learning interatomic potentials, electronic-structure fields, spectrum elucidation and microscopy image processing. Task interfaces record physical quantities, units, aggregation conventions and references, making cross-task composition verifiable. A shared compiler backend enables switching from dynamic-graph to compiled execution through one setting, using graph optimization, operator fusion and hardware-targeted code generation without changing model definitions. Across 65 model instances in 11 groups, compiled execution accelerated every instance in eight groups, with group median speedups of 11%-224% and group maximum speedups of 11%-336%. Case studies on LiMnO2 and toluene link structure generation or spectrum elucidation, interatomic-potential relaxation, property prediction and electron-density prediction, using same-geometry density functional theory (DFT) calculations as references. For LiMnO2, predicted formation energies for generated and relaxed structures differed from same-geometry PBE+U references by at most 7 meV per atom, while the computational cost of model steps was less than one-twentieth of a DFT single-point calculation. PaddleMaterials extends unified materials workflows beyond conventional property, potential and structure-generation tasks while supporting verifiable cross-task operations and compiled execution.

cs.LG · cond-mat.mtrl-sci · cs.CE

新论文 · v1arXiv:2611.03117

Inner optimizers in active-learning Kriging reliability analysis: a pre-specified comparison and the unconservative estimates left by unlearned failure modes

Wei-Chang Yeh

原文摘要

Active-learning Kriging often replaces candidate pools by continuous metaheuristic search. A pre-specified comparison sharing surrogate, population and stopping rule isolated this inner optimizer: five budget-matched continuous optimizers, including hybrid swarm optimization with L-BFGS-B polishing, against candidate pools on eleven problems (dimension 2 to 100). The primary hypothesis was not supported: against optimizers sharing its criterion the hybrid won 6, tied 41 and lost 19 of 66 Holm-corrected accuracy comparisons, and against pool methods 0, 23 and 21 of 44. With sequential selection on three series systems, multistart L-BFGS-B left a failure mode unlearned in 59 of 60 runs, more often than swarm, genetic-algorithm or AK-MCS. In all 198 runs (22 post-freeze) with an unlearned mode, the learned modes did not compensate and failure probability was underestimated (exploratory). The error criterion can accept substantial underestimation: it accepted 17 runs (13 pool-selected) at 0.38 to 0.89 of the reference; 181 exhausted the budget. Follow-up analyses on single-design-point problems indicate underestimation when selections concentrate near the design point. Kriging-believer pool selection satisfied the surrogate stopping criterion with fewer calls than the best continuous method in all four informative batch cells (two post-freeze). We recommend default pool selection and coverage checks for any selection.

cs.CE · cs.LG

新论文 · v1arXiv:2611.03022

Interpretable Allocation and Model-Predictive Rebalancing of Equity Portfolios, Tested on Real and Synthetic Markets

Jeffrey D. Varner

原文摘要

A live equity portfolio poses three problems: which stocks to hold, when to trade, and whether the strategy holds up beyond the observed market. We built one system for all three and tested it on 373 US equities, calibrated on 2014-2024 and traded from January 2025 to September 2026. A selection rule chose stocks by score, by a bandit, or at random, and one of seven weighting rules, four consumer-theory utilities, and three standard portfolios, set share counts under limits on budget, single-stock weight, portfolio volatility, and turnover, with each stock's preference weight a bounded score of its trend, market beta, and the market's recent direction. A model-predictive controller forecasts portfolio value with a multi-asset geometric Brownian motion and re-planned at its horizon, when the value left its forecast band, or at a drawdown stop. To probe deeper declines than the real window held, we also ran the system on simulated markets from per-asset hidden Markov generators with jumps, linked by market and sector factors. On real prices, the stocks chosen mattered more to terminal wealth than the weighting rule, and the early re-plans shrank the worst drawdown in most rule combinations against a fixed calendar without consistently raising wealth. In the deepest simulated declines, every combination, random picks included, ended above simulated SPY and the equal-weight universe in the median, even without early re-plans, so the margin came from shared parts of the system, not from stock selection or re-plan timing. A market hedge that tightened a beta cap as the market weakened cost wealth on real prices but paid off in the most sustained simulated declines, and the generator's persistent trends favored score-based selection more than the real market did, which suggests a synthetic test judges stock selection fairly only if its generator does not build in that persistence.

q-fin.PM · cs.CE · q-fin.RM

版本更新 · v3arXiv:2609.31972

TaiJi: State-Conditional Adaptive Combination of Machine-Learning and Physics-Based Global Weather Forecasts

Jiale Wang, Yining Li, Guihua Wang

原文摘要

Machine-learning weather models now rival or surpass operational numerical weather prediction (NWP), yet no single model dominates across variables, pressure levels, lead times, or regions, and the returns from ever-larger individual models are diminishing. We present TaiJi (after the yin-yang concept of complementary opposites), a spatiotemporal adaptive ensemble framework that recasts optimal model-weight combination as a learned prediction problem: a lightweight convolutional neural network, conditioned on the recent atmospheric state, predicts at every grid point and lead time affine combination weights and an additive residual for the constituent forecasts. The combiner is trained end-to-end over Pangu-Weather, GraphCast, FuXi, IFS-HRES, and the IFS-ENS ensemble mean, a hybrid set of ML and NWP constituents, at less than a tenth of the cost of training any of its ML constituents. Under the WeatherBench 2 protocol (2020 test year), TaiJi outperforms the strongest baseline in nearly every combination of the eight core variables, lead times up to 10 days and two skill metrics (RMSE and ACC), and this advantage extends to heavy-precipitation extremes. The same state-conditional principle transfers to tropical-cyclone track forecasting: by fusing constituent tracks rather than gridded fields, TaiJi-TC reduces track error relative to the equally weighted multi-model consensus at lead times up to 96 h, by about 10% at 36 h, halves the slow along-track bias shared by all constituents up to 60 h, and lowers landfall position error by 13-15% at 60-84 h. The learned weights vary coherently with latitude, season and lead time rather than following a fixed rule. TaiJi thus offers an inexpensive route to better global forecasts that builds on, rather than replaces, existing forecast models.

cs.CE

新论文 · v1arXiv:2611.02837

Green Composites for Safer and Durable Water Pipelines

Djebbara Benzerga, Faycal Sotehi, Adel Chouiter, Abdelkader Haddi, Nahla Benzerga

原文摘要

The intensifying water shortage in Algeria makes clear the need of novel, sustainable strategies to protect distribution networks. Current infrastructure struggles with frequent failures, particularly leaks stemming from corrosion or handling damage during transport and installation. High-density polyethylene (HDPE) has become a material of choice because it handles these challenges well; it is cost-efficient, flexible, and tough enough to withstand harsh environments.This work investigates the failure risks of HDPE pipelines manufactured by ITP Alg{é}rie -- Innovation Transformation Polym{è}re. Mechanical tests were performed on HDPE 100 to determine its fundamental properties, including burst tests under internal pressure and load/unload experiments aimed at establishing a material-specific damage law revealed the dominant degradation mechanisms that occur under different operational and environmental conditions. Based on these findings, a predictive numerical model was developed to simulate damage progression and anticipate potential failures in service. This study introduces a unique hybrid composite patch designed for the precise rehabilitation of compromised pipeline sections. It shows strong promise for rebuilding the mechanical integrity of pipes, which is vital for maintaining a safe and long-lasting drinking water supply.

cs.CE

版本更新 · v2arXiv:2610.38367

Solution Strategies for Dissolution-Driven Phase-Field Fracture in Geomaterials

Maithah M. Alaleeli, Mohamed Elkhodbia, Mostafa E. Mobasher

原文摘要

Dissolution-driven fracture governs the long-term integrity of geological CO2 storage, geothermal reservoirs, and nuclear waste repositories. Modeling it requires solving strongly coupled mechanical, chemical, and phase-field equations. The solver choice controls their accuracy, cost, and convergence. This study investigates the role of solution strategies in dissolution-driven fracture in geomaterials. The coupled model is implemented in Abaqus user-element (UEL) subroutines, with all tangent blocks derived analytically. Five solvers are compared: (1) block-diagonal Newton monolithic, (2) BFGS quasi-Newton monolithic, (3) single-pass fully staggered, (4) single-pass partially staggered, and (5) hybrid multi-pass fully staggered. Performance is quantified by accuracy (errors in peak load, peak and failure displacements, and local CO2 concentration), cost (CPU and wall-clock times), and robustness, measured by new factors that assess convergence over the whole simulation and capture iteration spikes. The solvers are tested on mechanical and chemo-mechanical tension, shear, and multiple-crack benchmarks, including CO2 diffusivities raised up to a thousandfold. The results reveal a clear trade-off between accuracy, cost, and robustness. The quasi-Newton solver matches the Newton reference at a fraction of its cost but can fail under intense transport. The single-pass fully staggered solver is inexpensive and always completes, but its post-peak response depends strongly on the time step. The hybrid multi-pass solver also always completes, retains near-reference accuracy, and avoids iteration spikes at moderate cost. The partially staggered solver is the least robust. These findings guide practical selection: the single-pass staggered solver suits rapid screening, quasi-Newton offers accuracy when convergent, and hybrid multi-pass provides the best balance.

cs.CE

新论文 · v1arXiv:2611.02616

Herding or Racing? Decomposing Cross-Account Order-Flow Persistence in On-Chain Markets

Yichong Bai, Dingyue Kan

原文摘要

Most of the autocorrelation in trade signs on decentralized exchanges comes from pairs of trades sent by different wallets. For Uniswap v3, this has been read as herding dominating order splitting -- the reverse of what equity markets show. We show that this herding share mixes two quantities: the probability $p$ that consecutive orders come from the same account, which is small when thousands of wallets are trading, and the ratio $κ$ of cross-account to same-account sign correlation. For any $p$, $κ$ equals one under the public-signal benchmark of Tóth et al. and zero under independent order splitting. On Uniswap v3 USDC-WETH (one week each in 2023 and 2024), the herding share is 0.65-0.86, but $κ$ is only 0.05-0.10. On a fully on-chain EVM limit order book, the herding share is similar (0.61-0.87), but $κ$ is 0.72-0.76; among Uniswap swaps above USD 100k, it is 0.34-0.52. Where $κ$ is high, cross-account co-movement is mostly a race for the price on a centralized exchange. It is concentrated in orders a few blocks apart, and a cross-fitted gradient-boosted filter that sees only Binance data removes about three quarters or more of it. This race flow accounts for most of the losses of liquidity providers. We recommend reporting $κ$ alongside the herding share and modeling on-chain order flow as splitting traders plus arbitrageurs who respond to the centralized-exchange price.

cs.CE · q-fin.CP

新论文 · v1arXiv:2611.02584

Data-driven candidate structure ensemble generation beyond the convex hull with crystALL approach

Adam M. Krajewski, Ricardo Amaral, Jonathan W. Siegel, Luke A. Myers, Rushi Gong, Shun-Li Shang, Zi-Kui Liu

原文摘要

Real materials consist of multiple stable or metastable states under real-world conditions, existing as statistical ergodic ensembles of configurations rather than ideal crystals. Yet, data-driven computational materials discovery increasingly biases itself toward finding "new stable structures" from ground-state DFT calculations alone. This limits our long-term ability to discover materials whose properties emerge from metastable phases, to explain experimental observations, or to model thermodynamic behavior comprehensively. Predicting ergodic sets of atomic configurations of known and hypothetical solids is a fundamental challenge in theoretical crystallography, approached via many complementary methods. We discuss this conceptually and introduce crystALL, a pragmatic and powerful data-driven approach to discovering ensembles beyond the convex hull, embracing structural diversity over stability alone, enabling robust experiment matching in cases evading traditional methods. crystALL leverages 5 million relaxed structures from OPTIMADE and MPDD to rapidly generate a comprehensive candidate set by: (1) species substitutions; (2) ML feature-space analysis with pySIPFENN; (3) representative structure selection via clustering and energy-minimization or property matching; and (4) construction of the final candidate ensemble for experimental or ab initio validation. We also uniquely address the common challenge of experimental composition uncertainties spanning many integer stoichiometries by new efficient searches across anonymized compositional ranges rather than fixed formulas. Overall, crystALL's ensemble-focused philosophy provides critical advantages over the prevailing convex-hull-searching paradigm, which often fails to account for key experimental observations and increases AI/ML discovery bias over time - akin to model collapse in LLMs retrained on iteratively generated content.

cond-mat.mtrl-sci · cs.CE

版本更新 · v5arXiv:2603.06082

Offline Materials Optimization with CliqueFlowmer

Jakub Grudzien Kuba, Benjamin Kurt Miller, Sergey Levine, Pieter Abbeel

原文摘要

Recent advances in deep learning inspired neural network-based approaches to computational materials discovery (CMD). A plethora of problems in this field involve finding materials that optimize a target property. Nevertheless, the increasingly popular generative modeling methods are ineffective at boldly exploring attractive regions of the materials space due to their maximum likelihood training. In this work, we offer an alternative CMD technique based on offline model-based optimization (MBO) that fuses direct optimization of a target material property into generation. To that end, we introduce a domain-specific model, dubbed CliqueFlowmer, that incorporates recent advances of clique-based MBO into transformer and flow generation. We validate this model's optimization abilities and show that materials it produces strongly outperform those from generative baselines. To support specialized materials discovery applications and broader interdisciplinary research, we release our code (https://github.com/znowu/CliqueFlowmer), model weights (https://huggingface.co/iamkuba/CliqueFlowmer), and an interactive demo (https://cliqueflowmer.znowu.workers.dev).

cs.AI · cs.CE

新论文 · v1arXiv:2611.02530

AMLBench: A Real-Incident Benchmark for Agentic Blockchain Anti-Money Laundering

Qishuang Fu, Hang Zheng, Yuchen Lei, Yuexin Xiang, Qin Wang, Yuanzhe Zhang, Shiping Chen, Andreas Deppeler 等 11 位作者

原文摘要

Tracing illicit funds on public blockchains remains largely manual. As funds move across accounts and undergo asset conversions, they become mixed with other inflows, requiring repeated queries and expert judgment to trace. Large language model (LLM) agents offer a way to automate this process, but their ability to reconstruct case-related transfer networks from limited clues remains unclear. To bridge this gap, we present AMLBench, an anti-money laundering (AML) benchmark built from 24 real-world cases and 5.05 million Ethereum transfer records. For each case, agents start from limited clues and explore these transfer records through composable transaction-query and fund-flow analysis tools, deciding which accounts and branches to pursue. The final tracing results are evaluated against case annotations, while tool interaction logs reveal how agents discover and select relevant transfers and at what resource cost. We also develop AMLAgent, which integrates fund-tracing guidance and query feedback to dynamically guide investigative decisions. With GPT-6 Astra, AMLAgent achieves macro averages of 80.82% transfer-level precision and 84.73% query coverage across 24 real-world cases. Further analysis of the large-scale Bybit case reveals substantial differences in transfer retention and token usage across models, even with similar submission precision. AMLBench establishes a reproducible benchmark for evaluating both tracing outcomes and investigative processes, laying the groundwork for more reliable and efficient autonomous AML investigations.

cs.CE

版本更新 · v2arXiv:2609.07337

Elastoplastic inherent strain-based topology optimization for residual stress reduction in metal additive manufacturing

Takao Miki, Jike Han, Kazuhiro Izui, Shinji Nishiwaki

原文摘要

This paper proposes a topology optimization method for reducing the residual stress arising in the building process of metal additive manufacturing. First, a layer-by-layer process analysis model based on an elastoplastic inherent strain method is introduced. In this model, the incremental displacement is solved anew at each layer step, and the stress history is explicitly incorporated into the constitutive equation as the stress accumulated up to the previous step, which guarantees the stress continuity across layer interfaces without introducing activation strains. Next, the design sensitivity of this analysis model is derived based on the adjoint method. Taking the pair of the stress and the equivalent plastic strain as the state variables reduces the dependency between layer steps to a one-step recurrence, and the adjoint fields are constructed as a layer-by-layer reverse sweep that reuses the coefficient tensors obtained in the forward analysis. Consequently, the cost of the sensitivity analysis scales linearly with the number of layers and remains of the same order as that of the forward analysis. An optimization problem is then formulated based on the density method to minimize the P-norm of the residual stress at the completion of the building process under the volume and final-use compliance constraints, and the derived sensitivities are verified by comparison with central finite differences. Finally, the proposed method is demonstrated through two- and three-dimensional examples of residual stress minimization under a compliance constraint. The results clarify that, under the elastoplastic analysis, the maximum residual stress is bounded by the yield surface, and the optimization therefore reduces the extent of the yielded and plastic strain accumulating regions rather than the peak stress value.

cs.CE

新论文 · v1arXiv:2611.02375

Allen--Cahn Residual-Constrained Topology Optimization via an Augmented Lagrangian Method

Run Du, Xuan Xiao, Wenming Cheng, Zeqiang Zhang

原文摘要

This paper presents a residual-constrained topology optimization framework that controls interface transition bandwidth without requiring external density filters. The steady conserved Allen--Cahn (AC) equation is formulated as an equality residual constraint and solved via a mass-weighted Augmented Lagrangian Method (ALM) coupled with the Method of Moving Asymptotes (MMA). A closed-form chemical potential projection eliminates the constant residual mode, ensuring algebraic compatibility with external volume targets. Variational sensitivity analysis reveals a symmetric-plus-rank-one Jacobian that yields matrix-free sensitivities without additional adjoint PDE solves, reducing residual sensitivity overhead to only 0.11% of the state elasticity solve time in 3D. Systematic 2D benchmarks confirm that interface bandwidth is governed intrinsically by reaction--diffusion parameters across mesh refinements. While diffuse interfaces incur a continuous compliance elevation (1.4%--12.3%), a volume-preserving 0/1 post-processing audit across 48 benchmark cases demonstrates that this gap stems primarily from intermediate-density penalization: binarized AC-ALM designs achieve equal or superior stiffness in 45 configurations (averaging 1.2% stiffer than SIMP). Simultaneously, single-node hinges and strut fragmentation are substantially suppressed compared to unregularized baselines. Three-dimensional benchmarks further demonstrate practical spatial viability for complex structures.

cs.CE · math.OC

版本更新 · v2arXiv:2510.22987

Capsule Network-Based Multimodal Fusion for Mortgage Risk Assessment from Unstructured Data Sources

Mahsa Tavakoli, Rohitash Chandra, Cristian Bravo

原文摘要

Mortgage risk assessment traditionally relies on structured financial data, which is often proprietary, confidential, and costly. In this study, we propose a novel multimodal deep learning framework that uses cost-free, publicly available, unstructured data sources, including textual information, images, and sentiment scores, to generate credit scores that approximate commercial scorecards. Our framework adopts a two-phase approach. In the unimodal phase, we identify the best-performing models for each modality, i.e. BERT for text, VGG for image data, and a multilayer perceptron for sentiment-based features. In the fusion phase, we introduce the capsule-based fusion network (FusionCapsNet), a novel fusion strategy inspired by capsule networks, but fundamentally redesigned for multimodal integration. Unlike standard capsule networks, our method adapts a specific mechanism in capsule networks to each modality and restructures the fusion process to preserve spatial, contextual, and modality-specific information. It also enables adaptive weighting so that stronger modalities dominate without ignoring complementary signals. Our framework incorporates sentiment analysis across distinct news categories to capture borrower and market dynamics and employs GradCAM-based visualizations as an interpretability tool. These components are designed features of the framework, while our results later demonstrate that they effectively enrich contextual understanding and highlight the influential factors driving mortgage risk predictions. Our results show that our multimodal FusionCapsNet framework not only exceeds individual unimodal models but also outperforms benchmark fusion strategies such as addition, concatenation, and cross attention in terms of AUC, partial AUC, and F1 score, demonstrating clear gains in both predictive accuracy and interpretability for mortgage risk assessment.

cs.CE

版本更新 · v3arXiv:2610.19098

Global Parameter Identification and Uncertainty Quantification of reduced-order ADM1 using Maximum Likelihood Estimation and Bayesian Inference

Simon Hellmann, Leander Lerch, Terrance Wilms, Moritz Reumschüssel, Alberto Meola, Félix Delory, Steffi Knorn, Stefan Streif 等 9 位作者

原文摘要

Anaerobic digestion (AD) models can be challenging to calibrate against real data due to limited practical identifiability, data scarcity, and model complexity. Weighted least squares objective functions and gradient-based solvers using finite differences are often used in literature, but result in suboptimal parameter estimates and large uncertainty bands. This paper identifies the parameters of a reduced-order ADM1 by comparing the frameworks of maximum likelihood estimation (MLE) and Bayesian inference (BI), and quantifies uncertainties of parameters and outputs. Multirate experimental data are taken from a lab-scale AD reactor fed with agricultural substrates and operated at organic loading rates of 3$\,$g VS $\mathrm{m^{-3}d^{-1}}$. Global optima are found via global and gradient-based local search algorithms using forward sensitivities. Enhanced scatter search provides the best global search results. These are refined by the Gauss-Newton algorithm as the best local search, which delivers $R^2$ values of 0.95 for acetic acid and 0.77 for biogas production. BI yields substantially narrower uncertainty bands than MLE and avoids the need for a global search by incorporating prior knowledge about parameter distributions. The search space is captured efficiently by log10 scaling of parameters. Algorithmic details on its implications are provided. Despite a high-resolution lab-scale dataset, the ADM1-specific inhibition parameter $K_\mathrm{I,nh3}$ is practically not identifiable with MLE, and shows a low output sensitivity, whereas a parameter for the effective ion concentration shows superb practical identifiabilty at high confidence with both MLE and BI. The present work lays a scalable base for calibration of nonlinear AD models by providing reliable simulations. It thus advances model-based monitoring and control applications of multirate processes such as agricultural AD plants.

eess.SY · cs.CE · stat.AP

新论文 · v1arXiv:2611.01951

The Cryptocurrency Trend Factor Revisited: Predictive Information, Portfolio Construction, and Pricing Claims

Yifei Wang, Zhenling Pang

原文摘要

We reassess five economic claims about the cryptocurrency trend factor (CTREND): cross-sectional return predictability, high risk-adjusted performance, incremental information beyond market, size, and momentum, the ability to replace momentum in factor models, and robustness among large and liquid coins and after trading costs. Our reconstruction and code audit identify issues in information timing, technical indicators, forecast coverage, portfolio formation, and return accounting. We first correct future-information use and related settlement rules, then implement broader corrections to indicators, forecast availability, and portfolio accounting. Without additional coin exclusions, the first stage changes CTREND's mean weekly gross return from 4.07% to 4.25%, annualized Sharpe ratio from 2.08 to 1.48, and weekly alpha relative to published market, size, and momentum factors from 2.77% to 3.06%. After comprehensive correction, these become 0.05%, 0.01, and -1.38%; the alpha is no longer significant. Replacing momentum with CTREND yields an advantage in maximum squared Sharpe ratios of 0.058 in the original implementation, 0.024 after the first-stage correction, and -0.0185 after comprehensive correction, with a statistically significant overall decline. Mean weekly gross returns for the largest 100 coins change from 2.93% to 3.99% to 1.00%, while mean weekly net returns for the full long-short portfolio under the lowest assumed trading costs change from 2.93% to 3.35% to -0.87%. These findings show that reported performance and factor-substitution gains depend materially on implementation and sample composition. We distinguish predictive information, an independent return premium, and the incremental value of replacing an existing factor as separate economic claims.

cs.CE