arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.06359cs.LGcs.CR
收藏

微型、硬件无关、基于压缩的分类

Tiny, Hardware-Independent, Compression-based Classification

Institute for Experiential AI, Northeastern University, Boston, United States(体验人工智能研究所,东北大学,波士顿,美国);Department of Computer Science, Umeå University, Umeå, Sweden(计算机科学系,乌梅拉大学,乌梅拉,瑞典)

Charles Meyers, Aaron MacSween, Erik Elmroth, Tommy Löfstedt

AI总结:

本文提出基于压缩的距离度量方法,用于在客户端设备上高效进行分类,实现高准确率的同时降低计算成本。

摘要:

最近机器学习的发展突显了在线平台与其用户在隐私方面的冲突。用户隐私的重要性以及对用户数据的权力斗争随着监管机构和运营商试图监管在线平台而变得更加激烈。随着用户对隐私问题越来越关注,客户端的数据存储、管理和分析已成为大规模集中式机器学习的首选方法。然而,最先进的机器学习方法需要大量的标记用户数据,这使得只能访问单个用户数据的模型不适用。最先进的方法计算成本也高,这会降低在计算受限硬件上的用户体验,并减少电池寿命。最近的替代方法在各种数据上的分类任务中证明了其显著的成功——使用基于压缩的距离度量(称为归一化压缩距离)来测量经典距离基机器学习方法中通用对象之间的距离。在本工作中,我们证明归一化压缩距离实际上不是度量;将其扩展到更广泛的内核方法背景下,以允许对复杂数据建模;并提出技术来改进使用这种距离度量的模型的训练时间。我们证明归一化压缩距离在性能上与其它度量和内核相当,有时甚至更好——尽管缺乏正式的度量属性。最终结果是一个简单但准确的模型,即使在训练时只使用极少量样本的情况下也能运行,允许在客户端设备上仅使用用户提供的数据运行小型且有效的模型。

英文摘要:

The recent developments in machine learning have highlighted a conflict between online platforms and their users in terms of privacy. The importance of user privacy and the struggle for power over user data has been intensified as regulators and operators attempt to police online platforms. As users have become increasingly aware of privacy issues, client-side data storage, management, and analysis have become a favoured approach to large-scale centralised machine learning. However, state-of-the-art machine learning methods require vast amounts of labelled user data, making them unsuitable for models that reside client-side and only have access to a single user's data. State-of-the-art methods are also computationally expensive, which degrades the user experience on compute-limited hardware and also reduces battery life. A recent alternative approach has proven remarkably successful in classification tasks across a wide variety of data -- using a compression-based distance measure (called normalised compression distance) to measure the distance between generic objects in classical distance-based machine learning methods. In this work, we demonstrate that the normalised compression distance is actually not a metric; develop it for the wider context of kernel methods to allow modelling of complex data; and present techniques to improve the training time of models that use this distance measure. We demonstrate that the normalised compression distance works as well as and sometimes better than other metrics and kernels -- while requiring only marginally more computational costs and in spite of the lack of formal metric properties. The end results is a simple model with remarkable accuracy even when trained on a very small number of samples allowing for models that are small and effective enough to run entirely on a client device using only user-supplied data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑