This paper has been withdrawn by Benchong Li Professor
No PDF available, click to view other formats
Abstract:In the realm of machine learning theory, to prevent unnatural coding schemes between teacher and learner, No-Clash Teaching Dimension was introduced as provably optimal complexity measure for collusion-free teaching. However, whether No-Clash Teaching Dimension is upper-bounded by Vapnik-Chervonenkis dimension remains unknown. In this paper, for any finite concept class, we construct fragments of size equals to its Vapnik-Chervonenkis dimension which identify concepts through an ordered compression scheme. Naturally, these fragments are used as teaching sets, one can easily see that they satisfy the non-clashing condition, i.e., this open question is resolved for finite concept classes.
From: Benchong Li Professor [view email]
[v1]
Tue, 24 Mar 2026 02:08:32 UTC (11 KB)
[v2]
Thu, 26 Mar 2026 10:32:26 UTC (1 KB) (withdrawn)
[v3]
Wed, 1 Apr 2026 11:58:42 UTC (10 KB)
[v4]
Mon, 3 Aug 2026 06:24:35 UTC (1 KB) (withdrawn)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。