中文
相关论文

相关论文: Optimal Collusion-Free Teaching

200 篇论文

Recently, Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and showed it is the most efficient machine teaching model satisfying the Goldman-Mathias collusion-avoidance criterion. A teaching map…

计算复杂性 · 计算机科学 2024-07-30 Jérémie Chalopin , Victor Chepoi , Fionn Mc Inerney , Sébastien Ratel

Quite recently a teaching model, called "No-Clash Teaching" or simply "NC-Teaching", had been suggested that is provably optimal in the following strong sense. First, it satisfies Goldman and Matthias' collusion-freeness condition. Second,…

组合数学 · 数学 2022-05-06 Hans U. Simon

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…

信息论 · 计算机科学 2026-04-02 Jiahua Liu , Benchong Li

Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and proved that it is the most efficient batch machine teaching model satisfying the collusion-avoidance benchmark established in the seminal work…

计算复杂性 · 计算机科学 2026-03-25 Sujoy Bhore , Liana Khazaliya , Fionn Mc Inerney

We study the classical and parameterized complexity of computing the positive non-clashing teaching dimension of a set of concepts, that is, the smallest number of examples per concept required to successfully teach an intelligent learner…

计算复杂性 · 计算机科学 2025-03-12 Robert Ganian , Liana Khazaliya , Fionn Mc Inerney , Mathis Rocton

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…

机器学习 · 计算机科学 2021-07-16 Manuel Garcia-Piqueras , José Hernández-Orallo

Novel class discovery (NCD) aims at learning a model that transfers the common knowledge from a class-disjoint labelled dataset to another unlabelled dataset and discovers new classes (clusters) within it. Many methods, as well as elaborate…

计算机视觉与模式识别 · 计算机科学 2023-03-24 Wenbin Li , Zhichen Fan , Jing Huo , Yang Gao

In this work, we define cost-free learning (CFL) formally in comparison with cost-sensitive learning (CSL). The main difference between them is that a CFL approach seeks optimal classification results without requiring any cost information,…

机器学习 · 计算机科学 2013-07-23 Xiaowan Zhang , Bao-Gang Hu

Recent semi-supervised object detection (SSOD) has achieved remarkable progress by leveraging unlabeled data for training. Mainstream SSOD methods rely on Consistency Regularization methods and Exponential Moving Average (EMA), which form a…

计算机视觉与模式识别 · 计算机科学 2024-05-24 Liyu Chen , Huaao Tang , Yi Wen , Hanting Chen , Wei Li , Junchao Liu , Jie Hu

We propose a new paradigm for zero-shot learners that is format agnostic, i.e., it is compatible with any format and applicable to a list of language tasks, such as text classification, commonsense reasoning, coreference resolution, and…

计算与语言 · 计算机科学 2022-10-19 Ping Yang , Junjie Wang , Ruyi Gan , Xinyu Zhu , Lin Zhang , Ziwei Wu , Xinyu Gao , Jiaxing Zhang , Tetsuya Sakai

In this paper, we present the combined learning-and-control (CLC) approach, which is a new way to solve optimal control problems with unknown dynamics by unifying model-based control and data-driven learning. The key idea is simple: we…

系统与控制 · 电气工程与系统科学 2025-10-02 Panagiotis Kounatidis , Andreas A. Malikopoulos

Imagine a learner L who tries to infer a hidden concept from a collection of observations. Building on the work [4] of Ferri et al., we assume the learner to be parameterized by priors P(c) and by c-conditional likelihoods P(z|c) where c…

机器学习 · 计算机科学 2023-07-12 Hans Ulrich Simon , Jan Arne Telle

Machine learning is a vital part of many real-world systems, but several concerns remain about the lack of interpretability, explainability and robustness of black-box AI systems. Concept Bottleneck Models (CBM) address some of these…

机器学习 · 统计学 2025-10-24 Hidde Fokkema , Tim van Erven , Sara Magliacane

It is necessary to improve the performance of some special classes or to particularly protect them from attacks in adversarial learning. This paper proposes a framework combining cost-sensitive classification and adversarial learning…

机器学习 · 计算机科学 2022-06-24 Haojing Shen , Sihong Chen , Ran Wang , Xizhao Wang

We introduce the problem of model selection for contextual bandits, where a learner must adapt to the complexity of the optimal policy while balancing exploration and exploitation. Our main result is a new model selection guarantee for…

机器学习 · 计算机科学 2019-11-15 Dylan J. Foster , Akshay Krishnamurthy , Haipeng Luo

Curriculum Learning (CL) is a technique of training models via ranking examples in a typically increasing difficulty trend with the aim of accelerating convergence and improving generalisability. Current approaches for Natural Language…

计算与语言 · 计算机科学 2022-11-28 Fenia Christopoulou , Gerasimos Lampouras , Ignacio Iacobacci

Online learning algorithms often face a fundamental trilemma: balancing regret guarantees between adversarial and stochastic settings and providing baseline safety against a fixed comparator. While existing methods excel in one or two of…

机器学习 · 计算机科学 2026-05-29 Ting Hu , Luanda Cai , Emmanouil-Vasileios Vlatakis-Gkaragkounis

The rapid increase in multimodal data availability has sparked significant interest in cross-modal knowledge distillation (KD) techniques, where richer "teacher" modalities transfer information to weaker "student" modalities during model…

机器学习 · 计算机科学 2025-10-16 Rongrong Xie , Yizhou Xu , Guido Sanguinetti

Robustness, domain adaptation, photometric/occlusion invariance, sensor drift, and alignment style are treated as separate literatures with separate method families. Under label-preserving deployment shift they share one geometric object:…

机器学习 · 计算机科学 2026-05-26 Vishal Rajput

Modeling the spread of social contagions is central to various applications in social computing. In this paper, we study the learnability of the competitive threshold model from a theoretical perspective. We demonstrate how competitive…

机器学习 · 计算机科学 2022-05-10 Yifan Wang , Guangmo Tong
‹ 上一页 1 2 3 10 下一页 ›