Search arXiv⌕ Search

arXiv · 2610.24611

HSPR: Recovering Software-Agent Benchmark Scores via Hierarchical Posterior Inference

Abstract

Evaluating software agents on a full benchmark is expensive. A small task subset can preserve agent rankings while yielding inaccurate scores. Historical responses provide useful structure, but tasks with identical source responses can have different outcomes for a new target agent. We introduce Hierarchical Score Posterior Recovery (HSPR), which combines source-fitted response factors with uncertain group success rates. Observed target outcomes update the posteriors over the target latent state and group rates; posterior-guided acquisition selects subsequent tasks. Its score-based criterion equals the expected one-step reduction in full-score posterior variance. Observed successes and posterior-predictive counts for unqueried tasks yield a full-score posterior. The final estimate uses its median with source-selected calibration. At a 10% task budget on four task banks from the SWE-bench family, HSPR achieves the lowest mean absolute error (MAE) on three banks and the lowest maximum absolute error (MaxErr) on all four among the methods compared. Removing group uncertainty or replacing adaptive queries increases macro MAE in the respective controls. Macro MAE decreases across 5-20% budgets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wanyi Chen, Wanqin Shen, Yuanchen Shi, Zhensu Sun, Fang Kong. 2026-10-17. HSPR: Recovering Software-Agent Benchmark Scores via Hierarchical Posterior Inference. https://arxiv.org/abs/2610.24611

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Agent-OM: Leveraging LLM Agents for Ontology Matching

Ontology matching (OM) enables semantic interoperability between different ontologies and resolves their conceptual heterogeneity by aligning related entities. OM systems currently have two prevailing design paradigms: conventional knowledge-based expert systems and newer machine learning-based predictive systems. While large language models (LLMs) and LLM agents have revolutionised data engineering and have been applied creatively in many domains, their potential for OM remains underexplored. This study introduces a novel agent-powered LLM-based design paradigm for OM systems. With consideration of several specific challenges in leveraging LLM agents for OM, we propose a generic framework, namely Agent-OM (Agent for Ontology Matching), consisting of two Siamese agents for retrieval and matching, with a set of OM tools. Our framework is implemented in a proof-of-concept system. Evaluations of three Ontology Alignment Evaluation Initiative (OAEI) tracks over state-of-the-art OM systems show that our system can achieve results very close to the long-standing best performance on simple OM tasks and can significantly improve the performance on complex and few-shot OM tasks.

cs.AI↗

OM4OV: Leveraging Ontology Matching for Ontology Versioning

Due to the dynamics of the Semantic Web, version control is necessary to manage changes in widely used ontologies. Despite the long-standing recognition of ontology versioning (OV) as a crucial component of efficient ontology management, many approaches treat OV as similar to ontology matching (OM) and directly reuse OM systems for OV tasks. In this study, we systematically analyse similarities and differences between OM and OV and formalise an OM4OV framework to offer more advanced OV support. The framework is implemented and evaluated in the state-of-the-art OM system Agent-OM. The experimental results indicate that OM systems can be effectively reused for OV tasks, but without the necessary extensions, can produce skewed measurements, poor performance in detecting update entities, and limited explanations of false mappings. To tackle these issues, we propose an optimisation method called the cross-reference (CR) mechanism, which builds on existing OM alignments to reduce the number of matching candidates and to improve overall OV performance.

cs.AI↗

SELECT: Semantic Erasure Boundary Construction with Sibling Exclusive Counterfactuals

Concept erasure aims to suppress undesirable concepts in text-to-image diffusion models while preserving their generative capabilities. Existing methods often redirect target concepts toward predefined semantic anchors, but the influence of anchor selection on the scope of concept erasure remains insufficiently understood. Through causal tracing, we reveal that concepts with more dispersed causal effects tend to exhibit higher anchor sensitivity and lower erasure robustness. Controlled anchor interventions demonstrate that anchor selection affects target suppression and collateral damage to surrounding semantic concepts. These findings motivate us to formulate anchor selection as semantic erasure boundary construction. We propose SELECT (Selective Erasure via Local Exclusive Counterfactual Targets), a plug-and-play framework based on Sibling Exclusive Concepts (SECs), which are semantically close to the target but mutually exclusive in its defining attributes. SELECT jointly constructs a counterfactual redirection endpoint and a local retention set to balance target suppression and semantic preservation. SELECT filters candidates using contextual activation, and uses semantic coherence to identify context compatible redirection endpoints, while the remaining SECs serve as local preservation constraints. Experiments on object, celebrity, artist-style, and NSFW erasure show that SELECT strengthens target suppression over fixed general anchors and achieves suppression-preservation trade-offs, while reducing concept re-emergence and erosion.

cs.AI↗