Test Primitive:A Straightforward Method To Decouple March

• URL: http://arxiv.org/abs/2309.03214v1
• Date: Wed, 30 Aug 2023 03:18:34 GMT
• Title: Test Primitive:A Straightforward Method To Decouple March
• Authors: Yindong Xiao, Shanshan Lu, Ensheng Wang, Ruiqi Zhu, Zhijian Dai
• Abstract summary: This paper proposes a new test primitive for analyzing the March algorithm. The test primitives describe the common features that must be possessed for the March algorithm to detect corresponding faults.
• Score: 0.3535583356641669
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The academic community has made outstanding achievements in researching the March algorithm. However, the current fault modeling method, which centers on fault primitives, cannot be directly applied to analyzing the March algorithm. This paper proposes a new test primitive. The test primitives, which decouple the cell states from sensitization and detection operations, describe the common features that must be possessed for the March algorithm to detect corresponding faults, forming a highly flexible and scalable March algorithm analysis unit. The theoretical analysis proves that the test primitives demonstrate completeness, uniqueness, and conciseness. On this foundation, the utilization of test primitives within the March analysis procedure is elucidated.

Related papers

• Beyond Raw Detection Scores: Markov-Informed Calibration for Boosting Machine-Generated Text Detection [105.14032334647932]
  Machine-generated texts (MGTs) pose risks such as disinformation and phishing, highlighting the need for reliable detection.<n> Metric-based methods, which extract statistically distinguishable features of MGTs, are often more practical than complex model-based methods that are prone to overfitting.<n>We propose a Markov-informed score calibration strategy that models two relationships of context detection scores that may aid calibration.
  arXiv  Detail & Related papers  (2026-02-08T16:06:12Z)
• Verifying a Sparse Matrix Algorithm Using Symbolic Execution [51.56484100374058]
  We outline how symbolic execution can be used to write tests similar to traditional unit tests.<n>We provide stronger verification guarantees and apply this methodology to a sparse matrix algorithm.
  arXiv  Detail & Related papers  (2025-10-15T11:23:32Z)
• We Need to Rethink Benchmarking in Anomaly Detection [0.9124662097191378]
  We argue that this stagnation is due to limitations in how we evaluate anomaly detection algorithms.<n>In our opinion, anomaly detection should be studied using scenarios that capture the relevant characteristics of different applications.
  arXiv  Detail & Related papers  (2025-07-21T13:02:49Z)
• Bisimulation Learning [55.859538562698496]
  We compute finite bisimulations of state transition systems with large, possibly infinite state space. Our technique yields faster verification results than alternative state-of-the-art tools in practice.
  arXiv  Detail & Related papers  (2024-05-24T17:11:27Z)
• Dynamic Test Case Prioritization in Industrial Test Result Datasets [5.401427060370659]
  We propose a test case prioritization schema that combines the use of a static and a dynamic prioritization algorithm. We evaluate our solution on three industrial datasets and utilize Average Percentage of Fault Detection.
  arXiv  Detail & Related papers  (2024-02-05T11:46:14Z)
• Precise Error Rates for Computationally Efficient Testing [75.63895690909241]
  We revisit the question of simple-versus-simple hypothesis testing with an eye towards computational complexity. An existing test based on linear spectral statistics achieves the best possible tradeoff curve between type I and type II error rates.
  arXiv  Detail & Related papers  (2023-11-01T04:41:16Z)
• Testing for the Markov Property in Time Series via Deep Conditional Generative Learning [6.7826352751791985]
  We propose a nonparametric test for the Markov property in high-dimensional time series via deep conditional generative learning. We show that the test controls the type-I errorally, and has the power approaching one. We derive a doubly robust test statistic, which employs a nonparametric estimation but achieves a parametric convergence rate.
  arXiv  Detail & Related papers  (2023-05-30T17:32:00Z)
• New bootstrap tests for categorical time series. A comparative study [4.869045108760265]
  We propose three tests relying on a dissimilarity measure between categorical processes. Tests are constructed by considering three specific distances evaluating discrepancy between the marginal distributions and the serial dependence patterns of both processes. An application involving biological sequences highlights the usefulness of the proposed techniques.
  arXiv  Detail & Related papers  (2023-04-30T12:35:28Z)
• MaxMatch: Semi-Supervised Learning with Worst-Case Consistency [149.03760479533855]
  We propose a worst-case consistency regularization technique for semi-supervised learning (SSL) We present a generalization bound for SSL consisting of the empirical loss terms observed on labeled and unlabeled training data separately. Motivated by this bound, we derive an SSL objective that minimizes the largest inconsistency between an original unlabeled sample and its multiple augmented variants.
  arXiv  Detail & Related papers  (2022-09-26T12:04:49Z)
• Cross-validation Confidence Intervals for Test Error [83.67415139421448]
  This work develops central limit theorems for crossvalidation and consistent estimators of its variance under weak stability conditions on the learning algorithm. Results are the first of their kind for the popular choice of leave-one-out cross-validation.
  arXiv  Detail & Related papers  (2020-07-24T17:40:06Z)
• Probabilistic Diagnostic Tests for Degradation Problems in Supervised Learning [0.0]
  Problems such as class imbalance, overlapping, small-disjuncts, noisy labels, and sparseness limit accuracy in classification algorithms. Probability diagnostic model based on identifying signs and symptoms of each problem is presented. Behavior and performance of several supervised algorithms are studied when training sets have such problems.
  arXiv  Detail & Related papers  (2020-04-06T20:32:35Z)
• Frustratingly Simple Few-Shot Object Detection [98.42824677627581]
  We find that fine-tuning only the last layer of existing detectors on rare classes is crucial to the few-shot object detection task. Such a simple approach outperforms the meta-learning methods by roughly 220 points on current benchmarks.
  arXiv  Detail & Related papers  (2020-03-16T00:29:14Z)
• Active Model Estimation in Markov Decision Processes [108.46146218973189]
  We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP) We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
  arXiv  Detail & Related papers  (2020-03-06T16:17:24Z)
• Learning to Detect Entanglement [1.4763055441508717]
  Classifying states as entangled or separable is a fundamental, but expensive task. This paper presents a method, the forest algorithm, to improve the amount of resources needed to detect entanglement.
  arXiv  Detail & Related papers  (2017-09-11T22:47:24Z)

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.