The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Importance weighted active learning
Open accessAbstract
We present a practical and statistically consistent scheme for actively learning binary classifiers under general loss functions. Our algorithm uses importance weighting to correct sampling bias, and by controlling the variance, we are able to give rigorous label complexity bounds for the learning process.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Improving predictive inference under covariate shift by weighting the log-likelihood function
Shimodaira, H. (2000) · Journal of Statistical Planning and Inference · doi:10.1016/s0378-3758(00)00115-4 · Cited by 1,678
Improving generalization with active learning
Cohn, D., Atlas, L., & Ladner, R. (1994) · Machine Learning · doi:10.1007/bf00993277 · Cited by 1,591
Weighted sums of certain dependent random variables
Azuma, K. (1967) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178243286 · Cited by 1,084
Cost-sensitive learning by cost-proportionate example weighting
Zadrozny, B., Langford, J., & Abe, N. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250950 · Cited by 680 · cited 1×
“The Costing technique (Zadrozny et al., 2003) was used to remove the importance weights using rejection sampling.”
MethodSelf-citationIntroduction to Statistical Learning Theory
Bousquet, O., Boucheron, S., & Lugosi, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28650-9_8 · Cited by 503
Hierarchical sampling for active learning
Dasgupta, S., & Hsu, D. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390183 · Cited by 444
Self-citationQuery Learning Strategies Using Boosting and Bagging
Abe, N., & Mamitsuka, H. (1998) · International Conference on Machine Learning · Cited by 348
Balcan, M.-F., Beygelzimer, A., & Langford, J. C. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143853 · Cited by 280
Self-citationTutorial on Practical Prediction Theory for Classification
Langford, J. C. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1058111 · Cited by 280
Self-citationA bound on the label complexity of agnostic active learning
Hanneke, S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273541 · Cited by 231
Analysis of Perceptron-Based Active Learning
Dasgupta, S., Kalai, A. T., & Monteleoni, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11503415_17 · Cited by 214
Self-citationA General Agnostic Active Learning Algorithm.
Dasgupta, S., Hsu, D., & Monteleoni, C. (2008) · Cited by 188
Self-citationThe true sample complexity of active learning
Balcan, M.-F., Hanneke, S., & Vaughan, J. W. (2010) · Machine Learning · doi:10.1007/s10994-010-5174-y · Cited by 137
Active Learning in the Non-realizable Case
Kääriäinen, M. (2006) · Lecture notes in computer science · doi:10.1007/11894841_9 · Cited by 95
Distribution Inequalities for the Binomial Law
SLUD, E. V. (1977) · The Annals of Probability · doi:10.1214/aop/1176995801 · Cited by 81
Active learning for misspecified generalized linear models
Bach, F. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0013 · Cited by 45
Cited by
(2009) · Minds at UW (University of Wisconsin) · Cited by 4,791
Settles, B. (2012) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00429ed1v01y201207aim018 · Cited by 605
Active learning enabled activity recognition
Hossain, H. M. S., Khan, M. A. A. H., & Roy, N. (2017) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2016.08.017 · Cited by 92
Metadata
- Authors
- Beygelzimer, A., Dasgupta, S., & Langford, J.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 49-56
- OpenAlex
- W2167595980
- Cited by
- 276
- References
- 19
- FWCI
- 15.98
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.