用符号距离替代硬标签,让黑盒模型复制更精准高效
Smoothing the Black-Box: Signed-Distance Supervision for Black-Box Model Copying
- 用符号距离代替硬标签,将复制问题转为平滑回归
- 在UCI数据集上准确率提升,且能输出不确定性信号
- 适合无模型内部信息时的模型升级与迁移
部署中的机器学习系统需随数据、架构和法规变化持续演进,但常无法获取原始训练数据或模型内部结构。此时,仅通过输入输出查询进行黑盒复制成为一种实用的重构机制,即通过查询学习原模型的副本。当仅能获取硬标签输出时,复制变为从离散点查询中重建不连续表面的问题,严重限制边界几何的高效恢复。本文提出一种基于距离的复制(知识蒸馏)框架,将硬标签监督替换为对教师模型决策边界的符号距离,使复制转化为可利用局部几何信息的平滑回归问题。我们设计了受α控制的平滑与正则化方案,实现对目标表面的霍尔德/利普希茨约束,并提出两种仅依赖标签访问的符号距离估计算法。在合成问题与UCI基准测试中,该方法在保真度和泛化准确率上均优于硬标签基线,同时可生成与不确定性相关的距离输出。
原文摘要 · Abstract (English)
Deployed machine learning systems must continuously evolve as data, architectures, and regulations change, often without access to original training data or model internals. In such settings, black-box copying provides a practical refactoring mechanism, i.e. upgrading legacy models by learning replicas from input-output queries alone. When restricted to hard-label outputs, copying turns into a discontinuous surface reconstruction problem from pointwise queries, severely limiting the ability to recover boundary geometry efficiently. We propose a distance-based copying (distillation) framework that replaces hard-label supervision with signed distances to the teacher's decision boundary, converting copying into a smooth regression problem that exploits local geometry. We develop an $α$-governed smoothing and regularization scheme with Hölder/Lipschitz control over the induced target surface, and introduce two model-agnostic algorithms to estimate signed distances under label-only access. Experiments on synthetic problems and UCI benchmarks show consistent improvements in fidelity and generalization accuracy over hard-label baselines, while enabling distance outputs as uncertainty-related signals for black-box replicas.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。