Cross-View Correspondence Is a Measurement Intervention: Two-Sided Validation for Agent Evaluation and Credit Assignment
Not on the map. Why?
Abstract (arXiv)
Agent evaluations and trace-based learning often compare outputs across transformed views through a post-response correspondence treated as neutral preprocessing. We show that this correspondence is a measurement intervention: omitting it can manufacture sensitivity, an over-aggressive map can manufacture invariance, and multiple optimal correspondences can leave mechanism labels and signed learning credit unidentified. We develop a validity theory and audit with three components: two-sided validation of nuisance removal and response preservation, all-optima identification of downstream conclusions, and uncertainty propagation after validity is established. We characterize the linear feasibility boundary for response-preserving nuisance removal, compute sharp ranges over exact-optimum correspondence sets, and give a distribution-free certificate that retains a credit coordinate only when all exact optima agree on its nonzero sign. Across public code and SQL pipelines, two deterministic optimal tracebacks disagree on temporal localization for 55.9% of 1,586 nonzero trajectory pairs; two frozen 800-rollout tool-use audits, including a task-and-seed-disjoint replication, expose exact-optimum reversals of intended turn-level credit, although a clean public quick-start subset shows none. A pre-registered transport gate failed on natural responses; frozen corrected and held-out controls then show that a map calibrated only on benign examples erases every retained harmful response, while two-sided validation selects response-preserving alternatives. Cross-view correspondence must therefore be declared, validated, and propagated into uncertainty before agent evaluation or credit assignment supports a point conclusion.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 39 references that are in the map. First posted on arXiv 18 Aug 2026.
Builds on
22 of 39 references.
References · 22
- 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
- 2023Quantifying Language Models' Sensitivity to Spurious Features in Prompt Design or: How I learned to start worrying about prompt formattingcited by 778
- 2026GDPO: Group reward-Decoupled Normalization Policy Optimization for Multi-reward RL Optimizationcited by 175
- 2020A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singletoncited by 78
- 2024RoTBench: A Multi-Level Benchmark for Evaluating the Robustness of Large Language Models in Tool Learningcited by 45
- 2025Earth-Agent: Unlocking the Full Landscape of Earth Observation with Agentscited by 42
- 2023On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysiscited by 39
- 2025MCPEval: Automatic MCP-based Deep Evaluation for AI Agent Modelscited by 34
- 2026Demystifying Group Relative Policy Optimization: Its Policy Gradient is a U-Statisticcited by 19
- 2025GUI-Robust: A Comprehensive Dataset for Testing GUI Agent Robustness in Real-World Anomaliescited by 15
- 2019Probabilistic Permutation Invariant Training for Speech Separationcited by 12
- 2025M^3-Bench: Multi-Modal, Multi-Hop, Multi-Threaded Tool-Using MLLM Agent Benchmarkcited by 11
10 more
- 2025LeTS: Learning to Think-and-Search via Process-and-Outcome Reward Hybridizationcited by 10
- 2022Robust Perception through Equivariancecited by 9
- 2026MatchTIR: Fine-Grained Supervision for Tool-Integrated Reasoning via Bipartite Matchingcited by 9
- 2024Quantifying perturbation impacts for large language modelscited by 8
- 2026Consistency as a Testable Property: Statistical Methods to Evaluate AI Agent Reliabilitycited by 3
- 2026RepoMirage: Probing Repository Context Reasoning in Code Agents with Perturbationscited by 3
- 2018A robust approach to quantifying uncertainty in matching problems of causal inferencecited by 2
- 2026On the Hidden Objective Biases of Group-based Reinforcement Learningcited by 2
- 2026Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Setscited by 2
- 2026An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decompositioncited by 1
Built on by
Not cited yet.