.png){kind=icon}
Return
Time-constrained learning
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2023.109672.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Consider a scenario in which we have a huge labeled dataset D and a limited time to train a given learner using D. Since we may not be able to use the whole dataset, how should we proceed? We propose TCT, an algorithm for this task, whose design relies on principles from Machine Teaching. We present an experimental study involving 5 different learners and 20 datasets where we show that TCT consistently outperforms alternative teaching/training methods, namely: (1) Training over batches of random samples, until the time limit is reached; (2) The state-of-the-art Machine Teaching algorithm for black-box learners proposed in [Dasgupta et al., ICML 19], and (3) Stochastic Gradient Descent (when applicable). While our work is primarily practical, we also show that a stripped-down version of TCT has provable guarantees.& COPY; 2023 Elsevier Ltd. All rights reserved.
Keywords:
Machine teaching
Time-constrained learning
Classification methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveA novel active learning framework for classification: Using weighted rank aggregation to achieve multiple query criteria.png)
PATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAIShareSaveSI(FS)2 : Fast simultaneous instance and feature selection for datasets with many featuresPATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAIShareSaveShareSave no more
no more