...
首页> 外文期刊>JMLR: Workshop and Conference Proceedings >Near-Optimal Machine Teaching via Explanatory Teaching Sets
【24h】

Near-Optimal Machine Teaching via Explanatory Teaching Sets

机译:通过解释性教学集进行近乎最佳的机器教学

获取原文
           

摘要

Modern applications of machine teaching for humans often involve domain-specific, non- trivial target hypothesis classes. To facilitate understanding of the target hypothesis, it is crucial for the teaching algorithm to use examples which are interpretable to the human learner. In this paper, we propose NOTES, a principled framework for constructing interpretable teaching sets, utilizing explanations to accelerate the teaching process. Our algorithm is built upon a natural stochastic model of learners and a novel submodular surrogate objective function which greedily selects interpretable teaching examples. We prove that NOTES is competitive with the optimal explanation-based teaching strategy. We further instantiate NOTES with a specific hypothesis class, which can be viewed as an interpretable approximation of any hypothesis class, allowing us to handle complex hypothesis in practice. We demonstrate the effectiveness of NOTES on several image classification tasks, for both simulated and real human learners. Our experimental results suggest that by leveraging explanations, one can significantly speed up teaching.
机译:人类机器教学的现代应用通常涉及特定领域的,非平凡的目标假设类。为了促进对目标假设的理解,对于教学算法而言,至关重要的是要使用人类学习者可以解释的示例。在本文中,我们提出了NOTES,这是用于构建可解释的教学集的原理性框架,它利用解释来加速教学过程。我们的算法基于学习者的自然随机模型和贪婪地选择可解释的教学示例的新型亚模替代目标函数。我们证明NOTES与基于解释的最佳教学策略具有竞争力。我们进一步使用特定的假设类别实例化NOTES,可以将其视为任何假设类别的可解释近似值,从而使我们能够在实践中处理复杂的假设。我们证明了NOTES在模拟和真实人类学习者的几种图像分类任务上的有效性。我们的实验结果表明,通过利用解释,可以显着加快教学速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号