Fetching the paper…
Reading the bibliography…
We present Re-weighted Gradient Descent (RGD), a novel optimization technique that improves the performance of deep neural networks through dynamic sample re-weighting.
Wiley-interscience series in discrete mathematics, 1983
AS Nemirovsky, DB Yudin, and ER DAWSON · 1983
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E Schapire · 1997
Earlier work this paper cites.
An overview of statistical learning theory
Vladimir N Vapnik · 1999
Earlier work this paper cites.
Random forests
Leo Breiman · 2001
Earlier work this paper cites.
Greedy function approximation: a gradient boosting machine
Jerome H Friedman · 2001
Earlier work this paper cites.
Improve unsupervised domain adaptation with mixup training
Shen Yan, Huan Song, Nanxiang Li, Lincan Zou, and Liu Ren · 2001
Earlier work this paper cites.
Smote: synthetic minority over-sampling technique
Nitesh V Chawla, Kevin W Bowyer, Lawrence O Hall, and W Philip Kegelmeyer · 2002
Earlier work this paper cites.
A framework for robust subspace learning
Fernando De La Torre and Michael J Black · 2003
Earlier work this paper cites.
Learning and evaluating classifiers under sample selection bias
Bianca Zadrozny · 2004
Earlier work this paper cites.
Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning
Ali Rahimi and Benjamin Recht · 2008
Earlier work this paper cites.
Robust optimization , volume 28
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski · 2009
Earlier work this paper cites.
Curriculum learning
Yoshua Bengio, Jérôme Louradour, Ronan Collobert, and Jason Weston · 2009
Earlier work this paper cites.
Self-paced learning for latent variable models
M Kumar, Benjamin Packer, and Daphne Koller · 2010
Earlier work this paper cites.
From baby steps to leapfrog: How “less is more” in unsupervised dependency parsing
Valentin I Spitkovsky, Hiyan Alshawi, and Dan Jurafsky · 2010
Earlier work this paper cites.
Relaxed clipping: A global training method for robust regression and classification
Min Yang, Linli Xu, Martha White, Dale Schuurmans, and Yao-liang Yu · 2010
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Earlier work this paper cites.
Learning specific-class segmentation from diverse data
M Pawan Kumar, Haithem Turki, Dan Preston, and Daphne Koller · 2011
Earlier work this paper cites.
On optimization methods for deep learning
Quoc V Le, Jiquan Ngiam, Adam Coates, Abhik Lahiri, Bobby Prochnow, and Andrew Y Ng · 2011
Earlier work this paper cites.
Learning the easy things first: Self-paced visual category discovery
Yong Jae Lee and Kristen Grauman · 2011
Earlier work this paper cites.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Earlier work this paper cites.
Kullback-leibler divergence constrained distributionally robust optimization
Zhaolin Hu and Jeff Liu Hong · 2012
Earlier work this paper cites.
Adadelta: an adaptive learning rate method
Matthew D Zeiler · 2012
Earlier work this paper cites.
Robust solutions of optimization problems affected by uncertain probabilities
Aharon Ben-Tal, Dick Den Hertog, Anja De Waegenaere, Bertrand Melenberg, and Gijs Rennen · 2013
Earlier work this paper cites.
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
Ohad Shamir and Tong Zhang · 2013
Earlier work this paper cites.
Wojciech Zaremba and Ilya Sutskever · 2014
Earlier work this paper cites.
Webly supervised learning of convolutional networks
Xinlei Chen and Abhinav Gupta · 2015
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik Kingma and Jimmy Ba · 2015
Earlier work this paper cites.
Curriculum learning of multiple tasks
Anastasia Pentina, Viktoriia Sharmanska, and Christoph H Lampert · 2015
Earlier work this paper cites.
Recurrent neural network language model adaptation with curriculum learning
Yangyang Shi, Martha Larson, and Catholijn M Jonker · 2015
Earlier work this paper cites.
A self-paced multiple-instance learning framework for co-saliency detection
Dingwen Zhang, Deyu Meng, Chao Li, Lu Jiang, Qian Zhao, and Junwei Han · 2015
Earlier work this paper cites.
Aligning books and movies: Towards story-like visual explanations by watching movies and reading books
Yukun Zhu, Ryan Kiros, Rich Zemel, Ruslan Salakhutdinov, Raquel Urtasun, Antonio Torralba, and Sanja Fidler · 2015
Earlier work this paper cites.
Domain-adversarial training of neural networks
Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario Marchand, and Victor Lempitsky · 2016
Earlier work this paper cites.
Robust sensitivity analysis for stochastic systems
Henry Lam · 2016
Earlier work this paper cites.
Learning to detect concepts from webly-labeled video data
Junwei Liang, Lu Jiang, Deyu Meng, and Alexander G Hauptmann · 2016
Earlier work this paper cites.
Stochastic gradient methods for distributionally robust optimization with f-divergences
Hongseok Namkoong and John C Duchi · 2016
Earlier work this paper cites.
Self-paced boost learning for classification
Te Pi, Xi Li, Zhongfei Zhang, Deyu Meng, Fei Wu, Jun Xiao, Yueting Zhuang, et al · 2016
Cited alongside, same era.
An overview of gradient descent optimization algorithms
Sebastian Ruder · 2016
Cited alongside, same era.
Training region-based object detectors with online hard example mining
Abhinav Shrivastava, Abhinav Gupta, and Ross Girshick · 2016
Cited alongside, same era.
Deep coral: Correlation alignment for deep domain adaptation
Baochen Sun and Kate Saenko · 2016
Cited alongside, same era.
How hard can it be? estimating the difficulty of visual search in an image
Radu Tudor Ionescu, Bogdan Alexe, Marius Leordeanu, Marius Popescu, Dim P Papadopoulos, and Vittorio Ferrari · 2016
Cited alongside, same era.
A curriculum learning method for improved noise robustness in automatic speech recognition
Distributionally robust neural networks
Shiori Sagawa*, Pang Wei Koh*, Tatsunori B. Hashimoto, and Percy Liang · 2020
Later among the works it cites.
Improving offline contextual bandits with distributional robustness
Otmane Sakhi, Louis Faury, and Flavian Vasile · 2020
Later among the works it cites.
Curriculum learning with diversity for supervised computer vision tasks
Petru Soviany · 2020
Later among the works it cites.
Vime: Extending the success of self-and semi-supervised learning to tabular domain
Jinsung Yoon, Yao Zhang, James Jordon, and Mihaela van der Schaar · 2020
Later among the works it cites.
Curriculum learning by dynamic instance hardness
Tianyi Zhou, Shengjie Wang, and Jeffrey Bilmes · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stefan Braun, Daniel Neil, and Shih-Chii Liu · 2017
Cited alongside, same era.
Self-paced learning: An implicit regularization perspective
Yanbo Fan, Ran He, Jian Liang, and Baogang Hu · 2017
Cited alongside, same era.
Model-agnostic meta-learning for fast adaptation of deep networks
Chelsea Finn, Pieter Abbeel, and Sergey Levine · 2017
Cited alongside, same era.
Cased: curriculum adaptive sampling for extreme data imbalance
Andrew Jesson, Nicolas Guizard, Sina Hamidi Ghalehjegh, Damien Goblot, Florian Soudan, and Nicolas Chapados · 2017
Cited alongside, same era.
Self-paced multi-task learning
Changsheng Li, Junchi Yan, Fan Wei, Weishan Dong, Qingshan Liu, and Hongyuan Zha · 2017
Cited alongside, same era.
Focal loss for dense object detection
Tsung-Yi Lin, Priya Goyal, Ross B. Girshick, Kaiming He, and Piotr Dollár · 2017
Cited alongside, same era.
Variance-based regularization with convex objectives
Hongseok Namkoong and John C Duchi · 2017
Cited alongside, same era.
Tabnet: Attentive interpretable tabular learning
Sercan Ö Arik and Tomas Pfister · 2021
Later among the works it cites.
Domain generalization by marginal transfer learning
Gilles Blanchard, Aniket Anand Deshmukh, Ürun Dogan, Gyemin Lee, and Clayton Scott · 2021
Later among the works it cites.
Swad: Domain generalization by seeking flat minima
Junbum Cha, Sanghyuk Chun, Kyungjae Lee, Han-Cheol Cho, Seunghyun Park, Yunsung Lee, and Sungrae Park · 2021
Later among the works it cites.
Sharpness-aware minimization for efficiently improving generalization
Pierre Foret, Ariel Kleiner, Hossein Mobahi, and Behnam Neyshabur · 2021
Later among the works it cites.
Optimizing loss functions through multi-variate taylor polynomial parameterization
Santiago Gonzalez and Risto Miikkulainen · 2021
Later among the works it cites.
In search of lost domain generalization
Ishaan Gulrajani and David Lopez-Paz · 2021
Later among the works it cites.
Out-of-distribution generalization via risk extrapolation (rex)
David Krueger, Ethan Caballero, Joern-Henrik Jacobsen, Amy Zhang, Jonathan Binas, Dinghuai Zhang, Remi Le Priol, and Aaron Courville · 2021
Later among the works it cites.
Constrained instance and class reweighting for robust learning under label noise
Abhishek Kumar and Ehsan Amid · 2021
Later among the works it cites.
Tilted empirical risk minimization
Tian Li, Ahmad Beirami, Maziar Sanjabi, and Virginia Smith · 2021
Later among the works it cites.
Exponentiated gradient reweighting for robust training under label noise and beyond
Negin Majidi, Ehsan Amid, Hossein Talebi, and Manfred K Warmuth · 2021
Later among the works it cites.
Reducing domain gap by reducing style bias
Hyeonseob Nam, HyunJae Lee, Jongchan Park, Wonjun Yoon, and Donggeun Yoo · 2021
Later among the works it cites.
An online method for a class of distributionally robust optimization with non-convex objectives
Qi Qi, Zhishuai Guo, Yi Xu, Rong Jin, and Tianbao Yang · 2021
Later among the works it cites.
Training data-efficient image transformers & distillation through attention
Hugo Touvron, Matthieu Cord, Matthijs Douze, Francisco Massa, Alexandre Sablayrolles, and Hervé Jégou · 2021
Later among the works it cites.
Subtab: Subsetting features of tabular data for self-supervised representation learning
Talip Ucar, Ehsan Hajiramezanali, and Lindsay Edwards · 2021
Later among the works it cites.
Towards domain-agnostic contrastive learning
Vikas Verma, Thang Luong, Kenji Kawaguchi, Hieu Pham, and Quoc Le · 2021
Later among the works it cites.
Doro: Distributional and outlier robust optimization
Runtian Zhai, Chen Dan, Zico Kolter, and Pradeep Ravikumar · 2021
Later among the works it cites.
Adaptive risk minimization: Learning to adapt to domain shift
Marvin Zhang, Henrik Marklund, Nikita Dhawan, Abhishek Gupta, Sergey Levine, and Chelsea Finn · 2021
Later among the works it cites.
Learning fast sample re-weighting without reward data
Zizhao Zhang and Tomas Pfister · 2021
Later among the works it cites.
Domain generalization by mutual-information regularization with pre-trained models
Junbum Cha, Kyungjae Lee, Sungrae Park, and Sanghyuk Chun · 2022
Later among the works it cites.
Stochastic reweighted gradient descent
Ayoub El Hanchi, David Stephens, and Chris Maddison · 2022
Later among the works it cites.
Polyloss: A polynomial expansion perspective of classification loss functions
Zhaoqi Leng, Mingxing Tan, Chenxi Liu, Ekin Dogus Cubuk, Jay Shi, Shuyang Cheng, and Dragomir Anguelov · 2022
Later among the works it cites.
Met: Masked encoding for tabular data
Kushal Majmundar, Sachin Goyal, Praneeth Netrapalli, and Prateek Jain · 2022
Later among the works it cites.
Curriculum learning: A survey
Petru Soviany, Radu Tudor Ionescu, Paolo Rota, and Nicu Sebe · 2022
Later among the works it cites.
Feature reconstruction from outputs can mitigate simplicity bias in neural networks
Sravanti Addepalli, Anshul Nasery, Venkatesh Babu Radhakrishnan, Praneeth Netrapalli, and Prateek Jain · 2023
Closest in time.
A challenge in reweighting data with bilevel optimization
Anastasia Ivanova and Pierre Ablin · 2023
Closest in time.
Revisiting gradient clipping: Stochastic bias and tight convergence guarantees
Anastasia Koloskova, Hadrien Hendrikx, and Sebastian U Stich · 2023
Closest in time.
The effect of diversity in meta-learning
Ramnath Kumar, Tristan Deleu, and Yoshua Bengio · 2023
Closest in time.
On tilted losses in machine learning: Theory and applications
Tian Li, Ahmad Beirami, Maziar Sanjabi, and Virginia Smith · 2023
Closest in time.
Attentional-biased stochastic gradient descent
Qi Qi, Yi Xu, Wotao Yin, Rong Jin, and Tianbao Yang · 2023
Closest in time.
MiniGPT-4: Enhancing vision-language understanding with advanced large language models
Deyao Zhu, Jun Chen, Xiaoqian Shen, Xiang Li, and Mohamed Elhoseiny · 2024
Closest in time.