Fetching the paper…
Reading the bibliography…
The acquisition of labels for supervised learning can be expensive.
On the standard deviations of adjusted and interpolated values of an observed polynomial function and its constants and the guidance they give towards a proper choice of the distribution of observations
Kirstine Smith · 1918
Earlier work this paper cites.
On the efficient design of statistical investigations
Abraham Wald · 1943
Earlier work this paper cites.
A mathematical theory of communication
Claude Elwood Shannon · 1948
Earlier work this paper cites.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
Computer aided design of experiments
Ronald W. Kennard and Larry A. Stone · 1969
Earlier work this paper cites.
The sequential generation of D-optimum experimental designs
Henry P. Wynn · 1970
Earlier work this paper cites.
Theory of Optimal Experiments
Valerii V. Fedorov · 1972
Earlier work this paper cites.
An analysis of several heuristics for the traveling salesman problem
Daniel J. Rosenkrantz, Richard E. Stearns, and Philip M. Lewis · 1977
Earlier work this paper cites.
Least squares quantization in PCM
Stuart Lloyd · 1982
Earlier work this paper cites.
Optimal monitoring network designs
William F. Caselton and James V. Zidek · 1984
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
William B. Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Clustering to minimize the maximum intercluster distance
Teofilo F. Gonzalez · 1985
Earlier work this paper cites.
Optimal algorithms for approximate clustering
Tomás Feder and Daniel Greene · 1988
Earlier work this paper cites.
Neural network ensembles
Lars Kai Hansen and Peter Salamon · 1990
Earlier work this paper cites.
Finding groups in data: an introduction to cluster analysis
Leonard Kaufman and Peter J. Rousseeuw · 1990
Earlier work this paper cites.
Multivariate adaptive regression splines
Jerome H. Friedman · 1991
Earlier work this paper cites.
Query by committee
H. Sebastian Seung, Manfred Opper, and Haim Sompolinsky · 1992
Earlier work this paper cites.
A new initialization technique for generalized Lloyd iteration
Ioannis Katsavounidis, C.-C. Jay Kuo, and Zhen Zhang · 1994
Earlier work this paper cites.
Neural network ensembles, cross validation, and active learning
Anders Krogh and Jesper Vedelsby · 1994
Earlier work this paper cites.
Priors for Infinite Networks
Radford M. Neal · 1994
Earlier work this paper cites.
Bayesian experimental design: A review
Kathryn Chaloner and Isabella Verdinelli · 1995
Earlier work this paper cites.
Approximation algorithms for geometric problems
Marshall Bern and David Eppstein · 1996
Earlier work this paper cites.
Neural network exploration using optimal experiment design
David A. Cohn · 1996
Earlier work this paper cites.
Algorithmic theories of learning
Rosa I. Arriaga and Santosh Vempala · 1999
Earlier work this paper cites.
Gaussian process regression: Active data selection and test point rejection
Sambu Seo, Marko Wallat, Thore Graepel, and Klaus Obermayer · 2000
Earlier work this paper cites.
Locally weighted projection regression: An O(n) algorithm for incremental real time learning in high dimensional space
Sethu Vijayakumar and Stefan Schaal · 2000
Earlier work this paper cites.
Fast curvature matrix-vector products for second-order gradient descent
Nicol N. Schraudolph · 2002
Earlier work this paper cites.
Cytoscape: a software environment for integrated models of biomolecular interaction networks
Paul Shannon, Andrew Markiel, Owen Ozier, Nitin S. Baliga, Jonathan T. Wang, Daniel Ramage, Nada Amin, Benno Schwikowski, and Trey Ideker · 2003
Earlier work this paper cites.
Near-optimal data-independent point locations for radial basis function interpolation
Stefano De Marchi, Robert Schaback, and Holger Wendland · 2005
Earlier work this paper cites.
Pattern Recognition and Machine Learning
Christopher M. Bishop · 2006
Earlier work this paper cites.
The effectiveness of Lloyd-type methods for the k-means problem
Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, and Chaitanya Swamy · 2006
Earlier work this paper cites.
k-means++: The advantages of careful seeding
David Arthur and Sergei Vassilvitskii · 2007
Earlier work this paper cites.
Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies
Andreas Krause, Ajit Singh, and Carlos Guestrin · 2008
Earlier work this paper cites.
Support vector machines
Ingo Steinwart and Andreas Christmann · 2008
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky · 2009
Earlier work this paper cites.
Active learning literature survey
Burr Settles · 2009
Earlier work this paper cites.
Marginalized neural network mixtures for large-scale regression
Miguel Lázaro-Gredilla and Aníbal R. Figueiras-Vidal · 2010
Earlier work this paper cites.
Passive sampling for regression
Hwanjo Yu and Sungchul Kim · 2010
Earlier work this paper cites.
2D image registration in ct images using radial image descriptors
Franz Graf, Hans-Peter Kriegel, Matthias Schubert, Sebastian Pölsterl, and Alexander Cavallaro · 2011
Earlier work this paper cites.
Bayesian active learning for classification and preference learning
Neil Houlsby, Ferenc Huszár, Zoubin Ghahramani, and Máté Lengyel · 2011
Earlier work this paper cites.
Bases for kernel-based spaces
Maryam Pazouki and Robert Schaback · 2011
Earlier work this paper cites.
Random feature maps for dot product kernels
Purushottam Kar and Harish Karnick · 2012
Earlier work this paper cites.
A comparative study of efficient initialization methods for the k-means clustering algorithm
M. Emre Celebi, Hassan A. Kingravi, and Patricio A. Vela · 2013
Earlier work this paper cites.
Exponential inapproximability of selecting a maximum volume sub-matrix
Ali Civril and Malik Magdon-Ismail · 2013
Cited alongside, same era.
Building accurate 3d spatial networks to enable next generation intelligent transportation systems
Manohar Kaul, Bin Yang, and Christian S. Jensen · 2013
Cited alongside, same era.
OpenML: Networked science in machine learning
Joaquin Vanschoren, Jan N. van Rijn, Bernd Bischl, and Luis Torgo · 2013
Cited alongside, same era.
Video transcoding time prediction for proactive load balancing
Tewodors Deneke, Habtegebreil Haile, Sébastien Lafond, and Johan Lilius · 2014
Cited alongside, same era.
Dropout: a simple way to prevent neural networks from overfitting
Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov · 2014
Cited alongside, same era.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Pytorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, and Luca Antiga · 2019
Later among the works it cites.
Bayesian batch active learning as sparse subset approximation
Robert Pinsler, Jonathan Gordon, Eric Nalisnick, and José Miguel Hernández-Lobato · 2019
Later among the works it cites.
Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
Maziar Raissi, Paris Perdikaris, and George E. Karniadakis · 2019
Later among the works it cites.
Diverse mini-batch active learning
Fedor Zhdanov · 2019
Later among the works it cites.
Oblivious sketching of high-degree polynomial kernels
Thomas D. Ahle, Michael Kapralov, Jakob BT Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, and Amir Zandieh · 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…
Cited alongside, same era.
Delving deep into rectifiers: Surpassing human-level performance on ImageNet classification
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2015
Cited alongside, same era.
Scalable bayesian optimization using deep neural networks
Jasper Snoek, Oren Rippel, Kevin Swersky, Ryan Kiros, Nadathur Satish, Narayanan Sundaram, Mostofa Patwary, Mr Prabhat, and Ryan Adams · 2015
Cited alongside, same era.
Perspective: Machine learning potentials for atomistic simulations
Jörg Behler · 2016
Cited alongside, same era.
Dropout as a bayesian approximation: Representing model uncertainty in deep learning
Yarin Gal and Zoubin Ghahramani · 2016
Cited alongside, same era.
UCI Machine Learning Repository, 2017
Dheeru Dua and Casey Graff · 2017
Cited alongside, same era.
Coresets via bilevel optimization for continual learning and streaming
Zalán Borsos, Mojmir Mutny, and Andreas Krause · 2020
Later among the works it cites.
Approximate greedy clustering and distance selection for graph metrics
David Eppstein, Sariel Har-Peled, and Anastasios Sidiropoulos · 2020
Later among the works it cites.
Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the neural tangent kernel
Stanislav Fort, Gintare Karolina Dziugaite, Mansheej Paul, Sepideh Kharaghani, Daniel M. Roy, and Surya Ganguli · 2020
Later among the works it cites.
Being Bayesian, even just a bit, fixes overconfidence in relu networks
Agustinus Kristiadi, Matthias Hein, and Philipp Hennig · 2020
Later among the works it cites.
Active learning query strategies for classification, regression, and clustering: a survey
Punit Kumar and Atul Gupta · 2020
Later among the works it cites.
Deep active learning for image regression
Hiranmayi Ranganathan, Hemanth Venkateswara, Shayok Chakraborty, and Sethuraman Panchanathan · 2020
Later among the works it cites.
Bayesian deep learning and a probabilistic perspective of generalization
Andrew G. Wilson and Pavel Izmailov · 2020
Later among the works it cites.
Gone fishing: Neural active learning with Fisher embeddings
Jordan Ash, Surbhi Goel, Akshay Krishnamurthy, and Sham Kakade · 2021
Later among the works it cites.
Neural networks as kernel learners: The silent alignment effect
Alexander Atanasov, Blake Bordelon, and Cengiz Pehlevan · 2021
Later among the works it cites.
Semi-supervised batch active learning via bilevel optimization
Zalán Borsos, Marco Tagliasacchi, and Andreas Krause · 2021
Later among the works it cites.
Laplace Redux-Effortless Bayesian Deep Learning
Erik Daxberger, Agustinus Kristiadi, Alexander Immer, Runa Eschenhagen, Matthias Bauer, and Philipp Hennig · 2021
Later among the works it cites.
Mixtures of Laplace approximations for improved post-hoc uncertainty in deep learning
Runa Eschenhagen, Erik Daxberger, Philipp Hennig, and Agustinus Kristiadi · 2021
Later among the works it cites.
On statistical bias in active learning: How and when to fix it
Sebastian Farquhar, Yarin Gal, and Tom Rainforth · 2021
Later among the works it cites.
Revisiting deep learning models for tabular data
Yury Gorishniy, Ivan Rubachev, Valentin Khrulkov, and Artem Babenko · 2021
Later among the works it cites.
Random features for the neural tangent kernel
Insu Han, Haim Avron, Neta Shoham, Chaewon Kim, and Jinwoo Shin · 2021
Later among the works it cites.
Improving predictions of Bayesian neural nets via local linearization
Alexander Immer, Maciej Korzepa, and Matthias Bauer · 2021
Later among the works it cites.
Well-tuned simple nets excel on tabular datasets
Arlind Kadra, Marius Lindauer, Frank Hutter, and Josif Grabocka · 2021
Later among the works it cites.
Simulation intelligence: Towards a new generation of scientific methods
Alexander Lavin, Hector Zenil, Brooks Paige, David Krakauer, Justin Gottschlich, Tim Mattson, Anima Anandkumar, Sanjay Choudry, Kamil Rocki, Atılım Güneş Baydin, and others · 2021
Later among the works it cites.
Properties of the after kernel
Philip M. Long · 2021
Later among the works it cites.
GeneDisco: A benchmark for experimental design in drug discovery
Arash Mehrjou, Ashkan Soleymani, Andrew Jesson, Pascal Notin, Yarin Gal, Stefan Bauer, and Patrick Schwab · 2021
Later among the works it cites.
Which minimizer does my neural network converge to?
Manuel Nonnenmacher, David Reeb, and Ingo Steinwart · 2021
Later among the works it cites.
A survey of deep active learning
Pengzhen Ren, Yun Xiao, Xiaojun Chang, Po-Yao Huang, Zhihui Li, Brij B. Gupta, Xiaojiang Chen, and Xin Wang · 2021
Later among the works it cites.
Sampling based approximation of linear functionals in reproducing kernel Hilbert spaces
Gabriele Santin, Toni Karvonen, and Bernard Haasdonk · 2021
Later among the works it cites.
A theory of neural tangent kernel alignment and its influence on training
Haozhe Shan and Blake Bordelon · 2021
Later among the works it cites.
Sketching curvature for efficient out-of-distribution detection for deep neural networks
Apoorva Sharma, Navid Azizan, and Marco Pavone · 2021
Later among the works it cites.
Neural active learning with performance guarantees
Zhilei Wang, Pranjal Awasthi, Christoph Dann, Ayush Sekhari, and Claudio Gentile · 2021
Later among the works it cites.
A novel class of stabilized greedy kernel approximation algorithms: Convergence, stability and uniform point distribution
Tizian Wenzel, Gabriele Santin, and Bernard Haasdonk · 2021
Later among the works it cites.
Scaling neural tangent kernels via sketching and random features
Amir Zandieh, Insu Han, Haim Avron, Neta Shoham, Chaewon Kim, and Jinwoo Shin · 2021
Later among the works it cites.
Exploration of transferable and uniformly accurate neural network interatomic potentials using optimal experimental design
Viktor Zaverkin and Johannes Kästner · 2021
Later among the works it cites.
Towards understanding the behaviors of optimal deep active learning algorithms
Yilun Zhou, Adithya Renduchintala, Xian Li, Sida Wang, Yashar Mehdad, and Asish Ghoshal · 2021
Later among the works it cites.
Identifying wrongly predicted samples: A method for active learning
Rahaf Aljundi, Nikolay Chumerin, and Daniel Olmeda Reino · 2022
Closest in time.
Data shapley valuation for efficient batch active learning
Amirata Ghorbani, James Zou, and Andre Esteva · 2022
Closest in time.
Making look-ahead active learning strategies feasible with Neural Tangent Kernels
Mohamad Amin Mohamadi, Wonho Bae, and Danica J. Sutherland · 2022
Closest in time.
Fast finite width neural tangent kernel
Roman Novak, Jascha Sohl-Dickstein, and Samuel S. Schoenholz · 2022
Closest in time.
SAINT: Improved neural networks for tabular data via row attention and contrastive pre-training
Gowthami Somepalli, Avi Schwarzschild, Micah Goldblum, C. Bayan Bruss, and Tom Goldstein · 2022
Closest in time.
Deep active learning by leveraging training dynamics
Haonan Wang, Wei Huang, Ziwei Wu, Hanghang Tong, Andrew J. Margenot, and Jingrui He · 2022
Closest in time.
Learning with not enough data part 2: Active learning
Lilian Weng · 2022
Closest in time.
Experimental design for overparameterized learning with application to single shot deep active learning
Neta Shoham and Haim Avron · 2023
Closest in time.