Recent research in machine teaching has explored the instruction of any concept expressed in a universal language. In this compositional context, new experimental results have shown that there exist data teaching sets surprisingly shorter than the concept description itself. However, there exists a bound for those remarkable experimental findings through teaching size and concept complexity that we further explore here. As concepts are rarely taught in isolation we investigate the best configuration of concepts to teach a given set of concepts, where those that have been acquired first can be reused for the description of new ones. This new notion of conditional teaching size uncovers new insights, such as the interposition phenomenon: certain prior knowledge generates simpler compatible concepts that increase the teaching size of the concept that we want to teach. This does not happen for conditional Kolmogorov complexity. Furthermore, we provide an algorithm that constructs optimal curricula based on interposition avoidance. This paper presents a series of theoretical results, including their proofs, and some directions for future work. New research possibilities in curriculum teaching in compositional scenarios are now wide open to exploration.
Quadratic Upper Bound for Recursive Teaching Dimension of Finite VC Classes
Tsinghua University(清华大学);Peking University(北京大学)
本文研究了有限规模概念类的递归教学维数(RTD)与VC维数(VCD)之间的定量关系。概念类$\mathcal C \subseteq \{0, 1\}^n$的RTD由Zilles等人(2011)提出,是一种组合复杂性度量,其特征在于根据递归教学模型识别$\mathcal C$中的概念所需的最坏情况示例数。对于任何具有$\mathrm{VCD}(\mathcal C)=d$的有限概念类$\mathcal C \subseteq \{0,1\}^n$,Simon & Zilles(2015)提出了一个开放问题$\mathrm{RTD}(\mathcal C) = O(d)$,即,RTD的上界是由VCD决定的吗?以前,最著名的结果是Chen等人(2016)的指数上限$\mathrm{RTD}(\mathcal C) = O(d \cdot 2^d)$。在本文中,我们展示了一个二次上限:$\mathrm{RTD}(\mathcal C) = O(d^2)$,更接近于一个开放的问题的答案。我们还讨论了充分解决问题的挑战。
Benchmarking Tabular Foundation Models for Conditional Density Estimation in Regression
Department of Statistics, Federal University of São Carlos (UFSCar)(圣卡洛斯联邦大学统计系);Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LJK(格勒诺布尔阿尔卑斯大学、法国国家信息与自动化研究所、法国国家科学研究中心、格勒诺布尔国立理工学院、让·库尔坦数学实验室)
Using a Conditional Generative Adversarial Network to Control the Statistical Characteristics of Generated Images for IACT Data Analysis
Skobeltsyn Institute of Nuclear Physics, Lomonosov Moscow State University(罗蒙诺索夫莫斯科国立大学斯科别利岑核物理研究所);Applied Physics Institute of Irkutsk State University(伊尔库茨克国立大学应用物理研究所);Lomonosov Moscow State University(罗蒙诺索夫莫斯科国立大学)