跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+549新增论文
+443其中 AI 相关
+62已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 266 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v3arXiv:2604.23599

Partition-of-Unity Gaussian Kolmogorov-Arnold Networks

Amir Noorizadegan

原文摘要

Gaussian basis functions provide an efficient and flexible alternative to spline activations in Kolmogorov-Arnold networks (KANs), but their performance is sensitive to the Gaussian scale parameter ε. We introduce the partition-of-unity Gaussian KAN (PU-GKAN), a kernel-based normalization framework that transfers the Shepard partition-of-unity principle to trainable KAN edge functions. Each Gaussian edge basis is normalized by its local sum over fixed centers, preserving the standard edge-based architecture and essentially the same trainable coefficient structure as GKAN. The resulting feature map reproduces constants exactly at the edge level and admits an explicit normalized finite-feature kernel interpretation. Numerical experiments show that PU-GKAN reduces sensitivity to ε, improves validation accuracy for most smooth and moderately non-smooth targets, and provides more stable training behavior. These benefits persist across variations in sample size and number of centers, higher-dimensional architectures, and Matern RBF bases. PU-GKAN also improves physics-informed neural networks for Helmholtz and wave equations, with validation-error reductions of up to 90%. These results establish partition-of-unity normalization as a mathematically grounded and broadly applicable framework for improving the reliability and accuracy of radial basis function KANs.

cs.CE · cs.AI · math.AP

新论文 · v1arXiv:2611.11540

Hydrograd v2.0: a differentiable two-dimensional shallow-water model on unstructured meshes with steady and unsteady adjoints for calibration and closure learning

Xiaofeng Liu

原文摘要

We present \textit{Hydrograd} v2.0, a significantly improved differentiable 2D shallow-water model written in Python with JAX. The model solves the shallow-water equations on the unstructured meshes of production models such as SRH-2D and HEC-RAS 2D with a well-balanced, positivity-preserving finite-volume scheme that handles wetting and drying. Gradients are tailored to the type of problem. Steady states are found by Newton's method with an exact sparse Jacobian obtained by graph colouring, and their gradients follow from the implicit function theorem at the cost of one linear solve. Unsteady flows are differentiated in reverse mode with checkpointing, or with an implicit time integrator whose gradient costs about two forward runs. All gradients agree with finite differences, to about $10^{-8}$ for steady flows. On the Savannah River case, the steady water surface differs from that of SRH-2D by 4.7\,mm (root mean square). Steady closure learning was 96 times faster than differentiating through time marching and reached a lower loss. An inflow hydrograph was inverted from stage records with a peak error of 2\,\%. In an unsteady roughness calibration, a singular value decomposition analysis of the sensitivity matrix showed that the stage records at the gauges are 70 to 160 times more sensitive to the total resistance of the reach than to its distribution among the roughness zones, which explains why only a gauge layout with gauges in every zone recovered all five roughness values. On one GPU, a mesh of 512,000 cells takes 7.6\,s for a forward run and 51\,s for a gradient.

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

新论文 · v1arXiv:2611.11286

Cable construction effects on the lateral forces and wakes of helically stranded cables under oblique inflow

Tielin Ma, Junlin Zhang, Jingcheng Fu, Chongwen Jiang, Chuan Ye

原文摘要

Helically stranded cables in aerial towing systems experience oblique inflow, but are often modeled as smooth cylinders, neglecting three-dimensional cross-stream coupling and surface texture. We perform large-eddy simulations and spectral proper orthogonal decomposition for a smooth cylinder and four stranded cables at four inclinations from $22.5^\circ$ to $90^\circ$, all stationary, with $Re \approx 1.0 \times 10^4$. Aerodynamic differences are governed mainly by cross-sectional symmetry and strand-scale groove depth. Force-source decomposition shows that surface pressure contributes 94.9%--98.3% of the mean normal force and dominates the mean lateral force. High-symmetry, quasi-circular envelopes maintain balanced circumferential pressure, whereas deep-grooved, low-symmetry tri-lobed geometries produce asymmetric separation and a persistent lateral pressure imbalance. In the wake, high-symmetry cables sustain spanwise-synchronized Karman shedding at moderate-to-high inclinations, concentrating fluctuation energy in a dominant low-rank mode. Deep grooves disrupt shedding coherence, deflect the recirculation zone laterally, and spread energy across broadband scales. Mean lateral force and lateral-force fluctuations are therefore decoupled: the quasi-circular $(1 \times 19)$ cable has minimal mean lateral force but strong periodic fluctuations, while the deep-grooved $(3 \times 7)$ cable has weak fluctuations but appreciable mean lateral force. These results support construction-dependent cable selection and aerodynamic load modeling.

physics.flu-dyn · cs.CE · cs.RO

新论文 · v1arXiv:2611.11141

TALK: One-Shot Batch Design for Protein Variant Effect Prediction

Qiao Huang, Ao Shen, Jie Du, Manning Wang

原文摘要

Protein variant effect prediction is central to understanding protein function and guiding protein engineering, yet experimental labels remain costly. In many protein experiments, the variants that can be assayed are dictated by protocol constraints, while the variants that need accurate prediction may lie in a different or broader region of the landscape. This assay-prediction mismatch makes candidate-local criteria such as predicted function, uncertainty, or exploration value insufficient for measurement design. Given a protocol-defined accessible space and a limited budget, we ask which variants should be assayed so that the resulting data best improves landscape prediction. We propose TALK, which estimates each candidate's contribution through posterior coupling between accessible and target variants and reduces redundant information within the batch. Across retrospective ProteinGym and FLIP protocols, TALK generally improves target-space prediction under limited measurement budgets. These results point to a practical two-stage workflow: first, spend a limited assay budget on variants selected to be informative for the target landscape and train a predictive model from the measured labels; then use this model to score and prioritize high-potential variants. Code is available at https://github.com/joehuang618/TALK.

cs.CE · cs.LG

新论文 · v1arXiv:2611.10891

Approximate Recall, Approximate Forecasts: Recall as a Diagnostic for LLM Forecasting Errors

Prashanth Bhaskara, Shubhaankar Gupta, Seojoon Yeon

原文摘要

Large Language Models (LLMs) exhibit approximate recall: they retain coarse associations about past events while losing fidelity on specific details. Past research on LLMs has quantified different models' forecasting ability in real-world events using prediction markets, but has not studied how losing said fidelity impacts their forecasting abilities. For example: while an LLM correctly recalls that the answer to: ''Did Anna Sawai win the Best Drama Actress in the 76th Emmy Awards?'' is ''Yes,'' it incorrectly states the event date as September 22 rather than September 15. In this paper, we introduce a novel metric called the Recall Fidelity Score to study how imprecision in internalized knowledge propagates to forecasting capability on future events. On resolved historical markets, we find that higher local recall fidelity around semantically similar past events predicts lower forecasting error on resolved markets, and the same signal predicts smaller distance from open markets prices.

cs.AI · cs.CE · cs.LG

新论文 · v1arXiv:2611.10886

The one-step surface-air lag in the EnergyPlus zone heat balance: order of accuracy, correction and consequences

Wooyoung Jung

原文摘要

The order of accuracy sets how fast numerical error falls as the timestep shortens. This study measured that order for the zone heat balance of EnergyPlus 26.2 against exact or converged references and tested a correction on 45 U.S. Department of Energy prototype cases. All three zone air formulas, the third-order default included, give first order or lower, because the surfaces use the previous timestep's air temperature. Solving surfaces, air and HVAC to agreement within each timestep raises the default to about second order, and in a room with an exact solution two extra passes cut the error eightfold at 1.65 times the runtime. In the prototype cases, the correction changed annual site energy by at most 0.45% but an outpatient clinic's heating by 5.1%. Window-upgrade savings changed by 10% or more in 13 of the 34 applicable cases, about as often as under a change of timestep.

cs.CE

版本更新 · v3arXiv:2512.14329

Wearable-informed generative digital avatars predict task-conditioned post-stroke locomotion

Yanning Dai, Chenyu Tang, Ruizhi Zhang, Wenyu Yang, Yilan Zhang, Yuhui Wang, Junliang Chen, Xuhang Chen 等 19 位作者

原文摘要

Dynamic prediction of locomotor capacity after stroke could enable more individualized rehabilitation, yet current assessments largely provide static impairment scores and do not indicate whether patients can perform specific tasks such as slope walking or stair climbing. Here, we present a wearable-informed data-physics hybrid generative framework that reconstructs a stroke survivor's locomotor control from wearable inertial sensing and predicts task-conditioned post-stroke locomotion in new environments. From a single 20 m level-ground walking trial recorded by five IMUs, the framework personalizes a physics-based digital avatar using a healthy-motion prior and hybrid imitation learning, generating dynamically feasible, patient-specific movements for inclined walking and stair negotiation. Across 11 stroke inpatients, predicted postures achieved approximately 95% of the practically attainable accuracy for slope ascent and 80% for stair climbing, respectively, demonstrating reliable task-specific gait prediction. In a multicenter randomized pilot feasibility study (n = 21; 28 days), access to scenario-specific locomotion predictions to support task selection and difficulty titration was associated with larger gains in Fugl-Meyer lower-extremity scores than the control group (mean change 6.0 vs 3.7 points; p < 0.05). These results suggest that wearable-informed generative digital avatars may augment individualized gait rehabilitation planning and provide a pathway toward dynamically personalized post-stroke motor recovery strategies.

cs.CE · cs.AI

版本更新 · v2arXiv:2610.01213

From language-model stock rankings to testable economic rules: A computational audit

Shuai Wu, Xue Li, Zhijun Wang, Bolun Liu, Weilin Cai

原文摘要

We test the stability, reproducibility and investment outcomes of language-model stock rankings. Four models and five numerical comparators share a portfolio engine over 72 monthly holding periods in the Shanghai Stock Exchange (SSE) 50, China Securities Index (CSI) 300 and CSI 500. Rankings use nine characteristics, and five repeated SSE 50 runs measure variation under identical inputs. Linear rules fitted to development-period model preferences are frozen before unseen-month, larger-pool and controlled-intervention tests. Their mean Spearman agreement with model rankings is 0.923-0.984 in the SSE 50 and 0.795-0.985 after transfer. Aggregate rank-change error falls relative to a zero-change prediction in twelve archived feature-group comparisons and eight matched single-feature comparisons, with Holm adjustments applied in separate nine-plus-three and six-plus-two families. Prediction of individual entries and exits remains weak (event Jaccard 0.000-0.125). Historical mean model compound annual growth rates range from 6.26% to 11.17%. At 10 basis points per side and six-month blocks, the twelve-comparison model-minus-rule return family and factor-controlled associations yield no adjusted finding. Three higher-cost, twelve-month-block comparisons favor a Terra rule within their twelve-test slices, with no adjusted finding across the full 144-test sensitivity grid. Two input-intervention batches totaling 5,184 responses supply paired intervention-return tests. The three-model batch has no bootstrap-adjusted finding at the primary block length; a Luna row-order effect appears under heteroskedasticity- and autocorrelation-consistent (HAC) adjustment within its three-test family but not in a pooled 24-test adjustment. Compact rules approximate aggregate rankings; return conclusions depend on comparison families, uncertainty methods and tie priorities.

cs.CE

版本更新 · v2arXiv:2610.19986

Transverse impulse response of finite and infinite Rayleigh beams

Saranya Biswas, Anindya Chatterjee

原文摘要

Here, we study an undamped Rayleigh beam subjected to a concentrated transverse impulse applied at a point far from the boundaries. For a simply supported finite beam struck at its midpoint, using the modal expansion of the impulse response, a short-time asymptotic series for the response of the struck point is derived. The infinite beam impulse response is obtained as a spectral integral in two ways. The spectral integral is evaluated exactly in terms of modified Bessel functions via Laplace transform calculations. The corresponding short- and long-time asymptotics of the exact integral are consistent with the power series developed earlier and the Euler-Bernoulli beam, respectively. Direct numerical evaluation of the integral with a pre-specified error bound and numerical contour integration is also presented for verification. An ad hoc approximation is given which matches the response well for all times. The relationship between finite and infinite beam responses is examined in some detail. There are three consequences of finite length. First, the coefficients in the power series expansion contain components that decay exponentially with increasing length of the beam. Second, a smooth deviation from the infinite beam response is observed, consistent with the greatest group velocity in the beam, wherein a small precursor is detected which is consistent with broader theory. Third, a slope discontinuity is observed, corresponding to the high-frequency limit of group velocity. The full time series plot from modal expansion satisfactorily shows both the arrival and passage of these high frequency components. This paper opens the door to impact studies that are envisaged in future work.

cs.CE

版本更新 · v3arXiv:2604.19530

Calibrating Scientific Foundation Models with Inference-Time Stochastic Attention

Akash Yadav, Taiwo A. Adebiyi, Ruda Zhang

原文摘要

Transformer-based scientific foundation models are increasingly deployed in high-stakes settings, but current architectures give deterministic outputs and provide limited support for calibrated predictive uncertainty. We propose Stochastic Attention, a lightweight sample-average inference-time modification that randomizes attention by replacing softmax weights with normalized multinomial samples controlled by a single concentration parameter, and produces predictive ensembles without retraining. To set this parameter, we introduce a calibration objective that matches the stochastic attention output with the target, yielding an efficient univariate post-hoc tuning problem. We evaluate this mechanism on scientific foundation models for weather and time-series forecasting, as well as a regression task. Across benchmarks against baseline methods, Stochastic Attention achieves the strongest native calibration and the sharpest prediction intervals at comparable calibration, with adaptation costs nearly three orders of magnitude lower than the next-best baseline. Code is available at https://github.com/UQUH/StochasticAttention.

cs.LG · cs.CE · stat.ML

新论文 · v1arXiv:2611.10674

Regularity in Cryptocurrency Market Cycles: A Halving-to-Halving Analysis Using Data from Google Trends and Wikipedia

Marek Zatwarnicki, Piotr Stolarski, Włodzimierz Lewoniewski

原文摘要

Bitcoin halvings provide a natural temporal structure for studying long-term dynamics of cryptocurrency markets. This paper presents a methodological framework for analyzing the regularity of Bitcoin and aggregate cryptocurrency market cycles by normalizing historical periods between consecutive halving events and projecting them onto a common relative-time scale expressed as the percentage of cycle completion. The proposed framework integrates market variables, namely Bitcoin price and aggregate cryptocurrency market capitalization, with measures of public attention derived from Google Trends search volume and Wikipedia pageviews. To obtain long-horizon daily attention indices, Google Trends data are reconstructed from overlapping 90-day windows linked by median scale ratios, following established approaches to combining high-frequency Google Trends samples. Rather than attempting to forecast future prices, the study aims to compare historical cycles, identify recurring temporal patterns, and evaluate the relationship between market dynamics and retail investor interest across different cycle-relative stages. Exploratory results point to a possible recurring structure. The maxima of the aggregate market capitalization in the two most recent completed cycles occurred at 39.0% and 37.9% of cycle completion, and the highest value of the ongoing cycle observed to date at 38.1% (534-547 days after the respective halvings), although the corresponding multiple of the halving-day value fell from 66 to 1.8. Public attention shows a similar compression of peak multiples, but not a similar timing. The paper also discusses current data limitations and outlines future research directions, including formal lead-lag analyses and expanded multi-asset investigations.

stat.AP · cs.CE · cs.SI

新论文 · v1arXiv:2611.10607

Worst-Case Contagion in Financial Networks: MILP Clearing and Robust Loss Analysis

G. C. Calafiore, M. Della Rossa, A. Proskurnikov

原文摘要

We study worst-case contagion losses in financial networks with interbank liabilities and common exposures to marketable assets. Existing linear-programming approaches provide exact stress-test values only within an insolvency-resilience margin, where all institutions remain solvent with respect to the external sector. We show that this margin is computed exactly by a finite family of linear programs, one per vertex of the uncertainty ball, whereas a single linear program based on the componentwise worst deterioration of external resources yields only a certified lower bound. We extend this framework beyond that margin in three directions. First, we derive an exact mixed-integer linear programming (MILP) formulation for the maximal clearing vector under arbitrary signed external net positions, providing a clearing oracle for robust stress testing when insolvency can occur. Second, we develop certified bounds on the worst-case loss beyond the margin, including insolvency-pattern enumeration, scenario lower bounds, fixed-pattern dual upper bounds, localized certificates, and a regime-generation procedure with monotone gap certificates. Third, we analyze the worst-case loss curve as a function of the perturbation radius. For $\ell_1$ and $\ell_\infty$ price-perturbation sets, the curve is convex, nondecreasing and piecewise linear up to the margin, with breakpoints generated by switches in worst-case shock directions, LP bases, and bank-level activity patterns. Beyond the margin, it remains nondecreasing and piecewise affine, but convexity may fail, the curve may jump upward, and the worst case need not be attained. The framework provides a certifiable MILP/LP methodology for parametric stress testing and interpretable diagnostics identifying the banks responsible for changes in systemic loss.

q-fin.RM · cs.CE · eess.SY

版本更新 · v2arXiv:2609.36637

Decompose Dynamics Before Learning Dependencies in Spatiotemporal Systems

Ziqi Wang, Daojiang Hu, Cheng Bao, Zhiwei Ling, Wenzhuo Qian, Jiahui Zhai, Hailiang Zhao

原文摘要

Relations in networked spatiotemporal systems are often learned from observations that entangle dynamics governed by different mechanisms, obscuring what evolves locally and how it propagates across nodes. We introduce Component-Aware Network Dynamics with Ordered Relations (CANDOR), which decomposes local dynamics before learning their dependencies. CANDOR represents each trajectory through a persistent background, gradual accumulation and release, and sparse shocks. Conditioned on these components, a delay-aware physical branch models edge and sample-dependent propagation over directed topology, while a topology-unconstrained functional branch discovers latent dependencies from background dynamics. Context-adaptive fusion combines functional, forward-propagation, and reverse-support forecasts, with training objectives encouraging specialized and semantically consistent representations. Experiments on two traffic benchmarks and three long-horizon water-quality datasets span two distinct spatiotemporal systems: human-driven urban traffic and naturally evolving river water quality. CANDOR achieves the lowest aggregate normalized error across five datasets, outperforming the overall runner-up by 7.25%. These results establish decomposition before dependency learning as an effective principle for spatiotemporal representation learning.

cs.CE

版本更新 · v3arXiv:2606.05487

VASTO: Simultaneous reconstruction of vascular geometry and blood flow from tomographic projections via differentiable topology optimization

Pramod Thombre, Rahul Kumar Padhy, Roshan M. D'Souza, Krishnan Suresh

原文摘要

Computed Tomography Angiography (CTA) is widely used to reconstruct vascular geometry from projection measurements, with conventional approaches such as Filtered Back-Projection (FBP) and Iterative Reconstruction (IR) forming the clinical standard. Despite recent advances, these methods remain susceptible to sparse and noisy measurement, making accurate recovery of critical anatomical features challenging. This consequently leads to poor estimation of blood flow. In this work, we present a fluid-physics-constrained reconstruction framework that leverages topology optimization (TO) to jointly recover vascular geometry and blood flow directly from time-resolved CTA sinograms. The formulation couples a steady incompressible flow model with a transient advection-diffusion contrast transport model, mapped to sinogram space through a differentiable projection operator. The velocity field is recovered as part of the reconstruction, and thus hemodynamic information can be obtained without requiring a separate computational fluid dynamics pipeline. The proposed method is demonstrated on synthetic phantoms under varying sparsity and noise levels, and on representative projection data.

cs.CE

新论文 · v1arXiv:2611.09678

Calibrating demand models versus adjusting OD matrices with traffic counts: a controlled comparison

Yue Li, Shujuan Chen, Ying Jin

原文摘要

Traffic counts are routinely used to calibrate travel demand models, particularly when the origin-destination (OD) matrix is not observed directly. An important modelling decision is whether to adjust individual OD flows or the parameters of the demand model that generates them. The latter approach uses fewer parameters and preserves a relationship between zonal characteristics and demand, but its accuracy depends on the assumed model structure. We compare three established approaches using the same prior information, traffic counts and equilibrium assignment. They estimate five production-gravity coefficients, origin and destination adjustment factors, or individual OD flows. Synthetic experiments on the Eastern Massachusetts and Chicago Sketch networks allow recovery to be assessed against known demand under different forms of model misspecification. Calibrating the five-coefficient model gives better OD recovery and held-out link-flow prediction when demand follows its assumptions or a two-purpose gravity process. Its advantage declines or reverses when destination choice or production relationships vary across zones. Cellwise adjustment achieves the closest fit to calibration counts in 65 of 66 evaluated conditions, yet it recovers OD demand least accurately of the three approaches in 45 of them. These findings show that model parameterisation matters beyond calibration fit. For transport planning, traffic counts should be used alongside independent evidence on trip production and distribution when selecting and validating a demand model.

cs.CE · stat.ME

新论文 · v1arXiv:2611.09624

TPIC: Energy-Conserving Space Plasma Simulations on GPU Supercomputers

Luca Pennati, Ivy Peng, Stefano Markidis

原文摘要

Artificial heating and numerical damping affect particle energization in kinetic space plasma simulations, even when the numerical scheme remains stable. Implicit and semi implicit energy conserving Particle-in-Cell (PIC) methods eliminate these errors in the discrete energy balance while relaxing explicit stability constraints. We present TPIC, a massively parallel implementation of the Energy Conserving Semi-Implicit Method (ECSIM) for GPU supercomputers. We extend the exact energy conservation in the ECSIM formulation to closed domains with conducting boundaries by deriving and canceling a spurious term in the discrete Poynting flux theorem. TPIC executes the complete particle and field cycle on NVIDIA and AMD GPUs, combining matrix-engine acceleration with asynchronous communication and computation. We validate TPIC in a variety of electrostatic and electrodynamic test cases relevant for space plasma physics applications, including quasineutral plasma expansion, two-stream instability, Whistler waves, Weibel instability, Whistler turbulence, and three-dimensional magnetic reconnection with conducting walls and 12.3 billion particles. We show that in all scenarios, TPIC agrees with the corresponding analytical theory or reference numerical results, and preserves the total system energy to machine precision. On 4,096 AMD GPUs, TPIC advances 1.9 trillion particles with 96.8\% weak scaling efficiency.

cs.CE · cs.DC · cs.PF

新论文 · v1arXiv:2611.09579

Locally Adaptive Conformal Prediction for Polynomial Chaos Expansions

Dimitrios Loukrezis, Arthur Hatstatt, Bruno Sudret, Dimitris G. Giovanis

原文摘要

This work develops a locally adaptive jackknife+ conformal prediction framework for polynomial chaos expansions. Therein, the non-conformity scores are normalized with an auxiliary polynomial chaos expansion trained on the log-transformed leave-one-out residuals of the base model. We show that the coverage guarantee of jackknife+ conformal prediction carries over to the adaptive intervals if the leave-one-out auxiliary models are trained on nested leave-one-out residuals. For fixed-basis polynomial chaos expansions fitted by ordinary least squares, all required quantities are derived in closed form and the guarantee-preserving adaptive intervals are obtained from a single model fit, without any model retraining. For sparse polynomial chaos expansions, where multiple model fits are necessary, we propose a heuristic simplification that limits the computational overhead of adaptivity at the cost of the formal coverage guarantee. Numerical experiments on an academic benchmark with known heteroscedastic noise and on an engineering simulation dataset show that the suggested method attains the target coverage while providing intervals that adapt to local prediction uncertainty, therefore being considerably more statistically efficient. These advantages are particularly prominent in high-uncertainty regions of the input space, where the performance of non-adaptive methods degrades substantially.

stat.CO · cs.CE · stat.ME · stat.ML

版本更新 · v2arXiv:2605.10340

StreamAZ: Line-by-Line SAR Focusing with State Space Models

Sebastian Fieldhouse, Roberto Del Prete, Gabriele Daga, Nathaniel Rensly, Gabriele Meoni, Kea-Tiong Tang

原文摘要

Conventional focusing methods for Synthetic Aperture Radar (SAR) employ block-wise processing efficiently but remain latency-heavy processes that prevent the realisation of a closed-loop cognitive SAR system. We present an online SAR image-formation framework, StreamAZ, that treats sensing as a stream and produces focused images in a line by line fashion. Our method uses a tiny state-space surrogate model trained with teacher-student distillation and multi-stage losses. We evaluate the method on real SAR data from Maya4, a Sentinel-1-derived dataset containing raw, range-compressed, range-cell-migration-corrected, and azimuth-compressed products. Relative to a linewise digital-signal-processing baseline, our framework delivers approximately 70$\times$ lower latency and 130$\times$ lower memory use; on a single AMD CPU core it processes one row in 16 ms with a memory footprint of 6 MB whilst maintaining a focusing quality high enough to support downstream decisions, which we illustrate with vessel detection and flood-mapping tasks.

eess.IV · cs.CE · cs.ET

新论文 · v1arXiv:2611.09176

TailDART: Compute-Efficient Foundation Models for Financial Time-Series Forecasting

Chiang Qin Zhi, Ranjan Satapathy, Erik Cambria, Joyjit Chattoraj

原文摘要

Although time-series foundation models (TSFMs) achieve strong zero-shot transferability across high-information-density physical systems, applying overparameterized TSFMs to quantitative finance is fundamentally constrained by low signal-to-noise ratios, non-stationarity, and prohibitive autoregressive decoding latency. To reconcile representation learning with institutional operational constraints, this study presents TailDART, a dense 2.68 million-parameter foundation model engineered for financial time-series forecasting. By integrating grouped-query attention into a lightweight backbone, the architecture drastically reduces Key-Value cache memory bandwidth overhead, achieving major inference acceleration (up to 48.1%) over prevailing state-of-the-art TSFMs to enable low-latency, high-throughput streaming execution. Furthermore, multi-asset benchmarks across varying temporal resolutions show that a compact model can remain competitive for market forecasting: TailDART matches the predictive fidelity of substantially larger baselines while demonstrating superior error resilience in high-volatility regimes.

cs.AI · cs.CE

版本更新 · v2arXiv:2611.07059

A hierarchy of physics-embedded neural operators for structural dynamic surrogate modeling

Amir Nasrollahi, Mehmet Sefa Orak

原文摘要

Structural-response surrogates must capture moving resonances, phase changes, and unequal-amplitude transfer channels during optimization or health-state changes. Physics-embedded learning seeks FEA-level accuracy at lower cost by embedding physics in inputs, forward passes, losses, and backpropagation. We propose Modal Rational (MR), mapping structural features to modal quantities for analytical frequency-response reconstruction. The Physics-Guided Modal Operator Network (PGMON) adds bounded frequency, damping, and residual-flexibility corrections. Modal Operator with Structural GELU and Anchored-SIREN Correction (MOSAIC) denotes the bounded spectral-discrepancy framework used here; MOSAIC-MR and MOSAIC-PGMON add such discrepancies. They support finite-dimensional maps and physical decoders for future neural operators; evidence is fixed-topology, not a completed operator comparison. Two 20,000-design populations are studied: an 80 m steel truss tower with variable member areas and attached masses, and a tapered shell beam with ten variable station masses. Archived tests cover ten designs and seven acceleration histories per structure; they are benchmarks, not seismic-design assessments. With 5% reference modal damping, MR, PGMON, and MOSAIC give mean displacement-history errors of 0.73-0.76% for the tower and 0.029-0.116% for the beam, against declared band-limited modal references. Supplied modal frequencies are distinguished from design-only use; unequal parameter counts and training settings are explicit. Error analysis separates learned modal discrepancies, truncation, and excitation weighting, explaining acceleration and difficult-tower limits and risks of blind use. Results support physically structured prediction but limit claims about generalization, computational savings, and added corrections. Next is developing and validating neural operators around these architectures.

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

新论文 · v1arXiv:2611.09162

Rethinking Requirement-to-Code Traceability Through Single-Agent and Multi-Agent Approaches

Sarthak Banerjee, Sallam Abualhaija, Domenico Bianculli, Lionel Briand

原文摘要

Requirements-to-code traceability supports essential software engineering activities, including change impact analysis, maintenance, and regulatory compliance. Existing approaches typically rely on a retrieval-and-classification pipeline, which suffers from an inherent retrieval bottleneck: relevant source files that are not retrieved cannot be recovered during subsequent analysis. In this paper, we revisit requirements-to-code traceability in light of the substantially larger context windows offered by modern large language models, which make repository-scale analysis feasible without a separate retrieval step. We propose three approaches: a single-agent approach that analyzes the entire code repository in one pass, and two multi-agent approaches based on self-verification and multi-agent debate. Our evaluation shows that the single-agent approach substantially improves recall, achieving 80.9%, a gain of 38.6 percentage points (pp) over the state-of-the-art retrieval-based baseline, albeit with a 25.8 pp reduction in precision. By leveraging collaborative reasoning, the multi-agent debate-based approach achieves the best overall precision-recall balance, with 24.5% precision and 71.0% recall, yielding an F2 score of 49.5%. This represents an improvement of 7.5 pp over the state of the art and 2.7 pp over the single-agent approach. While the quantitative evaluation establishes the overall effectiveness of the approaches, the aggregate metrics alone explain little due to the considerable variability across results. Importantly, qualitative analysis provides key insights into highly variable quantitative results: the retrieval approach suits requirements that echo the code's vocabulary; single-agent, full-context reasoning suits well-documented, consistently named code; and multi-agent debate suits indirect, conflicting, or distributed evidence.

cs.CE

版本更新 · v2arXiv:2611.00942

EPIC: Differentiable Energy-Force Consistent Uncertainty Quantification and Propagation for Machine-Learned Interatomic Potentials

Tianhao Su, Musen Li, Shunbo Hu, Tong-Yi Zhang

原文摘要

Machine-learned interatomic potentials (MLIPs) now rival density functional theory in accuracy and are increasingly used to screen vast crystal databases, yet they can produce unreliable predictions for chemistries outside their training distribution without clear warning. Existing force-level evidential approaches do not inherently define a corresponding uncertainty model over the potential energy surface, limiting the consistent propagation of uncertainty to energy-derived observables. Here we introduce Energy-Propagated Intrinsic Confidence (EPIC), a general energy-centered evidential framework that derives forces as exact gradients of the predicted mean energy, ensuring conservative force fields while providing an analytical estimate of energy uncertainty. Coupled to a MACE backbone trained on the Materials Project trajectory dataset, EPIC propagates uncertainty diagnostics to equations of state, anisotropic structural uncertainty ellipsoids, and phonon dispersions through a Monte Carlo procedure. Applied to 10,966 candidate crystals, the fraction classified as robustly dynamically stable increases from 11\% in the highest-uncertainty quartile to 53\% in the lowest-uncertainty quartile. Furthermore, element-resolved analysis reveals a pronounced chemistry dependence in the relationship between epistemic uncertainty and predicted dynamical stability, highlighting potential limitations in the description of complex bonding environments. EPIC thus provides a physics-aware, chemistry-sensitive uncertainty diagnostic for high-throughput screening and autonomous materials discovery.

cs.CE

新论文 · v1arXiv:2611.08937

Surrogate Quality Score: A Novel Composite Performance Metric for Model Selection

Maaz Ahmad, Iftekhar A. Karimi

原文摘要

The growing reliance on high-fidelity, state-of-the-art machine learning based models for engineering decision-making necessitates robust and systematic approaches for model selection. While high predictive accuracy at untrained points is a necessary trait in the final model, other attributes such as model complexity, forecastability, explainability, scalability, and physics-awareness may be equally important or relevant criteria depending on application context and user requirements. In this work, we propose a novel composite performance metric, Surrogate Quality Score (SQS) for model selection based on predictive accuracy and model complexity simultaneously. SQS heuristically integrates these two attributes through a weighted product of normalized measures, yielding a unified score to reflect overall model quality. A user-specified parameter in SQS enables explicit control over the accuracy-complexity trade-off, thereby incorporating human judgement and preference in the model selection process. We extensively discuss and justify the formulation of SQS and demonstrate its utility through an illustrative example. By combining predictive accuracy and model complexity, SQS offers a systematic and objective approach for model selection based on both attributes.

cs.LG · cs.CE

版本更新 · v3arXiv:2605.22848

Uncertainty-aware neural emulation reveals climate-resilient maize traits at scale

Mojdeh Saadati, Juan Panelo, Gustavo Visentini, Soumik Sarkar, Carlos Messina, Baskar Ganapathysubramanian

原文摘要

Climate change threatens maize yields worldwide, yet identifying which genetic traits sustain productivity under future conditions requires exploring an enormous space of genotype, soil, and climate combinations that process-based crop models are too costly to simulate at scale. Here we develop an integrated probabilistic emulation framework that transforms a mechanistic crop simulator (APSIM) into a fast, uncertainty-aware discovery engine. Built from two million simulations and coupled to a generative weather model that produces realistic climate sequences, the emulator reproduces thirteen maize growth outputs with high fidelity while returning calibrated confidence for every prediction, at a fraction of the original computational cost. Applying it across 100,000 trait configurations, six locations, and future climate projections extending to the year 2100, we identify 1,114 trait combinations that remain resilient under the 2100 future conditions and a stricter subset of 246 configurations that remain resilient across four future projection periods: 2040, 2060, 2080, and 2100. These resilient configurations occupy a distinct region of trait space, combining high radiation use efficiency with characteristic shifts in developmental and reproductive traits. Trait-importance analysis further identifies radiation use efficiency as the dominant driver of yield under future climate, while projected yields vary widely across locations and climate models, indicating strong spatial heterogeneity in the maize response to climate change.

cs.CE · cs.LG · q-bio.OT

版本更新 · v4arXiv:2607.12455

EVOQUANT: Self-Evolving Verifier-Guided Strategy Optimization for Robust Quantitative Trading

Jie Mao, Changlun Li, Xiang Li, Qiqi Duan, Jinhui Yuan, Xiang Liu, Yuyu Luo, Jing Tang 等 9 位作者

原文摘要

Quantitative strategy optimization remains largely manual, requiring domain experts to identify weak signals, tune risk-control rules, and repeatedly validate iterative revisions. Large language models can accelerate this process, but directly relying on them to rewrite trading strategies often introduces hallucinated edits, strategy drift, and backtest overfitting. We propose EVOQUANT, a self-Evolving Verifier-guided framework for strategy Optimization in Quantitative trading. Our method utilizes LLMs to deeply diagnose performance bottlenecks, generates semantically controlled candidate edits, selects the best strategy through a multi-stage verification pipeline, and distills optimization experience into reusable knowledge for continual self-improvement. We evaluate our method using seven representative strategies: four from the A-share market and three from the Crypto market. Experimental results show that our method significantly improves the Sharpe ratio across all tested strategies: the average test Sharpe increases from -0.298 to 0.538, and the best-performing strategy achieves a 199% relative improvement. Ablation studies and stress tests under stricter conditions further validate the effectiveness and robustness of the framework. Overall, this work transforms quantitative strategy optimization from costly manual trial and error into an automated and verifiable iterative paradigm, offering a new path for applying large language models to financial strategy research.

cs.AI · cs.CE

版本更新 · v2arXiv:2604.17095

Computational Construction and Engineering Evaluation of a Verified Mono-Monostatic Body

Vincent Wesley Couey

原文摘要

Many engineering failures in orientation-dependent systems are geometric failure modes: changing the material delays the failure; changing the geometry can eliminate it. The mono-monostatic property (exactly one stable equilibrium under gravity) is mathematically proven to exist in convex homogeneous bodies, but, to our knowledge, no verified smooth geometry had been openly published when v1 appeared (April 2026). We introduce an Equilibrium Count Score (ECS) oracle that measures stable equilibria via drainage basin analysis on the center-of-mass height landscape. v2 correction: v1 reported that Sloan's (2023) analytical Gomboc parameterization shows 4-11 local minima "at all published parameter values." That claim is withdrawn. The beta values swept were this work's own grid points, not Sloan's (he states convexity bounds beta <= 0.15 and beta <= 0.17); they lie inside the strictly convex sub-regime beta < ~0.036, where a body at beta = 0.023 was later certified mono-monostatic by interval arithmetic; and the oracle's two stages are biased in opposite directions, so its count can be wrong either way. We construct one strictly convex mono-monostatic body by extending the Sloan phase function with a Fourier term and optimizing via differential evolution, with ECS=1 confirmed across merge thresholds from 0.5% to 10%; two more reach ECS=1 under the oracle but are not strictly convex. Conventional geometries cannot achieve ECS=1 through ballast alone: cylinders and cubes retain multiple stable equilibria even at 30% bottom-weighted mass. Applications: an IMU calibration housing (349x orientation precision improvement), aerial reforestation seed pods (20-67% germination loss from incorrect landing orientation), and marine buoy self-righting. Cross-layer scoring shows the Gomboc is 11.8x worse than the cylinder on contact distribution while optimal on equilibrium stability.

cs.CE

新论文 · v1arXiv:2611.08842

DrivAerRim: A large-scale full-vehicle CFD dataset for wheel rim aerodynamics

Chao Xia, Xi Zeng, Alexey Vdovin, Huanxia Wei, Simone Sebben, Carl Lewerth, Qing Jia, Zhigang Yang

原文摘要

The wheel region contributes substantially to vehicle aerodynamic drag, and rim geometry strongly influences the flow in this region. However, publicly available automotive aerodynamics datasets offer limited variation in rim design. We present DrivAerRim, a large-scale dataset of full-vehicle computational fluid dynamics simulations covering 904 DeepWheel rim designs with diverse spoke layouts, opening areas and topologies. All cases use the same DrivAer Estateback, operating conditions and numerical setup, with rim geometry as the sole design variable. Wheel rotation is modelled using moving reference frame regions around the rims and rotating wall conditions on the deformed tyres. The numerical setup is assessed through mesh sensitivity analysis and comparisons with wind tunnel measurements. The resulting 9.32 TB release includes wheel geometries, vehicle and component force coefficients, accumulated drag, surface pressure, wall shear stress, and flow fields around the vehicle and wheels. Together, these data support surrogate model training and evaluation across diverse rim geometries, as well as aerodynamic optimisation and generative design to accelerate wheel rim development for vehicle drag reduction.

cs.CE

版本更新 · v3arXiv:2604.17120

Sloan's Analytical Gömböc: Strict Convexity Narrows the Admissible $β$ Range

Vincent Wesley Couey

原文摘要

Varkonyi and Domokos (2006) proved that convex homogeneous bodies with exactly one stable and one unstable equilibrium point exist. Sloan (2023) gave the first analytical parameterization, with radial function $R(θ,φ)$ having exactly two critical points on $S^2$. This is the v3 amendment-of-record of arXiv:2604.17120 (v3 corrects an attribution in the v2 title and abstract; no finding changes). v1 claimed Sloan's parameterization does not produce mono-monostatic bodies and reported a 13-member catalog of Fourier/radial extensions certified at ECS=1 via mesh-vertex drainage-basin analysis. Following correspondence with P. L. Varkonyi (BME), an analytical verification suite was built around the Varkonyi-Gauss identity. Finding 1: Sloan's parameterization does produce mono-monostatic bodies in a strictly-convex sub-regime ($β\lesssim 0.036$), where $K_{\min} > 0$ and the identity certifies ECS=1. v1 missed this because its mesh-vertex oracle over-counted on shallow COM-height landscapes. Sloan states that $β\le 0.17$ should suffice for convexity, but at $β=0.05$, inside that range, strict convexity is lost ($K_{\min}=-0.569$; $K<0$ over 4.01% of surface) and the identity's precondition fails. v1's "global surface information" mechanism is replaced by the strict-convexity precondition. Finding 2: Of v1's 13 catalog instances only Phase-1 ($β=0.023149$, $a_1=0.234433$, $k=1$) survives identity-based verification; the remaining twelve were per-$k$ optimizer extrema overshooting the strict-convex boundary. Probing the regime interior verifies further mono-monostatic bodies in $k=2$ and $k=3$ sub-families: the verified set is an open regime in $(β, a_1, k)$, not a discrete list. Finding 3: v1's ECS=1 readings for the 9 radial-family members reflected drainage-basin merging; the $r=0.9993$ gentleness-robustness correlation is retracted.

cs.CE · cs.CG

新论文 · v1arXiv:2611.08701

Does a Trading Policy Need to Know What It Trades? Microstructure Invariance and Zero-Shot Transfer of Execution Policies

Hieu Tran, Hong Yu

原文摘要

Execution algorithms are calibrated asset by asset, because the queues, trade rates and bid-ask spreads they face differ by orders of magnitude across assets. For reinforcement learning this is zero-shot generalisation across contexts of very different scales, and microstructure invariance proposes a normalisation fixed by theory: measured in each asset's own units of time, size and price, markets look alike. In an exact order-by-order replay of public Nasdaq data, we train policies once, on 954 stocks in 2019, to choose between waiting in the queue and crossing the spread, and evaluate them unchanged on 1,964 unseen stocks in 2020-21, 2,629 stocks in 2025-26, crypto pairs and a second exchange. First, a policy that sees a stock only through its recent trade rate, trade size, spread and price increment (tick) costs within 0.015 spreads per share (a fifth of what learning saves) of a policy whose training data included the stock, and the stock's own history does not help it; it comes within a similar margin of policies trained on the second exchange when every episode counts equally, and within a wider one on crypto. Second, in mean cost before fees, invariant units beat raw units, z-scores and asset descriptors, but by under a basis point: most of their advantage is information and a common cost scale that a learner can also take as plain inputs, and none of the representations tested extrapolates to unseen spread regimes. Third, a near-zero transfer gap to a pooled comparator is weak evidence that a representation is right: we show that such a comparator detects only a small share of what a poor representation loses, and confirm it in synthetic markets and on pendulums.

cs.LG · cs.CE · q-fin.TR

新论文 · v1arXiv:2611.08153

面向多模态托卡马克任务的生成式基础模型

A Generative Foundation Model for Multimodal Tokamak Tasks

Yingshuai Ji, Haodong Feng, Guohong Deng, Gelin Bian, Yue Wang

AI 速读 基于摘要

作者提出生成式托卡马克基础模型 GenToka,用共享条件扩散 Transformer 联合生成按 schema 选定的多模态目标,并在扩展后的 MAST 基准上报告了相对 TokaMind 的误差与 F1 改进。

cs.AI · cs.CE

查看原文摘要

Tokamak experiments record diverse measurements, including waveforms, profiles, fields, and scalars, which are used to reconstruct the plasma, forecast its evolution, recover associated control signals, and estimate disruption risk. Most models are built separately for one task and a fixed set of inputs and outputs, and each relies on a prescribed subset of diagnostics rather than structuring the full multimodal observation set to extract global, cross-signal information about the discharge. These limitations motivate a reusable foundation model that adapts to each task's input-output schema and models heterogeneous target signals jointly, rather than retraining a separate model for every configuration. In this work, we extend the TokaMark benchmark with two groups of tasks for actuator action inversion and disruption prediction, yielding 20 MAST tasks in six groups with explicit schemas and evaluation protocols. Then, we introduce GenToka, a generative tokamak foundation model that jointly generates schema-selected targets through a shared conditional diffusion Transformer, with signal-specific codecs preserving native time series, profiles, fields, and scalars; foundation pretraining and task-specific adaptation transfer cross-signal structure across all six groups. Evaluation on MAST measurements shows that GenToka reduces macro-average normalized root mean squared error relative to TokaMind by 4.7% on Groups 1-4 and by 17.7% on Group 5, and improves macro-average window-level F1 on Group 6 by 8.4% at a common validation-selected threshold. GenToka provides a reusable, generative, and multimodal pathway for experimental tokamaks, linking plasma-state reconstruction, actuator inference, and disruption warning from shared measurements to support more integrated, data-driven fusion plasma prediction and control research.