通过事实性和反事实性查询进行线性模型提取
Linear Model Extraction via Factual and Counterfactual Queries
AI总结:
本文提出通过事实性和反事实性查询提取线性模型的方法,证明在不同距离度量下,反事实性查询能有效恢复模型参数。
摘要:
在模型提取攻击中,目标是通过查询选定的数据点来揭示黑盒机器学习模型的参数。由于对解释的需求增加,这可能涉及除了通常考虑的事实性查询之外的反事实性查询。在本工作中,我们考虑线性模型和三种类型的查询:事实性、反事实性以及鲁棒反事实性。首先,对于任意一组查询,我们推导出新的数学公式,用于确定决策未知模型已知的分类区域,而无需恢复任何模型参数。其次,我们推导出在任意基于范数的距离下,使用(鲁棒)反事实性查询提取模型参数所需查询数量的界限。我们证明,当使用可微距离度量时,只需一个反事实性查询即可恢复完整模型。相比之下,当使用多面体距离时,所需查询数量与数据空间的维度成线性增长。对于鲁棒反事实性,后者所需的查询数量翻倍。因此,应用的距离函数和反事实性的鲁棒性对模型的安全性有显著影响。
英文摘要:
In model extraction attacks, the goal is to reveal the parameters of a black-box machine learning model by querying the model for a selected set of data points. Due to an increasing demand for explanations, this may involve counterfactual queries besides the typically considered factual queries. In this work, we consider linear models and three types of queries: factual, counterfactual, and robust counterfactual. First, for an arbitrary set of queries, we derive novel mathematical formulations for the classification regions for which the decision of the unknown model is known, without recovering any of the model parameters. Second, we derive bounds on the number of queries needed to extract the model's parameters for (robust) counterfactual queries under arbitrary norm-based distances. We show that the full model can be recovered using just a single counterfactual query when differentiable distance measures are employed. In contrast, when using polyhedral distances for instance, the number of required queries grows linearly with the dimension of the data space. For robust counterfactuals, the latter number of queries doubles. Consequently, the applied distance function and robustness of counterfactuals have a significant impact on the model's security.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。