[HTML][HTML] Curriculum learning: A survey

P Soviany, RT Ionescu, P Rota, N Sebe - International Journal of …, 2022 - Springer
Training machine learning models in a meaningful order, from the easy samples to the hard
ones, using curriculum learning can provide performance improvements over the standard …

Hybrid curriculum learning for emotion recognition in conversation

L Yang, Y Shen, Y Mao, L Cai - Proceedings of the AAAI Conference on …, 2022 - ojs.aaai.org
Emotion recognition in conversation (ERC) aims to detect the emotion label for each
utterance. Motivated by recent studies which have proven that feeding training examples in …

Efficienttrain: Exploring generalized curriculum learning for training visual backbones

Y Wang, Y Yue, R Lu, T Liu, Z Zhong… - Proceedings of the …, 2023 - openaccess.thecvf.com
The superior performance of modern deep networks usually comes with a costly training
procedure. This paper presents a new curriculum learning approach for the efficient training …

Learning Rate Curriculum

FA Croitoru, NC Ristea, RT Ionescu, N Sebe - International Journal of …, 2024 - Springer
Most curriculum learning methods require an approach to sort the data samples by difficulty,
which is often cumbersome to perform. In this work, we propose a novel curriculum learning …

Curml: A curriculum machine learning library

Y Zhou, H Chen, Z Pan, C Yan, F Lin, X Wang… - Proceedings of the 30th …, 2022 - dl.acm.org
Curriculum learning (CL) is a machine learning paradigm gradually learning from easy to
hard, which is inspired by human curricula. As an easy-to-use and general training strategy …

CBM: Curriculum by Masking

A Jarca, FA Croitoru, RT Ionescu - arXiv preprint arXiv:2407.05193, 2024 - arxiv.org
We propose Curriculum by Masking (CBM), a novel state-of-the-art curriculum learning
strategy that effectively creates an easy-to-hard training schedule via patch (token) masking …

On adversarial robustness and the use of wasserstein ascent-descent dynamics to enforce it

CG Trillos, NG Trillos - arXiv preprint arXiv:2301.03662, 2023 - arxiv.org
We propose iterative algorithms to solve adversarial problems in a variety of supervised
learning settings of interest. Our algorithms, which can be interpreted as suitable ascent …

[HTML][HTML] Towards solving NLP tasks with optimal transport loss

R Bhardwaj, T Vaidya, S Poria - Journal of King Saud University-Computer …, 2022 - Elsevier
Loss functions are essential to computing the divergence of a model's predicted distribution
from the ground truth. Such functions play a vital role in machine learning algorithms as they …

EfficientTrain++: Generalized Curriculum Learning for Efficient Visual Backbone Training

Y Wang, Y Yue, R Lu, Y Han, S Song… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
The superior performance of modern computer vision backbones (eg, vision Transformers
learned on ImageNet-1K/22K) usually comes with a costly training procedure. This study …

On challenges in unsupervised domain generalization

V Narayanan, AA Deshmukh, U Dogan… - … 2021 Workshop on …, 2022 - proceedings.mlr.press
Abstract Domain Generalization (DG) aims to learn a model from a labeled set of source
domains which can generalize to an unseen target domain. Although an important stepping …