Fetching the paper…
Reading the bibliography…
We present an algorithm for solving binary classification problems when the dataset is not fully representative of the problem being solved, and obtaining more data is not possible.
Dokl. Akad. Nauk SSSR 121
Markov, A.: The insolubility of the problem of homeomorphy · 1958
Earlier work this paper cites.
Transactions of the American Mathematical Society 93
Federer, H.: Curvature measures · 1959
Earlier work this paper cites.
Commun. ACM 27
Valiant, L.G.: A theory of the learnable · 1972
Earlier work this paper cites.
Machine Learning 2
Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm · 1988
Earlier work this paper cites.
In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC ’89, p. 433–444. Association for Computing Machinery, New York, NY, USA (1989)
Kearns, M., Valiant, L.G.: Crytographic limitations on learning boolean formulae and finite automata · 1989
Earlier work this paper cites.
Machine Learning 5
Schapire, R.E.: The strength of weak learnability · 1990
Earlier work this paper cites.
In: R.S. Acharya, D.B. Goldgof (eds.) Biomedical Image Processing and Biomedical Visualization, vol. 1905, pp. 861 – 870. International Society for Optics and Photonics, SPIE (1993)
Street, W.N., Wolberg, W.H., Mangasarian, O.L.: Nuclear feature extraction for breast tumor diagnosis · 1993
Earlier work this paper cites.
J. ACM 41
Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata · 1994
Earlier work this paper cites.
J. Comb. Theory Ser. A 69
Haussler, D.: Sphere packing numbers for subsets of the boolean n-cube with bounded vapnik-chervonenkis dimension · 1995
Earlier work this paper cites.
Operations Research 4
Mangasarian, O.L., Street, W.N., Wolberg, W.H.: Breast cancer diagnosis and prognosis via linear programming · 1995
Earlier work this paper cites.
J. ACM 44
Alon, N., Ben-David, S., Cesa-Bianchi, N., Haussler, D.: Scale-sensitive dimensions, uniform convergence, and learnability · 1997
Earlier work this paper cites.
The Canadian Journal of Statistics / La Revue Canadienne de Statistique 26
Hampel, F.: Is statistics too difficult? · 1998
Earlier work this paper cites.
J. ACM 45
Kearns, M.: Efficient noise-tolerant learning from statistical queries · 1998
Earlier work this paper cites.
In: T. Dietterich, S. Becker, Z. Ghahramani (eds.) Advances in Neural Information Processing Systems, vol. 14. MIT Press (2001)
Amari, S.i., Park, H., Ozeki, T.: Geometrical singularities in the neuromanifold of multilayer perceptrons · 2001
Earlier work this paper cites.
In: Proceedings of the 12th International Conference on Algorithmic Learning Theory, ALT ’01, p. 12–31. Springer-Verlag, Berlin, Heidelberg (2001)
Angluin, D.: Queries revisited · 2001
Earlier work this paper cites.
In: D. Hand, D. Keim, R. Ng (eds.) Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 289–296 (2002)
Bennett, K., Demiriz, A., Maclin, R.: Exploiting unlabeled data in ensemble methods · 2002
Earlier work this paper cites.
Machine Learning 48
Collins, M., Schapire, R.E., Singer, Y.: Logistic regression, adaboost and bregman distances · 2002
Earlier work this paper cites.
Journal of the American Statistical Association 101
Bartlett, P.L., Jordan, M.I., Mcauliffe, J.D.: Convexity, classification, and risk bounds · 2006
Earlier work this paper cites.
In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 535–541 (2006)
Buciluǎ, C., Caruana, R., Niculescu-Mizil, A.: Model compression · 2006
Earlier work this paper cites.
In: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, SCG ’06, p. 319–326. Association for Computing Machinery, New York, NY, USA (2006)
Chazal, F., Cohen-Steiner, D., Lieutier, A.: A sampling theory for compact sets in euclidean space · 2006
Earlier work this paper cites.
In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’06, p. 553–562. IEEE Computer Society, USA (2006)
Klivans, A.R., Sherstov, A.A.: Cryptographic hardness for learning intersections of halfspaces · 2006
Earlier work this paper cites.
In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI’07, p. 756–761. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2007)
Dundar, M., Krishnapuram, B., Bi, J., Rao, R.B.: Learning classifiers when the training data is not iid · 2007
Earlier work this paper cites.
Discrete Comput. Geom. 39
Niyogi, P., Smale, S., Weinberger, S.: Finding the homology of submanifolds with high confidence from random samples · 2008
Earlier work this paper cites.
In: 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, pp. 1378–1385 (2009)
Balasubramanian, V., Chakraborty, S., Panchanathan, S.: Generalized query by transduction for online active learning · 2009
Cited alongside, same era.
Ph.D. thesis, Carnegie Mellon University, USA (2009)
Hanneke, S.: Theoretical foundations of active learning · 2009
Cited alongside, same era.
The Annals of Statistics 37
Nguyen, X., Wainwright, M.J., Jordan, M.I.: On surrogate loss functions and f-divergences · 2009
Cited alongside, same era.
Machine Learning 80
Balcan, M., Hanneke, S., Vaughan, J.W.: The true sample complexity of active learning · 2010
Cited alongside, same era.
SIAM J. Comput. 40
Niyogi, P., Smale, S., Weinberger, S.: A topological view of unsupervised learning from noisy data · 2011
Cited alongside, same era.
Journal of Machine Learning Research 12
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: Machine learning in Python · 2011
Network Modeling Analysis in Health Informatics and Bioinformatics 5
Luo, G.: A review of automatic selection methods for machine learning algorithms and hyper-parameter values · 2016
Later among the works it cites.
In: L. Najman, P. Romon (eds.) Modern Approaches to Discrete Curvature, Lecture Notes in Mathematics , vol. 2184. Springer, Cham (2017)
Chazal, F., Cohen-Steiner, D., Lieutier, A., Mérigot, Q., Thibert, B.: Inference of curvature using tubular neighborhoods · 2017
Later among the works it cites.
J. Mach. Learn. Res. 18
Chazal, F., Fasy, B., Lecci, F., Michel, B., Rinaldo, A., Rinaldo, A., Wasserman, L.: Robust topological inference: Distance to a measure and kernel distance · 2017
Later among the works it cites.
URL http://archive.ics.uci.edu/ml
Dua, D., Graff, C.: UCI machine learning repository (2017) · 2017
Later among the works it cites.
URL http://hdl.handle.net/1721.1/115274
Kawaguchi, K., Kaelbling, L.P., Bengio, Y.: Generalization in deep learning (2017) · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Notices of the American Mathematical Society 58
Weinberger, S.: What is … persistent homology? · 2011
Cited alongside, same era.
J. Mach. Learn. Res. 13
Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization · 2012
Cited alongside, same era.
The MIT Press (2012)
Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning · 2012
Cited alongside, same era.
Morgan & Claypool (2012)
Settles, B.: Active Learning · 2012
Cited alongside, same era.
Foundations and Trends in Machine Learning 4
Shalev-Shwartz, S.: Online learning and online convex optimization · 2012
Cited alongside, same era.
In: Proceedings of the 25th International Conference on Neural Information Processing Systems - Volume 2, NIPS’12, p. 2951–2959. Curran Associates Inc., Red Hook, NY, USA (2012)
Snoek, J., Larochelle, H., Adams, R.P.: Practical bayesian optimization of machine learning algorithms · 2012
Cited alongside, same era.
Kirkpatrick, J., Pascanu, R., Rabinowitz, N., Veness, J., Desjardins, G., Rusu, A.A., Milan, K., Quan, J., Ramalho, T., Grabska-Barwinska, A., Hassabis, D., Clopath, C., Kumaran, D., Hadsell, R.: Overcoming catastrophic forgetting in neural networks · 2017
Later among the works it cites.
DOI 10.5555/3294996.3295083
Ratner, A.J., Ehrenberg, H.R., Hussain, Z., Dunnmon, J., Ré, C.: Learning to compose domain-specific transformations for data augmentation (2017) · 2017
Later among the works it cites.
In: S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, R. Garnett (eds.) Advances in Neural Information Processing Systems 31, pp. 3235–3246. Curran Associates, Inc. (2018)
Oliver, A., Odena, A., Raffel, C.A., Cubuk, E.D., Goodfellow, I.: Realistic evaluation of deep semi-supervised learning algorithms · 2018
Later among the works it cites.
In: International Conference on Learning Representations (2018)
Reddi, S.J., Kale, S., Kumar, S.: On the convergence of adam and beyond · 2018
Later among the works it cites.
In: International Conference on Learning Representations (2018)
Sener, O., Savarese, S.: Active learning for convolutional neural networks: A core-set approach · 2018
Later among the works it cites.
Annual Review of Statistics and Its Application 5
Wasserman, L.: Topological data analysis · 2018
Later among the works it cites.
In: International Conference on Machine Learning, pp. 1528–1537. PMLR (2019)
Dao, T., Gu, A., Ratner, A.J., Smith, V., Sa, C.D., Ré, C.: A kernel theory of modern data augmentation · 2019
Later among the works it cites.
In: K. Chaudhuri, R. Salakhutdinov (eds.) Proceedings of the 36th International Conference on Machine Learning, pp. 2731–2741. PMLR (2019)
Ho, D., Liang, E., Chen, X., Stoica, I., Abbeel, P.: Population based augmentation: Efficient learning of augmentation policy schedules · 2019
Later among the works it cites.
In: Proceedings of the 37th International Conference on Machine Learning. PMLR (2020)
Hsieh, K., Phanishayee, A., Mutlu, O., Gibbons, P.B.: The non-iid data quagmire of decentralized machine learning · 2020
Closest in time.
In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event, Proceedings of Machine Learning Research , vol. 119, pp. 10410–10420. PMLR (2020)
Wu, S., Zhang, H.R., Valiant, G., Ré, C.: On the generalization effects of linear transformations in data augmentation · 2020
Closest in time.
Neurocomputing 415
Yang, L., Shami, A.: On hyperparameter optimization of machine learning algorithms: Theory and practice · 2020
Closest in time.
In: International Conference on Learning Representations (2020)
Zhang, X., Wang, Q., Zhang, J., Zhong, Z.: Adversarial autoaugment · 2020
Closest in time.
J. Mach. Learn. Res. 22
Nguyen, L.M., Tran-Dinh, Q., Phan, D.T., Nguyen, P.H., Van Dijk, M.: A unified convergence analysis for shuffling-type gradient methods · 2021
Closest in time.
Gunasekar, S., Zhang, Y., Aneja, J., Mendes, C.C.T., Giorno, A.D., Gopi, S., Javaheripi, M., Kauffmann, P., de Rosa, G., Saarikivi, O., Salim, A., Shah, S., Behl, H.S., Wang, X., Bubeck, S., Eldan, R., Kalai, A.T., Lee, Y.T., Li, Y.: Textbooks are all you need · 2023
Closest in time.
https://github.com/tatsu-lab/stanford_alpaca (2023)
Taori, R., Gulrajani, I., Zhang, T., Dubois, Y., Li, X., Guestrin, C., Liang, P., Hashimoto, T.B.: Stanford Alpaca: An instruction-following LLaMA model · 2023
Closest in time.
In: A. Oh, T. Neumann, A. Globerson, K. Saenko, M. Hardt, S. Levine (eds.) Advances in Neural Information Processing Systems, vol. 36, pp. 55734–55784. Curran Associates, Inc. (2023)
Yu, Y., Zhuang, Y., Zhang, J., Meng, Y., Ratner, A.J., Krishna, R., Shen, J., Zhang, C.: Large language model as attributed training data generator: A tale of diversity and bias · 2023
Closest in time.
ACM Trans. Knowl. Discov. Data (2024)
Yang, J., Jin, H., Tang, R., Han, X., Feng, Q., Jiang, H., Zhong, S., Yin, B., Hu, X.: Harnessing the power of LLMs in practice: A survey on ChatGPT and beyond · 2024
Closest in time.