Fetching the paper…
Reading the bibliography…
This paper aims to provide a better understanding of a symmetric loss.
On optimum recognition error and reject tradeoff
Chow, C. K · 1970
Earlier work this paper cites.
On the sample complexity of noise-tolerant learning
Aslam, J. A. and Decatur, S. E · 1996
Earlier work this paper cites.
The mnist database of handwritten digits
LeCun, Y · 1998
Earlier work this paper cites.
Sample-efficient strategies for learning in the presence of noise
Cesa-Bianchi, N., Dichterman, E., Fischer, P., Shamir, E., and Simon, H. U · 1999
Earlier work this paper cites.
KDD Cup 2001 report
Cheng, J., Hatzis, C., Hayashi, H., Krogel, M.-A., Morishita, S., Page, D., and Sese, J · 2002
Earlier work this paper cites.
On the difficulty of approximately maximizing agreements
Ben-David, S., Eiron, N., and Long, P. M · 2003
Earlier work this paper cites.
Statistical behavior and consistency of classification methods based on convex risk minimization
Zhang, T · 2004
Earlier work this paper cites.
Loss functions for binary class probability estimation and classification: Structure and applications
Buja, A., Stuetzle, W., and Shen, Y · 2005
Earlier work this paper cites.
Result analysis of the NIPS 2003 feature selection challenge
Guyon, I., Gunn, S., Ben-Hur, A., and Dror, G · 2005
Earlier work this paper cites.
Convexity, classification, and risk bounds
Bartlett, P. L., Jordan, M. I., and McAuliffe, J. D · 2006
Earlier work this paper cites.
Sparseness vs estimating conditional probabilities: Some asymptotic results
Bartlett, P. L. and Tewari, A · 2007
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Krizhevsky, A. and Hinton, G · 2009
Earlier work this paper cites.
On the design of loss functions for classification: theory, robustness to outliers, and savageboost
Masnadi-Shirazi, H. and Vasconcelos, N · 2009
Earlier work this paper cites.
Semi-supervised novelty detection
Blanchard, G., Lee, G., and Scott, C · 2010
Earlier work this paper cites.
Random classification noise defeats all convex potential boosters
Long, P. M. and Servedio, R. A · 2010
Earlier work this paper cites.
Rectified linear units improve restricted boltzmann machines
Nair, V. and Hinton, G. E · 2010
Earlier work this paper cites.
Composite binary losses
Reid, M. D. and Williamson, R. C · 2010
Cited alongside, same era.
Classification methods with reject option based on convex risk minimization
Yuan, M. and Wegkamp, M · 2010
Cited alongside, same era.
Support vector machines under adversarial label noise
Biggio, B., Nelson, B., and Laskov, P · 2011
Cited alongside, same era.
LIBSVM: a library for support vector machines
Chang, C.-C. and Lin, C.-J · 2011
Cited alongside, same era.
Agnostic learning of monomials by halfspaces is hard
Feldman, V., Guruswami, V., Raghavendra, P., and Wu, Y · 2012
Cited alongside, same era.
UCI machine learning repository, 2013
Lichman, M. et al · 2013
Cited alongside, same era.
Noise tolerance under risk minimization
Learning from corrupted binary labels via class-probability estimation
Menon, A., van Rooyen, B., Ong, C. S., and Williamson, B · 2015
Later among the works it cites.
A rate of convergence for mixture proportion estimation, with application to learning from noisy labels
Scott, C · 2015
Later among the works it cites.
Chainer: a next-generation open source framework for deep learning
Tokui, S., Oono, K., Hido, S., and Clayton, J · 2015
Later among the works it cites.
Bipartite ranking: a risk-theoretic perspective
Menon, A. K. and Williamson, R. C · 2016
Later among the works it cites.
Theoretical comparisons of positive-unlabeled learning against positive-negative learning
Niu, G., du Plessis, M. C., Sakai, T., Ma, Y., and Sugiyama, M · 2016
Later among the works it cites.
Robust loss functions under label noise for deep neural networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Manwani, N. and Sastry, P · 2013
Cited alongside, same era.
On the relationship between binary classification, bipartite ranking, and binary class probability estimation
Narasimhan, H. and Agarwal, S · 2013
Cited alongside, same era.
Learning with noisy labels
Natarajan, N., Dhillon, I. S., Ravikumar, P. K., and Tewari, A · 2013
Cited alongside, same era.
Classification with asymmetric label noise: Consistency and maximal denoising
Scott, C., Blanchard, G., and Handy, G · 2013
Cited alongside, same era.
Analysis of learning from positive and unlabeled data
du Plessis, M. C., Niu, G., and Sugiyama, M · 2014
Cited alongside, same era.
Dropout: a simple way to prevent neural networks from overfitting
Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., and Salakhutdinov, R · 2014
Cited alongside, same era.
Ghosh, A., Kumar, H., and Sastry, P · 2017
Later among the works it cites.
Learning from complementary labels
Ishida, T., Niu, G., Hu, W., and Sugiyama, M · 2017
Later among the works it cites.
Positive-unlabeled learning with non-negative risk estimator
Kiryo, R., Niu, G., du Plessis, M. C., and Sugiyama, M · 2017
Later among the works it cites.
Automatic differentiation in pytorch
Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., and Lerer, A · 2017
Later among the works it cites.
A brief introduction to weakly supervised learning
Zhou, Z.-H · 2017
Later among the works it cites.
Classification from pairwise similarity and unlabeled data
Bao, H., Niu, G., and Sugiyama, M · 2018
Later among the works it cites.
Binary classification from positive-confidence data
Ishida, T., Niu, G., and Sugiyama, M · 2018
Later among the works it cites.
On the minimal supervision for training any binary classifier from only unlabeled data
Lu, N., Niu, G., Menon, A. K., and Sugiyama, M · 2018
Later among the works it cites.
On the convergence of Adam and beyond
Reddi, S. J., Kale, S., and Kumar, S · 2018
Later among the works it cites.
Semi-supervised auc optimization based on positive-unlabeled learning
Sakai, T., Niu, G., and Sugiyama, M · 2018
Later among the works it cites.