Skip to content
Review Open access

A Reproducible Computational Pipeline for Modelling Sequential Decision Thresholds from Stopping-Rule Data

Sep 2026 · International Journal of Secondary Computing and Applications Research · Vol 3, pp. 14-20 · 1 citation

TL;DR

The contribution is a reproducible data-engineering system that bridges raw stopping-rule survey exports and standard event-history or repeated-measures modelling tools, while making exclusion decisions auditable rather than hidden in manual recoding.

Abstract

Stopping-rule experiments ask participants to move through ordered stages until they decide to act. These designs are useful for studying intervention thresholds, but raw survey exports are usually stored in wide form, while correct modelling requires scenario-level thresholds and stage-level at-risk rows. This paper presents a runnable R artifact for reconstructing and validating stopping-rule data. The artifact uses a JSON configuration layer, modular R source files, toy data, a second structurally different toy configuration, automated testthat tests, adversarial validation checks, reference outputs, licensing, and citation metadata. In a de-identified sequential risk-decision case study, the same reconstruction logic maps 1,108 potential scenario observations from 277 consenting participants, flags 25 ambiguous response sequences, retains 1,083 clean scenario-level observations, and generates 3,047 stage-level at-risk rows. The evaluation documents local execution, automated test coverage, end-to-end preprocessing behaviour, a second configuration demonstration, adversarial failure behaviour, and expected linear scaling for larger survey exports. The contribution is a reproducible data-engineering system that bridges raw stopping-rule survey exports and standard event-history or repeated-measures modelling tools, while making exclusion decisions auditable rather than hidden in manual recoding.

Read PDF

Similar papers

Review Open access Oct 2026

gp3sequences: An Auditable and Reproducible Framework for Ordered Categorical Sequence Analysis in R

Ordered categorical sequence analysis is distributed across specialist methods and software, making preparation decisions, method settings, diagnostics, and provenance difficult to inspect consistently across an end-to-end workflow. This paper presents gp3sequences, an R framework that adds a domain-specific contract l...

Stefanos Balaskas · 0 citations
#artificial intelligence Review Sep 2026

BENCHCOMPASS: From Scores to Signals for Training and Harness Decisions in Payment-Domain LLMs

BENCHCOMPASS is introduced, a payment-domain benchmark whose construction pipeline builds scenario-grounded tasks from typed evidence packs, applies LLM-based quality checks, creates task-input attack variants, and reserves final item admission for domain experts.

Si-Jie Dong, Wei-Feng Ren, Xuan-Wei Hu et al. · 0 citations
#small language model Review Open access Oct 2026

Grounding language models with deterministic verifiers for fraud detection

VR-FraudNet, a five-stage framework combining a time-conditioned spectral graph encoder, LightGBM triage and threshold routing, a schema-constrained rationale language model, a fixed deterministic verifier, and an isotonic probability mixer with split-conformal calibration, does not establish universal adversarial safe...

Md Sultanul Arefin Sourav, Evha Rozario, Md Ashiqul Islam et al. · 0 citations
#artificial intelligence Preprint Oct 2026

TypedBench: A Benchmark for Calibration, Framing Sensitivity, and Cost in System One Decision Models

System One models output calibrated probabilities over typed answers such as categorical choices, ordinal levels, or binary outcomes, via a non-generative interface. Software can act on these probabilities through thresholds, cost-weighted choices, and escalation rules. Consequently, if these probabilities are miscalib...

Rahul Sharma, Andrew B. Duncan, G. Caron et al. · 0 citations
Open access 2026

Compute-Adaptive Risk Control: A Finite-Sample Calibration Layer for Early-Exit and Cascade Inference

Efficient adaptive inference reduces computational demands, but selecting among policies on the same calibration data without controlling errors simultaneously can compromise safety conclusions. Practical deployment also requires explicit reporting of infeasibility, conditional efficiency analysis, and certification ac...

Sooyoung Jang, Siyeon Park, Sungpil Woo et al. · 0 citations
#natural language process... Preprint Sep 2026

TRACE: Single-Pass Decoding-Trace Risk Localization for Generation Calibration

TRACE is proposed, a single-pass, decoded-answer-preserving confidence estimator that treats decoding-time uncertainty as a trajectory through three steps: recording token-level surprisal and predictive entropy during decoding, applying local risk operators to preserve uncertainty spikes, and converting localized trace...

Yue-Bin Xu, Xue-Mei Peng, Jun-Lan Chen et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.