Fetching the paper…
Reading the bibliography…
Modern deep learning heavily relies on large labeled datasets, which often comse with high costs in terms of both manual labeling and computational resources.
Active hidden markov models for information extraction
Tobias Scheffer, Christian Decomain, and Stefan Wrobel · 2001
Earlier work this paper cites.
Reducing labeling effort for structured prediction tasks
Aron Culotta and Andrew McCallum · 2005
Earlier work this paper cites.
Bootstrap standard error estimates for linear regression
Sílvia Gonçalves and Halbert White · 2005
Earlier work this paper cites.
Smaller coresets for k-median and k-means clustering
Sariel Har-Peled and Akash Kushal · 2005
Earlier work this paper cites.
Core vector machines: Fast svm training on very large data sets
Ivor W Tsang, James T Kwok, Pak-Ming Cheung, and Nello Cristianini · 2005
Earlier work this paper cites.
Mathematical statistics and data analysis
John A Rice · 2006
Earlier work this paper cites.
Margin-based active learning for structured output spaces
Dan Roth and Kevin Small · 2006
Earlier work this paper cites.
Truncated importance sampling
Edward L Ionides · 2008
Earlier work this paper cites.
Multi-class active learning for image classification
Ajay J Joshi, Fatih Porikli, and Nikolaos Papanikolopoulos · 2009
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky, Geoffrey Hinton, et al · 2009
Earlier work this paper cites.
Faster least squares approximation
Petros Drineas, Michael W Mahoney, Shan Muthukrishnan, and Tamás Sarlós · 2011
Earlier work this paper cites.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Earlier work this paper cites.
Learning word vectors for sentiment analysis
Andrew L. Maas, Raymond E. Daly, Peter T. Pham, Dan Huang, Andrew Y. Ng, and Christopher Potts · 2011
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck, Nicolo Cesa-Bianchi, et al · 2012
Earlier work this paper cites.
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, Malik Magdon-Ismail, Michael W Mahoney, and David P Woodruff · 2012
Earlier work this paper cites.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Earlier work this paper cites.
On the properties of neural machine translation: Encoder-decoder approaches
Kyunghyun Cho, Bart Van Merriënboer, Dzmitry Bahdanau, and Yoshua Bengio · 2014
Earlier work this paper cites.
A statistical perspective on algorithmic leveraging
Ping Ma, Michael Mahoney, and Bin Yu · 2014
Earlier work this paper cites.
Lsrn: A parallel iterative solver for strongly over-or underdetermined systems
Xiangrui Meng, Michael A Saunders, and Michael W Mahoney · 2014
Earlier work this paper cites.
A new active labeling method for deep learning
Dan Wang and Yi Shang · 2014
Cited alongside, same era.
Counterfactual risk minimization: Learning from logged bandit feedback
Adith Swaminathan and Thorsten Joachims · 2015
Cited alongside, same era.
Submodularity in data subset selection and active learning
Kai Wei, Rishabh Iyer, and Jeff Bilmes · 2015
Cited alongside, same era.
The fast cauchy transform and faster robust linear regression
Kenneth L Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W Mahoney, Xiangrui Meng, and David P Woodruff · 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.
Deep residual learning for image recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2016
Cited alongside, same era.
Variational adversarial active learning
Samarth Sinha, Sayna Ebrahimi, and Trevor Darrell · 2019
Later among the works it cites.
Optimal subsampling for softmax regression
Yaqiong Yao and HaiYing Wang · 2019
Later among the works it cites.
Learning loss for active learning
Donggeun Yoo and In So Kweon · 2019
Later among the works it cites.
Coresets via bilevel optimization for continual learning and streaming
Zalán Borsos, Mojmir Mutny, and Andreas Krause · 2020
Later among the works it cites.
Optimal sampling in unbiased active learning
Henrik Imberg, Johan Jonasson, and Marina Axelson-Fisk · 2020
Later among the works it cites.
Provably efficient reinforcement learning with linear function approximation
Chi Jin, Zhuoran Yang, Zhaoran Wang, and Michael I Jordan · 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…
Coresets for scalable bayesian logistic regression
Jonathan Huggins, Trevor Campbell, and Tamara Broderick · 2016
Cited alongside, same era.
Densely connected convolutional networks
Gao Huang, Zhuang Liu, Laurens Van Der Maaten, and Kilian Q Weinberger · 2017
Cited alongside, same era.
Understanding black-box predictions via influence functions
Pang Wei Koh and Percy Liang · 2017
Cited alongside, same era.
Training gaussian mixture models at scale via coresets
Mario Lucic, Matthew Faulkner, Andreas Krause, and Dan Feldman · 2017
Cited alongside, same era.
Active learning for convolutional neural networks: A core-set approach
Ozan Sener and Silvio Savarese · 2017
Cited alongside, same era.
Places: A 10 million image database for scene recognition
Bolei Zhou, Agata Lapedriza, Aditya Khosla, Aude Oliva, and Antonio Torralba · 2017
Cited alongside, same era.
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2020
Later among the works it cites.
Coresets for data-efficient training of machine learning models
Baharan Mirzasoleiman, Jeff Bilmes, and Jure Leskovec · 2020
Later among the works it cites.
Stochastic linear bandits robust to adversarial attacks
Ilija Bogunovic, Arpan Losalka, Andreas Krause, and Jonathan Scarlett · 2021
Later among the works it cites.
Grad-match: Gradient matching based data subset selection for efficient deep model training
Krishnateja Killamsetty, Sivasubramanian Durga, Ganesh Ramakrishnan, Abir De, and Rishabh Iyer · 2021
Later among the works it cites.
Task-aware variational adversarial active learning
Kwanyoung Kim, Dongwon Park, Kwang In Kim, and Se Young Chun · 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.
Learning with noisy labels revisited: A study using real-world human annotations
Jiaheng Wei, Zhaowei Zhu, Hao Cheng, Tongliang Liu, Gang Niu, and Yang Liu · 2021
Later among the works it cites.
Nearly optimal algorithms for linear contextual bandits with adversarial corruptions
Jiafan He, Dongruo Zhou, Tong Zhang, and Quanquan Gu · 2022
Later among the works it cites.
Model agnostic sample reweighting for out-of-distribution learning
Xiao Zhou, Yong Lin, Renjie Pi, Weizhong Zhang, Renzhe Xu, Peng Cui, and Tong Zhang · 2022
Later among the works it cites.
Probabilistic bilevel coreset selection
Xiao Zhou, Renjie Pi, Weizhong Zhang, Yong Lin, Zonghao Chen, and Tong Zhang · 2022
Later among the works it cites.
Leveraging importance weights in subset selection
Gui Citovsky, Giulia DeSalvo, Sanjiv Kumar, Srikumar Ramalingam, Afshin Rostamizadeh, and Yunjuan Wang · 2023
Closest in time.
Corruption-robust algorithms with uncertainty weighting for nonlinear contextual bandits and markov decision processes
Chenlu Ye, Wei Xiong, Quanquan Gu, and Tong Zhang · 2023
Closest in time.