Phase-Localized Curation Does Not Help: A Negative Result on Per-Phase Metric Selection for Demonstration Filtering

• URL: http://arxiv.org/abs/2606.15064v1
• Date: Sat, 13 Jun 2026 02:45:10 GMT
• Title: Phase-Localized Curation Does Not Help: A Negative Result on Per-Phase Metric Selection for Demonstration Filtering
• Abstract summary: We test the per-phase hypothesis on three contact-rich LIBERO pick-and-place tasks with a controlled early-release structural defect.<n>Across all three tasks and five random seeds per condition, phase-gated curation is never the best curation strategy.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Manipulation demonstrations have temporal phase structure, and a natural hypothesis is that demonstration-curation metrics should be applied within phases rather than globally. The idea is to segment each trajectory into phases, score each phase with the metric that is locally most informative, and then aggregate. This follows directly from prior work showing that a single global metric can be the best detector of a defect and yet the worst curator of the resulting policy. We test the per-phase hypothesis on three contact-rich LIBERO pick-and-place tasks with a controlled early-release structural defect, comparing phase-gated curation against the same metrics applied uniformly and against a strong single global metric. Across all three tasks and five random seeds per condition, phase-gated curation is never the best curation strategy, and it is the worst of the three on two of the three tasks (Task 1: 86.0 vs. 92.0 for global; Task 3: 22.7 vs. 48.0 for uniform). We trace the failure to a concrete mechanism. When the defect signal is concentrated in a single phase, rank-aggregating across phases dilutes that signal with uninformative scores from defect-free phases, selecting a worse demonstration subset than simply applying the defect-informative metric everywhere. We further show that the per-phase metric selection does not transfer across tasks, since no phase shares a winning metric between any two tasks, so the selection cannot be reused and must be re-derived per task from a noisy sweep. These results bound a plausible and previously untested method, and they argue that practitioners should prefer identifying a single defect-informative metric over decomposing curation by phase. We release the full pipeline, all metric implementations, and per-seed results.

Related papers

• The Intervention Gap in Latent World Models [0.0]
  Planning-time intervention fidelity is a distinct, measurable property of a learned world model.<n>Across released TD-MPC2 checkpoint sizes, episode return falls as an operator-error diagnostic on task observables grows.<n>A self-supervised world model trained without task signal preserves the same operator substantially better than a task-anchored model on the shared task.
  arXiv  Detail & Related papers  (2026-08-30T19:47:51Z)
• Grouping the Stochastic Machine: Precision, Not Capability, as the Frontier Metric for AI Systems [0.0]
  I argue that frontier language models are compared, marketed, and benchmarked on capability -- what their best or average output can achieve.<n>What now separates one system from another in practice is precision.<n>I define a grouping metric, specify a harness, and show how tracking a human-AI pair's grouping over time yields the compounding signal that Paper 1's field study requires.
  arXiv  Detail & Related papers  (2026-08-19T17:29:47Z)
• NTDH: Complex Reasoning for Comprehensive Affective Analysis [28.280253328311346]
  Comprehensive affective analysis is challenging for two reasons.<n>It spans heterogeneous prediction tasks with continuous, ordinal, and multi-label outputs.<n>We recast the task as a complex-reasoning problem.<n>This is the first such treatment covering both sentiment and emotion.
  arXiv  Detail & Related papers  (2026-08-05T18:59:43Z)
• What Accuracy and Gradient Cosine Miss: Evaluating Feedback Alignment via Scale Stability, Reference Validity, and Depth Utility [48.10132234701036]
  We propose a diagnostic evaluation protocol based on three checks -- scale stability, reference validity, and depth utility -- together with per-layer rather than aggregate cosine reporting.<n>Across multiple architectures and methods, our protocol identifies all failures with wide calibration margins.
  arXiv  Detail & Related papers  (2026-06-19T06:04:17Z)
• Auditing Demonstration Curation Metrics: Action-Only Scorers Fail on the Structural Defects That Degrade Imitation Policies [0.0]
  Imitation-learning policies inherit the quality of the demonstrations they are trained on.<n>A growing set of curation metrics promise to score and filter low-quality demonstrations automatically.<n>We build a controlled testbed in which demonstration defects are injected with known type.
  arXiv  Detail & Related papers  (2026-06-04T02:07:27Z)
• Where Does Reasoning Break? Step-Level Hallucination Detection via Hidden-State Transport Geometry [3.2848713528308817]
  Large language models hallucinate during multi-step reasoning, but most existing detectors operate at the trace level.<n>We operationalize this view with a label-conditioned teacher that builds a trace-specific contrastive PCA lens.<n>We prove that contrastive PCA is the optimal projection for a transport-separation objective between first error and correct states.
  arXiv  Detail & Related papers  (2026-05-13T16:48:48Z)
• Measuring Temporal Linguistic Emergence in Diffusion Language Models [0.0]
  Diffusion language models expose an explicit denoising trajectory.<n>We study three independent 32-step runs of LLaDA-8B-Base on WikiText-103 text.
  arXiv  Detail & Related papers  (2026-04-25T10:17:47Z)
• Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols [51.56484100374058]
  We propose a paired-outcome measurement interface for auditing a single protocol step on exact-match tasks.<n>For each instance, the interface records a baseline correctness bit and a post-step correctness bit.<n>These rates predict accuracy changes and define a reusable empirical interface testable across seeds, mixtures, and pipelines.
  arXiv  Detail & Related papers  (2026-04-20T13:25:40Z)
• Deconstructing the Failure of Ideal Noise Correction: A Three-Pillar Diagnosis [82.06444754727156]
  We show that noise-correction methods still suffer from performance collapse during training.<n>This compellingly demonstrates that the failure is not fundamentally a $T$-estimation problem, but stems from a more deeply rooted flaw.<n>We provide a unified analysis that links three levels: macroscopic convergence states, microscopic optimisation dynamics, and information-theoretic limits on what can be learned from noisy labels.
  arXiv  Detail & Related papers  (2026-03-13T13:53:04Z)
• Improving Bias Correction Standards by Quantifying its Effects on Treatment Outcomes [54.18828236350544]
  Propensity score matching (PSM) addresses selection biases by selecting comparable populations for analysis. Different matching methods can produce significantly different Average Treatment Effects (ATE) for the same task, even when meeting all validation criteria. To address this issue, we introduce a novel metric, A2A, to reduce the number of valid matches.
  arXiv  Detail & Related papers  (2024-07-20T12:42:24Z)
• Clustered Switchback Designs for Experimentation Under Spatio-temporal Interference [44.644520116360106]
  We estimate the global average treatment effect (GATE), the difference between average outcomes having exposed all units at all times to treatment or to control.<n>We propose a clustered switchback design, where units are grouped into clusters and time steps are grouped into blocks.<n>We show that for graphs that admit good clustering, a truncated Horvitz-Thompson estimator achieves a $tilde O(1/NT)$ mean squared error (MSE)<n>Our results simultaneously generalize the results from citethu2022switchback,ugander2013graph and citetleung2022rate
  arXiv  Detail & Related papers  (2023-12-25T01:00:58Z)
• Hierarchical Semi-Supervised Contrastive Learning for Contamination-Resistant Anomaly Detection [81.07346419422605]
  Anomaly detection aims at identifying deviant samples from the normal data distribution. Contrastive learning has provided a successful way to sample representation that enables effective discrimination on anomalies. We propose a novel hierarchical semi-supervised contrastive learning framework, for contamination-resistant anomaly detection.
  arXiv  Detail & Related papers  (2022-07-24T18:49:26Z)
• Analytic Signal Phase in $N-D$ by Linear Symmetry Tensor--fingerprint modeling [69.35569554213679]
  We show that the Analytic Signal phase, and its gradient have a hitherto unstudied discontinuity in $2-D $ and higher dimensions. This shortcoming can result in severe artifacts whereas the problem does not exist in $1-D $ signals. We suggest the use of Linear Symmetry phase, relying on more than one set of Gabor filters, but with a negligible computational add-on.
  arXiv  Detail & Related papers  (2020-05-16T21:17:26Z)

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.