DELA: A Novel Approach for Detecting Errors Induced by Large Atomic Condition Numbers

• URL: http://arxiv.org/abs/2412.20804v2
• Date: Fri, 03 Jan 2025 02:19:41 GMT
• Title: DELA: A Novel Approach for Detecting Errors Induced by Large Atomic Condition Numbers
• Abstract summary: Most numerical errors stem from large condition numbers in atomic operations, which then propagate and accumulate.<n>Our approach is based on the observation that most numerical errors stem from large condition numbers in atomic operations.<n> DELA injects small perturbations into the results of individual atomic operations within the program and compares the outcomes of the original program with the perturbed version to detect errors.
• Score: 10.580959733598519
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Numerical programs form the foundation of modern science and engineering, providing essential solutions to complex mathematical problems. Therefore, errors in numerical results would lead to harmful consequences, especially in safety-critical applications. Since only a few inputs may lead to substantial errors for numerical programs, it is essential to determine whether a given input could result in a significant error. Existing researchers tend to use the results of high-precision programs to assess whether there is a substantial error, which introduces three main challenges: difficulty of implementation, existence of potential faults in the detection of numerical errors, and long execution time. To address these limitations, we propose a novel approach named DELA. Our approach is based on the observation that most numerical errors stem from large condition numbers in atomic operations (such as subtraction), which then propagate and accumulate. DELA injects small perturbations into the results of individual atomic operations within the program and compares the outcomes of the original program with the perturbed version to detect errors. We evaluate DELA with datasets from ATOMU and HSED, as well as data from a complex linear system-solving program. Experimental results demonstrate that we can detect all the significant errors that were reported by prior research. DELA shows strong alignment with high-precision programs of ATOMU and HSED, with average Pearson and Spearman correlations of 0.86 and 0.61. Additionally, DELA effectively detects significant errors in complex programs, achieving correlation scores of 0.9763 and 0.8993. More importantly, in experiments with ATOMU and HSED, DELA's perturbed programs run within only 0.13% of the time needed by high-precision versions; while for the linear system-solving programs, DELA is 73.46 times faster than the high-precision programs.

Related papers

• FPScan: An Automated Constraint-Based Analyzer for Floating-Point Anomaly Detection [0.0]
  FPScan is a novel tool to formally define and detect catastrophic cancellation and absorption in floating-point programs.<n>Our approach starts with a custom static analyzer based on abstract interpretation to infer the order of magnitude of all program variables.<n>Off-the-shelf SMT solver is used to determine whether the program exhibits any of these critical numerical pitfalls.
  arXiv  Detail & Related papers  (2026-09-07T13:41:01Z)
• MAED: Mathematical Activation Error Detection for Mitigating Physical Fault Attacks in DNN Inference [1.6624384368855523]
  This paper introduces MAED (Mathematical Activation Error Detection), an algorithm-level error detection framework.<n>It exploits mathematical identities to continuously validate the correctness of non-linear activation function computations at runtime.<n>It is the first to integrate algorithm-level error detection techniques to defend against both malicious fault injection attacks and naturally occurring faults in embedded systems.
  arXiv  Detail & Related papers  (2026-03-18T16:13:48Z)
• A Mathematics-Guided Approach to Floating-Point Error Detection [9.800281082826567]
  Floating-point program errors can lead to severe consequences, particularly in critical domains such as military applications.<n>We propose a novel method, named MGDE, to detect error-inducing inputs based on mathematical guidance.<n>By employing the Newton-Raphson method, which exhibits quadratic convergence properties, we achieve highly effective and efficient results.
  arXiv  Detail & Related papers  (2025-10-11T07:38:14Z)
• Computing Floating-Point Errors by Injecting Perturbations [10.580959733598519]
  Floating-point programs form the foundation of modern science and engineering.<n> floating-point errors widely exist, but only a subset of inputs may trigger significant errors in floating-point programs.<n>We propose PI-detector to computing floating-point errors effectively and efficiently.
  arXiv  Detail & Related papers  (2025-07-11T10:19:14Z)
• Quantum Error Detection For Early Term Fault-Tolerant Quantum Algorithms [1.9556053645976448]
  We present a framework for fault-tolerant compilation and simulation of quantum algorithms. Finding optimal syndrome schedules improves algorithm success probabilities by an average of 6.7x. We propose a simple data-driven approach to predict fault tolerant compilation parameters.
  arXiv  Detail & Related papers  (2025-03-13T18:34:01Z)
• The Validation Gap: A Mechanistic Analysis of How Language Models Compute Arithmetic but Fail to Validate It [23.803612556616685]
  We present a mechanistic analysis of error detection in large language models (LLMs) Through circuit analysis, we identify the computational subgraphs responsible for detecting arithmetic errors across four smaller-sized LLMs. Our findings reveal that all models heavily rely on $textitconsistency heads$--attention heads that assess surface-level alignment of numerical values in arithmetic solutions.
  arXiv  Detail & Related papers  (2025-02-17T13:00:44Z)
• Subtle Errors Matter: Preference Learning via Error-injected Self-editing [59.405145971637204]
  We propose a novel preference learning framework called eRror-Injected Self-Editing (RISE) RISE injects predefined subtle errors into partial tokens of correct solutions to construct hard pairs for error mitigation. Experiments validate the effectiveness of RISE, with preference learning on Qwen2-7B-Instruct yielding notable improvements of 3.0% on GSM8K and 7.9% on MATH.
  arXiv  Detail & Related papers  (2024-10-09T07:43:38Z)
• ErrorRadar: Benchmarking Complex Mathematical Reasoning of Multimodal Large Language Models Via Error Detection [60.297079601066784]
  We introduce ErrorRadar, the first benchmark designed to assess MLLMs' capabilities in error detection. ErrorRadar evaluates two sub-tasks: error step identification and error categorization. It consists of 2,500 high-quality multimodal K-12 mathematical problems, collected from real-world student interactions. Results indicate significant challenges still remain, as GPT-4o with best performance is still around 10% behind human evaluation.
  arXiv  Detail & Related papers  (2024-10-06T14:59:09Z)
• Data-driven Error Estimation: Upper Bounding Multiple Errors with No Technical Debt [26.81883988098551]
  We formulate the problem of simultaneously constructing valid confidence intervals (CIs) as estimating a high probability upper bound on the maximum error for a class/set of estimate-estimand-errors. We propose a completely data-driven approach to estimate an upper bound on the maximum error.
  arXiv  Detail & Related papers  (2024-05-07T19:38:26Z)
• Uncertainty quantification for deep learning-based schemes for solving high-dimensional backward stochastic differential equations [5.883258964010963]
  We study uncertainty quantification (UQ) for a class of deep learning-based BSDE schemes. We develop a UQ model that efficiently estimates the STD of the approximate solution using only a single run of the algorithm. Our numerical experiments show that the UQ model produces reliable estimates of the mean and STD of the approximate solution.
  arXiv  Detail & Related papers  (2023-10-05T09:00:48Z)
• Assessing Student Errors in Experimentation Using Artificial Intelligence and Large Language Models: A Comparative Study with Human Raters [9.899633398596672]
  We investigate the potential of Large Language Models (LLMs) for automatically identifying student errors. An AI system based on the GPT-3.5 and GPT-4 series was developed and tested against human raters. Our results indicate varying levels of accuracy in error detection between the AI system and human raters.
  arXiv  Detail & Related papers  (2023-08-11T12:03:12Z)
• NAPG: Non-Autoregressive Program Generation for Hybrid Tabular-Textual Question Answering [52.10214317661547]
  Current numerical reasoning methods autoregressively decode program sequences. The accuracy of program generation drops sharply as the decoding steps unfold due to error propagation. In this paper, we propose a non-autoregressive program generation framework.
  arXiv  Detail & Related papers  (2022-11-07T11:25:21Z)
• Fast and Accurate Error Simulation for CNNs against Soft Errors [64.54260986994163]
  We present a framework for the reliability analysis of Conal Neural Networks (CNNs) via an error simulation engine. These error models are defined based on the corruption patterns of the output of the CNN operators induced by faults. We show that our methodology achieves about 99% accuracy of the fault effects w.r.t. SASSIFI, and a speedup ranging from 44x up to 63x w.r.t.FI, that only implements a limited set of error models.
  arXiv  Detail & Related papers  (2022-06-04T19:45:02Z)
• Learning from Self-Sampled Correct and Partially-Correct Programs [96.66452896657991]
  We propose to let the model perform sampling during training and learn from both self-sampled fully-correct programs and partially-correct programs. We show that our use of self-sampled correct and partially-correct programs can benefit learning and help guide the sampling process. Our proposed method improves the pass@k performance by 3.1% to 12.3% compared to learning from a single reference program with MLE.
  arXiv  Detail & Related papers  (2022-05-28T03:31:07Z)
• MIRACLE: Causally-Aware Imputation via Learning Missing Data Mechanisms [82.90843777097606]
  We propose a causally-aware imputation algorithm (MIRACLE) for missing data. MIRACLE iteratively refines the imputation of a baseline by simultaneously modeling the missingness generating mechanism. We conduct extensive experiments on synthetic and a variety of publicly available datasets to show that MIRACLE is able to consistently improve imputation.
  arXiv  Detail & Related papers  (2021-11-04T22:38:18Z)
• Designing Accurate Emulators for Scientific Processes using Calibration-Driven Deep Models [33.935755695805724]
  Learn-by-Calibrating (LbC) is a novel deep learning approach for designing emulators in scientific applications. We show that LbC provides significant improvements in generalization error over widely-adopted loss function choices. LbC achieves high-quality emulators even in small data regimes and more importantly, recovers the inherent noise structure without any explicit priors.
  arXiv  Detail & Related papers  (2020-05-05T16:54:11Z)

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.