Two tests of phase-structure features for transition prediction

• URL: http://arxiv.org/abs/2609.00335v2
• Date: Wed, 09 Sep 2026 15:02:59 GMT
• Title: Two tests of phase-structure features for transition prediction
• Abstract summary: This report examines whether phase-derived features improve endpoint prediction over a combined baseline in two settings.<n>Study 1 froze a contradiction-category pipeline before sealed scoring.<n>Study 2 developed fifteen treatments on blocks b0-b4 using 1,415 eligible answer-change comparisons and twenty-repeat, five-fold grouped cross-validation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Following arXiv:2607.25507, this report examines whether phase-derived features improve endpoint prediction over a combined baseline in two settings: a sealed contradiction comparison and a retrospective analysis of answer changes across matched pressure prompts. Study 1 froze a contradiction-category pipeline before sealed scoring. On 1,136 eligible primary cases, adding PC-2 produced a paired AUROC difference of +0.00087. The 99% bias-corrected accelerated interval included zero, and the prespecified +0.05 threshold was not met. A replication role with 1,063 cases showed a same-direction increment of +0.00019. The replication-direction condition passed, but both primary conditions failed, so advancement failed. Study 2 developed fifteen treatments on blocks b0-b4 using 1,415 eligible answer-change comparisons and twenty-repeat, five-fold grouped cross-validation. An execution on 9 September 2026 recomputed development statistics from saved prediction units and applied a three-condition gate; no treatment advanced. Layer 25 had the only positive mean-repeat PC-2 increment, approximately +0.00027, with a favorable sign in three of five seed blocks. These statistics measure development consistency, not whole-seed-block holdout performance. Agreement with earlier selection records does not establish an earlier notebook execution or that the rule was fixed before inspecting development results. The planned b5 selection and b6 evaluation were not completed through this gate. Neither study demonstrated the incremental benefit required by its applied advancement rule. The findings limit support for the evaluated feature constructions; they do not test the rotary score identity, its local pre-softmax bound, or the effectiveness of execution-boundary governance.

Related papers

• Guardrailed Meta-Agent Loops: Stress-Testing Policy Pinning, Budget Bounds, and Crash Recovery [7.414694666903067]
  GuardrailLoop is a simulation-based testbed that makes three operational contracts jointly testable.<n>A hash-pinned policy fixes goals, scope, evaluation identity, budget, and release conditions.<n>It separates useful adaptation, state recovery, and repeated execution.
  arXiv  Detail & Related papers  (2026-09-10T21:22:08Z)
• Neither Precision Nor Architecture Alone: Controlled Tests of Failure Remedies for Physics-Informed Neural Networks [5.6611769062164905]
  Physics-Informed Neural Networks (PINNs) frequently fail on stiff or advection-dominated PDEs.<n>Two recent accounts offer competing remedies: switching from FP32 to FP64 to repair an L-BFGS artifact stopping, or replacing the backbone with a state-space-model.<n>We test both under matched, seed-paired controls in a pre-registered 144-run study spanning convection, reaction, plus an independent 85-run convection/wave study.
  arXiv  Detail & Related papers  (2026-08-26T03:20:24Z)
• Beyond Tokens: Probing Higher-Order Epistasis in Learned Protein Representations [3.1035948531044912]
  We introduce ORBIT, an Order-Resolved Benchmarking of Interaction Transformations framework that separates interaction presence, representation accessibility, and functional recovery.<n>We compare ridge regression, a standard, independent tokens, nonlinear independent tokens, and Residual Interaction Tokenization (RIT)<n>RIT significantly increased pairwise accessibility at the token stage relative to both independent-token controls.
  arXiv  Detail & Related papers  (2026-08-24T23:35:36Z)
• Feature Priming in Online Linear Regression: Sparse-Regret Lower Bounds and a Tight Univariate Rate [47.36630149538994]
  In high-dimensional online prediction, the best predictor may depend on only a few features, so regret should scale with sparsity rather than the ambient dimension.<n>Warmuth and Amid asked at COLT 2023 whether any of three such rules admits a competitive online regret guarantee.<n>Our analysis identifies a common obstruction: cheap nuisance causes the refit to underweight the truly predictive coordinate.
  arXiv  Detail & Related papers  (2026-08-18T09:32:03Z)
• A Pre-Specified Construction-Confirmation Test of Operation-Level Causal Transfer Across Finite Isomorphic Symbolic Domains [0.0]
  We ask if the hidden-state difference between two operations is estimated separately for each source input, does adding that difference move the model toward the corresponding recipient answer?<n>The design compares this input-specific intervention with wrong-operation, norm-matched random, and no-op controls, and separates candidate construction from an independently isolated confirmation split.
  arXiv  Detail & Related papers  (2026-08-16T15:37:26Z)
• Probing and steering biology across Boltz-1s trunk-diffusion boundary [32.505127447635864]
  We analyze per-residue activations from the Pairformer trunk and diffusion module of Boltz-1 using linear probes, sparse autoencoders, and causal interventions.<n>We release the trained trunk and diffusion SAEs, Boltz-1 per-residue activations, and the analysis code.
  arXiv  Detail & Related papers  (2026-08-11T22:25:42Z)
• Stage-Replay Divergence Follows the KV Cache: Fixed-Prefix Precision Controls and Bidirectional Cache Transplantation [51.56484100374058]
  Stage-replay reconstructs intermediate token prefixes and treat fresh-prefill continuation as continuation from the decoder state that originally reached the prefix.<n>A matched 200-item experiment compares retained live cache with one-shot prefill of identical integer tokens and places an exact replica on both sides.
  arXiv  Detail & Related papers  (2026-07-30T16:41:40Z)
• Looping Is Not Reliability: State-Bound Evidence and Typed Revision Contracts for Agentic Code Repair [36.56438114281786]
  We study the gap between finding a correct patch and retaining, verifying, and submitting it.<n>We derive an evidence-bound typed loop contract and instantiate its mechanically enforceable subset in a reference implementation.
  arXiv  Detail & Related papers  (2026-07-27T16:05:23Z)
• CUSUM-Shaped Inference-Time Monitoring and Targeted Re-Decoding for Quantized Small Language Model Reasoning [0.6999740786886536]
  MGT-B maps overlapping windows of pre-sampling uncertainty and degeneration features to position-conditional empirical tail probabilities.<n>We audit whether the effect persists on problem identities first observed after the manual choice of log threshold h = 10.<n>Neither analysis is confirmatory, and the empirical factors are not established as a valid e-process or e-detector.
  arXiv  Detail & Related papers  (2026-07-22T13:34:17Z)
• Forgetting Is Not a Fix: Path Dependence in Sequential Engram Editing [35.76482964927589]
  We test the hypothesis that concept-specific memory traces become linear objects that can be extracted once and combined arithmetically.<n>We run that test on the authors' own reference implementation, at their reported best edit strength.<n>For unlearning-as-compliance: erasure certified today does not certify the artifact after its next edit.
  arXiv  Detail & Related papers  (2026-07-06T23:45:06Z)
• Measuring the Symmetry--Data Exchange Rate [0.2538209532048867]
  We show that a wrong-group control with identical orbit size and matched compute is worse than no constraint.<n>Relative exchange rate beta_diff = 1.28 is consistent in sign and order of magnitude with the theoretical bootstrap 1.0.<n>The methodological contributions -- the relative-rate estimator that cancels the shared-difficulty confound, the wrong-group control, and a pre-specified failure taxonomy -- transfer to any inductive bias whose strength can be parameterised.
  arXiv  Detail & Related papers  (2026-05-31T08:17:40Z)
• Let the Results Speak: A Replication-First Paradigm for LLM Behavioral Benchmarking [22.825786049667602]
  We propose a replication-first paradigm to anchor validity to a single human-rater consensus.<n>We certify the instrument via four properties -- reliability across K runs, cross-instrument replication across architecturally distinct judges, historical-footprint calibration via judges from earlier training cohorts, and pre-registered prediction.<n>We test it on emotional accompaniment by letting the self-evolve data-driven across: the dimensions are not pre-stipulated and the procedure stabilizes to a 9-dimension set.
  arXiv  Detail & Related papers  (2026-05-27T03:41:11Z)
• Most Transformer Modifications Still Do Not Transfer at 1-3B: A 2020-2026 Update to Narang et al. (2021) with Downstream Evaluation and a Noise Floor [32.18134535997269]
  We test 20 Transformer modifications at 1.2B and 3B under strict iso-data, iso-compute, iso-recipe control, with a multi-seed baseline noise floor and CLIMB-12 downstream evaluation as the primary metric.<n>Of the 20 modifications, only two clear Bonferroni correction at 1.2B; one of those two further fails to train stably at 3B under the shared recipe.<n>We conclude that noise-floor reporting, downstream evaluation, and cross-scale stability testing are now prerequisites for architecture comparisons at 1-3B.
  arXiv  Detail & Related papers  (2026-05-20T06:43:34Z)
• Distributional Energy-Based Models for Uncertainty-Aware Structured LLM Reasoning [40.342912574072024]
  Large Language Models produce structured outputs such as travel plans or code solutions.<n>Individual reasoning steps may appear correct while the output as a whole violates budgets, fails test cases, or contradicts earlier deductions.<n>We propose a learned quality scorer with deterministic analytical constraint penalties for verifying structured LLM outputs.
  arXiv  Detail & Related papers  (2026-05-15T17:08:27Z)
• Affinity Is Not Enough: Recovering the Free Energy Principle in Mixture-of-Experts [0.0]
  Sfinity MoE fails at domain transitions, where the current token belongs to one distribution and the next to another.<n>Three lightweight gate modifications raise this to 0.748 +/- 0.002 (124x)<n>We show that beta-routing reduces transition-step B from 6.56 +/- 0.01 to 4.01 +/- 0.15 (beta-MoE)
  arXiv  Detail & Related papers  (2026-05-01T12:18:55Z)
• Are Benchmark Tests Strong Enough? Mutation-Guided Diagnosis and Augmentation of Regression Suites [49.16055123488827]
  Insufficiently strong test suites can admit plausible yet semantically incorrect patches, inflating reported success rates.<n>We introduce STING, a framework for targeted test augmentation that uses semantically altered program variants as diagnostic stressors.<n>STING produces 1,014 validated tests spanning 211 instances and increases patch-region line and branch coverage by 10.8% and 9.5%.
  arXiv  Detail & Related papers  (2026-04-02T01:13:40Z)
• When Does Margin Clamping Affect Training Variance? Dataset-Dependent Effects in Contrastive Forward-Forward Learning [0.0]
  Contrastive Forward-Forward (CFF) learning trains Vision Transformers layer by layer against supervised contrastive objectives.<n>We focus on one implementation detail: the positive-pair margin in the contrastive loss is applied through saturating similarity clamping.<n>We prove that an alternative formulation, subtracting the margin after the log-probability, is gradient-neutral under the mean-over-positives reduction.
  arXiv  Detail & Related papers  (2026-03-01T07:00:38Z)
• Understanding Contrastive Representation Learning from Positive Unlabeled (PU) Data [28.74519165747641]
  We study the problem of Positive Unlabeled (PU) learning, where only a small set of labeled positives and a large unlabeled pool are available.<n>We introduce Positive Unlabeled Contrastive Learning (puCL), an unbiased and variance reducing contrastive objective.<n>When the class prior is known, we propose Positive Unlabeled InfoNCE (puNCE), a prior-aware extension that re-weights unlabeled samples as soft positive negative mixtures.
  arXiv  Detail & Related papers  (2024-02-08T20:20:54Z)
• Bidirectional Transformer Reranker for Grammatical Error Correction [34.94144153504719]
  We propose a bidirectional Transformer reranker (BTR) to re-estimate the probability of each candidate sentence generated by a pre-trained seq2seq model. The BTR preserves the seq2seq-style Transformer architecture but utilizes a BERT-style self-attention mechanism to compute the probability of each target token. Experimental results show that, in reranking candidates from a pre-trained seq2seq model, T5-base, the BTR on top of T5-base could yield 65.47 and 71.27 F0.5 scores on the CoN
  arXiv  Detail & Related papers  (2023-05-22T13:04:48Z)
• Comparing Sequential Forecasters [35.38264087676121]
  Consider two forecasters, each making a single prediction for a sequence of events over time. How might we compare these forecasters, either online or post-hoc, while avoiding unverifiable assumptions on how the forecasts and outcomes were generated? We present novel sequential inference procedures for estimating the time-varying difference in forecast scores. We empirically validate our approaches by comparing real-world baseball and weather forecasters.
  arXiv  Detail & Related papers  (2021-09-30T22:54:46Z)

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.