1. Arora, S., Babai, L., Stern, J., et al. (1997). The hardness of approximate optima in lattices, codes, and systems of linear equations. Journal of Computer and System Sciences, 54(2), 317–331.
2. Bao, H., Niu, G., Sugiyama, M. (2018). Classification from pairwise similarity and unlabeled data. In: ICML.
3. Bartlett, P., Jordan, M., & McAuliffe, J. (2006). Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101, 138–156.
4. Blanchard, G., Lee, G., & Scott, C. (2010). Semi-supervised novelty detection. Journal of Machine Learning Research, 11(99), 2973–3009.
5. Buja, A., Stuetzle, W., & Shen, Y. (2005). Loss functions for binary class probability estimation and classification: Structure and applications. Philadelphia: University of Pennsylvania.