Validating LLM-Modernized Scientific Software Through Differential Fault Injection
- URL: http://arxiv.org/abs/2608.14527v1
- Date: Fri, 14 Aug 2026 17:45:55 GMT
- Title: Validating LLM-Modernized Scientific Software Through Differential Fault Injection
- Abstract summary: Large language model (LLM) agents are increasingly used to modernize the legacy Fortran underlying production scientific software.<n>We present a differential fault-injection validation method to test whether a modernization preserves the original code's response to faults, perturbations, and reduced precision.
- Score: 4.4455011390187815
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Large language model (LLM) agents are increasingly used to modernize the legacy Fortran underlying production scientific software, but validation of these transformations emphasizes nominal executions and may not test whether a modernization preserves the original code's response to faults, perturbations, and reduced precision. We present a differential fault-injection validation method: a harness instruments the shared self-consistent-field driver of GAMESS at twelve sites and applies identical, deterministic faults to the original and LLM-modernized implementations, isolating the converted integral kernels. Across more than 2,200 runs, transient-fault absorption costs match a contraction-based model (predicted slopes 0.74 and 1.49 iterations per bit; measured 0.82 and 1.50), persistent perturbations halve final-energy error per additional bit, and the campaigns expose phase-dependent parallel deadlocks and false convergence under reduced precision. The original and modernized kernels agree in all 200 paired injections, and a measurement-guided synchronization change composes with the modernization, matching in all 40 pairs.
Related papers
- Rethinking Pixel Mean Flows via Interval Denoiser [95.11499828543344]
We propose the Interval Denoiser, a framework for latent-free generation.<n>Our model achieves an FID of 4.55 in one step (1-NFE) and 3.98 in two steps (2-NFE) without perceptual losses.
arXiv Detail & Related papers (2026-08-05T13:22:43Z) - DiffusionGemma Technical Report [72.10570774996219]
We introduce DiffusionGemma, a language model that uses discrete diffusion to generate text at exceptionally high speed.<n>Rather than decoding one token at a time, DiffusionGemma iteratively refines blocks of 256 tokens in parallel.<n>Our compute-efficient two-stage training pipeline uses fewer than 10% of the starting AR model's total training token budget.
arXiv Detail & Related papers (2026-07-31T16:11:46Z) - Cross-Layer Error Compensation and Finite-Sample Feature-Statistics Matching for Extreme Low-Bit Quantization of Large Language Models [0.0]
We formulate quantization as a joint optimization over the discrete codes and scales of all layers.<n>We show that error compensation alone reaches a perplexity ratio of 9.56 +/- 0.15 over the FP16 teacher.<n>On Qwen2.5-1.5B with 1.125-bit group-binary weights, error compensation alone reaches a perplexity ratio of 9.56 +/- 0.15 over the FP16 teacher.
arXiv Detail & Related papers (2026-07-16T06:47:52Z) - Co4ICF: Co-evolving Physics-Informed Surrogate and RL-based Pulse Optimizer for Inertial Confinement Fusion [43.450233708268684]
Co4ICF is a co-evolving framework that couples a physics-informed surrogate with a PPO-based pulse.<n>In the 1D MULTI environment, Co4ICF achieves 146.1% normalized yield based on current laser design baseline.<n>We release a large-scale MULTI-IFE simulation dataset to support future benchmarking.
arXiv Detail & Related papers (2026-07-11T15:43:27Z) - Breaking the Likelihood Trap: Variance-Calibrated Modulation for Large Language Model Decoding [4.534022278426311]
Variance-Calibrated Modulation (VCM) is a training-free pre-decoding intervention that reshapes the probability distribution before truncation.<n>Across open-ended generation, factual QA, and mathematical reasoning, VCM consistently mitigates the likelihood trap.
arXiv Detail & Related papers (2026-06-21T14:04:51Z) - Reconstruction of detector error model for quantum error correction [6.505803823301456]
We introduce a globally consistent framework to invert experimental syndrome statistics directly into discrete physical hypergraphs.<n>We show that exact continuous parameter extraction in dense codes is limited by a textitvariance cascade, where absolute statistical variance accumulates linearly from high to low-degree mechanisms.<n>This provides a practical approach for characterizing and decoding highly correlated noise in realistic quantum hardware.
arXiv Detail & Related papers (2026-06-15T06:51:48Z) - Trajectory Guard -- A Lightweight, Sequence-Aware Model for Real-Time Anomaly Detection in Agentic AI [0.0]
Trajectory Guard is a Siamese Recurrent Autoencoder with a hybrid loss function that jointly learns task-trajectory alignment via contrastive learning and sequential validity via reconstruction.<n>At 32 ms latency, our approach runs 17$-27times$ faster than LLM Judge baselines, enabling real-time safety verification in production deployments.
arXiv Detail & Related papers (2026-01-02T00:27:11Z) - The Hidden Cost of Approximation in Online Mirror Descent [56.99972253009168]
Online mirror descent (OMD) is a fundamental algorithmic paradigm that underlies many algorithms in optimization, machine learning and sequential decision-making.<n>In this work we initiate a systematic study into inexact OMD, and uncover an intricate relation between regularizer smoothness and robustness to approximation errors.
arXiv Detail & Related papers (2025-11-27T10:09:07Z) - ATTS: Asynchronous Test-Time Scaling via Conformal Prediction [112.54016379556073]
Large language models (LLMs) benefit from test-time scaling but are often hampered by high inference latency.<n>We introduce ATTS (Asynchronous Test-Time Scaling), a statistically guaranteed adaptive scaling framework.<n>We show that ATTS delivers up to 56.7x speedup in test-time scaling and a 4.14x throughput improvement.
arXiv Detail & Related papers (2025-09-18T16:55:09Z) - Improving Black-Box Generative Attacks via Generator Semantic Consistency [51.470649503929344]
generative attacks produce adversarial examples in a single forward pass at test time.<n>We enforce semantic consistency by aligning the early generator's intermediate features to an EMA teacher.<n>Our approach can be seamlessly integrated into existing generative attacks with consistent improvements in black-box transfer.
arXiv Detail & Related papers (2025-06-23T02:35:09Z) - FT-Transformer: Resilient and Reliable Transformer with End-to-End Fault Tolerant Attention [5.261954615957387]
Existing fault tolerance frameworks for Transformers are designed at the operation level without architectural optimization.<n>In this paper, we implement module-level protection for Transformers by treating the operations within the attention module as a single kernel.<n>We show that our end-to-end fault tolerance achieves up to 7.56x speedup over traditional methods with an average fault tolerance overhead of 13.9%.
arXiv Detail & Related papers (2025-04-03T02:05:08Z) - Consistency Trajectory Models: Learning Probability Flow ODE Trajectory of Diffusion [56.38386580040991]
Consistency Trajectory Model (CTM) is a generalization of Consistency Models (CM)
CTM enables the efficient combination of adversarial training and denoising score matching loss to enhance performance.
Unlike CM, CTM's access to the score function can streamline the adoption of established controllable/conditional generation methods.
arXiv Detail & Related papers (2023-10-01T05:07:17Z) - Non-Autoregressive Transformer ASR with CTC-Enhanced Decoder Input [54.82369261350497]
We propose a CTC-enhanced NAR transformer, which generates target sequence by refining predictions of the CTC module.
Experimental results show that our method outperforms all previous NAR counterparts and achieves 50x faster decoding speed than a strong AR baseline with only 0.0 0.3 absolute CER degradation on Aishell-1 and Aishell-2 datasets.
arXiv Detail & Related papers (2020-10-28T15:00:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.