Fetching the paper…
Reading the bibliography…
Data augmentation forms the cornerstone of many modern machine learning training pipelines; yet, the mechanisms by which it works are not clearly understood.
A. N. Tikhonov, “On the solution of ill-posed problems and the method of regularization,” in Doklady akademii nauk , vol. 151, no. 3. Russian Academy of Sciences, 1963, pp. 501–504
1963
Earlier work this paper cites.
K. Fukushima and S. Miyake, “Neocognitron: A self-organizing neural network model for a mechanism of visual pattern recognition,” in Competition and cooperation in neural nets . Springer, 1982, pp. 267–285
1982
Earlier work this paper cites.
S. Hanson and L. Pratt, “Comparing biases for minimal network construction with back-propagation,” Advances in neural information processing systems , vol. 1, 1988
1988
Earlier work this paper cites.
H. S. Baird, “Document image defect models,” Structured Document Image Analysis , pp. 546–556, 1992
1992
Earlier work this paper cites.
C. M. Bishop, “Training with noise is equivalent to tikhonov regularization,” Neural computation , vol. 7, no. 1, pp. 108–116, 1995
1995
Earlier work this paper cites.
L. Yaeger, R. Lyon, and B. Webb, “Effective training of a neural network character classifier for word recognition,” Advances in neural information processing systems , vol. 9, 1996
1996
Earlier work this paper cites.
L. S. Shapley, “A value for n-person games,” Classics in game theory , vol. 69, 1997
1997
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
V. Vapnik, The nature of statistical learning theory . Springer science & business media, 1999
1999
Earlier work this paper cites.
O. Chapelle, J. Weston, L. Bottou, and V. Vapnik, “Vicinal risk minimization,” Advances in neural information processing systems , vol. 13, 2000
2000
Earlier work this paper cites.
N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, “Smote: synthetic minority over-sampling technique,” Journal of artificial intelligence research , vol. 16, pp. 321–357, 2002
2002
Earlier work this paper cites.
G. E. Batista, R. C. Prati, and M. C. Monard, “A study of the behavior of several methods for balancing machine learning training data,” ACM SIGKDD explorations newsletter , vol. 6, no. 1, pp. 20–29, 2004
2004
Earlier work this paper cites.
R. C. Prati, G. E. Batista, and M. C. Monard, “Class imbalances versus class overlapping: an analysis of a learning system behavior,” in Mexican international conference on artificial intelligence . Springer, 2004, pp. 312–321
2004
Earlier work this paper cites.
T. Jo and N. Japkowicz, “Class imbalances versus small disjuncts,” ACM Sigkdd Explorations Newsletter , vol. 6, no. 1, pp. 40–49, 2004
2004
Earlier work this paper cites.
G. M. Weiss, “Mining with rarity: a unifying framework,” ACM Sigkdd Explorations Newsletter , vol. 6, no. 1, pp. 7–19, 2004
2004
Earlier work this paper cites.
Y. Bengio, O. Delalleau, and N. Roux, “The curse of highly variable functions for local kernel machines,” Advances in neural information processing systems , vol. 18, 2005
2005
Earlier work this paper cites.
C. M. Bishop and N. M. Nasrabadi, Pattern recognition and machine learning . Springer, 2006, vol. 4, no. 4
2006
Earlier work this paper cites.
V. García, J. Sánchez, and R. Mollineda, “An empirical study of the behavior of classifiers on imbalanced and overlapped data sets,” in Iberoamerican congress on pattern recognition . Springer, 2007, pp. 397–406
2007
Earlier work this paper cites.
H. He, Y. Bai, E. A. Garcia, and S. Li, “Adasyn: Adaptive synthetic sampling approach for imbalanced learning,” in 2008 IEEE international joint conference on neural networks (IEEE world congress on computational intelligence) . IEEE, 2008, pp. 1322–1328
2008
Earlier work this paper cites.
M. Sokolova and G. Lapalme, “A systematic analysis of performance measures for classification tasks,” Information processing & management , vol. 45, no. 4, pp. 427–437, 2009
2009
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
M. Denil and T. Trappenberg, “Overlap versus imbalance,” in Canadian conference on artificial intelligence . Springer, 2010, pp. 220–231
2010
Earlier work this paper cites.
G. H. Golub and C. F. Van Loan, Matrix computations . JHU press, 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
R. Blagus and L. Lusa, “Smote for high-dimensional class-imbalanced data,” BMC bioinformatics , vol. 14, pp. 1–16, 2013
2013
Earlier work this paper cites.
N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting,” The journal of machine learning research , vol. 15, no. 1, pp. 1929–1958, 2014
2014
Cited alongside, same era.
T. Ko, V. Peddinti, D. Povey, and S. Khudanpur, “Audio augmentation for speech recognition,” in Sixteenth annual conference of the international speech communication association , 2015
2015
Cited alongside, same era.
B. Krawczyk, “Learning from imbalanced data: open challenges and future directions,” Progress in Artificial Intelligence , vol. 5, no. 4, pp. 221–232, 2016
2016
Cited alongside, same era.
C. Huang, Y. Li, C. C. Loy, and X. Tang, “Learning deep representation for imbalanced classification,” in 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016 . IEEE Computer Society, 2016, pp. 5375–5384
2016
Cited alongside, same era.
2019
Later among the works it cites.
T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” in International conference on machine learning . PMLR, 2020, pp. 1597–1607
2020
Later among the works it cites.
K. He, H. Fan, Y. Wu, S. Xie, and R. Girshick, “Momentum contrast for unsupervised visual representation learning,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2020, pp. 9729–9738
2020
Later among the works it cites.
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…
C. Szegedy, V. Vanhoucke, S. Ioffe, J. Shlens, and Z. Wojna, “Rethinking the inception architecture for computer vision,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2016, pp. 2818–2826
2016
Cited alongside, same era.
M. T. Ribeiro, S. Singh, and C. Guestrin, “” why should i trust you?” explaining the predictions of any classifier,” in Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining , 2016, pp. 1135–1144
2016
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2016, pp. 770–778
2016
Cited alongside, same era.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” Communications of the ACM , vol. 60, no. 6, pp. 84–90, 2017
2017
Cited alongside, same era.
D. Dua and C. Graff, “UCI machine learning repository,” 2017. [Online]. Available: http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
B. Zhou, A. Lapedriza, A. Khosla, A. Oliva, and A. Torralba, “Places: A 10 million image database for scene recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2017
2017
Cited alongside, same era.
2020
Later among the works it cites.
S. Wu, H. Zhang, G. Valiant, and C. Ré, “On the generalization effects of linear transformations in data augmentation,” in International Conference on Machine Learning . PMLR, 2020, pp. 10 410–10 420
2020
Later among the works it cites.
S. Chen, E. Dobriban, and J. H. Lee, “A group-theoretic framework for data augmentation,” The Journal of Machine Learning Research , vol. 21, no. 1, pp. 9885–9955, 2020
2020
Later among the works it cites.
M. Sundararajan and A. Najmi, “The many shapley values for model explanation,” in International conference on machine learning . PMLR, 2020, pp. 9269–9278
2020
Later among the works it cites.
2020
Later among the works it cites.
M. Ilse, J. M. Tomczak, and P. Forré, “Selecting data augmentation for simulating interventions,” in International Conference on Machine Learning . PMLR, 2021, pp. 4555–4562
2021
Later among the works it cites.
M. Koziarski, C. Bellinger, and M. Wozniak, “RB-CCR: radial-based combined cleaning and resampling algorithm for imbalanced data classification,” Mach. Learn. , vol. 110, no. 11, pp. 3059–3093, 2021
2021
Later among the works it cites.
M. J. Siers and M. Z. Islam, “Class imbalance and cost-sensitive decision trees: A unified survey based on a core similarity,” ACM Trans. Knowl. Discov. Data , vol. 15, no. 1, pp. 4:1–4:31, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
B. Li, Y. Hou, and W. Che, “Data augmentation approaches in natural language processing: A survey,” AI Open , vol. 3, pp. 71–90, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
R. Shen, S. Bubeck, and S. Gunasekar, “Data augmentation as feature manipulation,” in International Conference on Machine Learning . PMLR, 2022, pp. 19 773–19 808
2022
Later among the works it cites.
Z. Allen-Zhu and Y. Li, “Feature purification: How adversarial training performs robust deep learning,” in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) . IEEE, 2022, pp. 977–988
2022
Later among the works it cites.
2022
Later among the works it cites.
W. Wegier, M. Koziarski, and M. Wozniak, “Multicriteria classifier ensemble learning for imbalanced data,” IEEE Access , vol. 10, pp. 16 807–16 818, 2022
2022
Later among the works it cites.
D. Dablain, B. Krawczyk, and N. V. Chawla, “Deepsmote: Fusing deep learning and smote for imbalanced data,” IEEE Transactions on Neural Networks and Learning Systems , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Goodman, S. Sarkani, and T. Mazzuchi, “Distance-based probabilistic data augmentation for synthetic minority oversampling,” ACM/IMS Transactions on Data Science (TDS) , vol. 2, no. 4, pp. 1–18, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
D. Elreedy, A. F. Atiya, and F. Kamalov, “A theoretical distribution analysis of synthetic minority oversampling technique (smote) for imbalanced learning,” Machine Learning , pp. 1–21, 2023
2023
Closest in time.