Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.23306

SimOPD: Relational Knowledge Transfer for On-Policy Distillation

Kai Tang·Xing Zheng·Haobo Wang·Guangcheng Zhu·Shenzhi Yang·Zhengqing Zang·Yingfan Ma·Bowen Song·Weiqiang Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

A key challenge in on-policy distillation (OPD) is extracting effective supervision from teacher knowledge. Supervision from token probabilities may underutilize internal knowledge, while direct hidden-state matching forces the student to shift to the teacher's feature space and complicates cross-architecture transfer. Inspired by contrastive learning's use of relationships between instances, we propose \textbf{SimOPD} to transfer teacher internal knowledge through response similarities. Specifically, SimOPD uses paired memory banks of student-generated responses to extract supervision from the teacher's internal representations as similarity distributions. The student then matches these distributions within its own representation space, retaining representational freedom and removing the need for cross-model projection. Extensive experiments show that SimOPD improves the overall average over the strongest baselines by up to 2.6 and 3.1 percentage points in same- and cross-architecture settings.

Explore related subjects

cs.AIcs.CL

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kai Tang, Xing Zheng, Haobo Wang, Guangcheng Zhu, Shenzhi Yang, Zhengqing Zang, Yingfan Ma, Bowen Song, Weiqiang Wang. 2026-10-16. SimOPD: Relational Knowledge Transfer for On-Policy Distillation. https://arxiv.org/abs/2610.23306

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗