A new learning paradigm: Learning using privileged information
Abstract
In the Afterword to the second edition of the book "Estimation of Dependences Based on Empirical Data" by V. Vapnik, an advanced learning paradigm called Learning Using Hidden Information (LUHI) was introduced. This Afterword also suggested an extension of the SVM method (the so called SVM(gamma)+ method) to implement algorithms which address the LUHI paradigm (Vapnik, 1982-2006, Sections 2.4.2 and 2.5.3 of the Afterword). See also (Vapnik, Vashist, & Pavlovitch, 2008, 2009) for further development of the algorithms. In contrast to the existing machine learning paradigm where a teacher does not play an important role, the advanced learning paradigm considers some elements of human teaching. In the new paradigm along with examples, a teacher can provide students with hidden information that exists in explanations, comments, comparisons, and so on. This paper discusses details of the new paradigm and corresponding algorithms, introduces some new algorithms, considers several specific forms of privileged information, demonstrates superiority of the new learning paradigm over the classical learning paradigm when solving practical problems, and discusses general questions related to the new ideas.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Typical multi-modal models suffer in missing modality scenarios.
“As the typical multi-modal models suffer in such scenarios, there was a large body of studies to address the missing modality problem (Vapnik and Vashist 2009; Pechyony and Vapnik 2010; Vapnik, Izmailov et al. 2015; Lopez-Paz et al. 2015; Ma et al. 2022; Zhao, Li, and Jin 2021; Alayrac et al. 2020; Ma et al. 2021)”
From Towards Good Practices for Missing Modality Robust Action Recognition (2023) · cites this paper as Vapnik and Vashist 2009
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
End-to-End Learning of Driving Models from Large-Scale Video Datasets
Xu, H., Gao, Y., Yu, F., & Darrell, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.376 · Cited by 884 · see citing works
Learning with Side Information through Modality Hallucination
Hoffman, J., Gupta, S., & Darrell, T. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.96 · Cited by 207 · see citing works
Deep Learning Under Privileged Information Using Heteroscedastic Dropout
Lambert, J., Sener, O., & Savarese, S. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00926 · Cited by 93 · see citing works
“Learning Under Privileged Information: Learning under Privileged Information (LUPI) is initially proposed by Vapnik and Vashist [38, 37].”
InfluentialTowards Good Practices for Missing Modality Robust Action Recognition
Woo, S., Lee, S., Park, Y., Nugroho, M. A., & Kim, C. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i3.25378 · Cited by 60 · see citing works
Gong, R., Wu, C., & Chu, M. (2018) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2017.11.018 · Cited by 44 · see citing works
Hard pixel mining for depth privileged semantic segmentation
Gu, Z., Niu, L., Zhao, H., & Zhang, L. (2021) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2020.3035231 · Cited by 41 · see citing works
Progressive modality cooperation for multi-modality domain adaptation
Zhang, W., Xu, D., Zhang, J., & Ouyang, W. (2021) · IEEE Transactions on Image Processing · doi:10.1109/tip.2021.3052083 · Cited by 25 · see citing works
- Authors
- Vapnik, V., & Vashist, A.
- Corresponding author
- Vapnik, Vladimir
- Venue
- Neural Networks
- Publisher
- Elsevier BV
- Published
- 2009-07
- Volume
- 22
- Issue
- 5-6
- Pages
- 544-557
- ISSN
- 0893-6080 (ISSN-L)
- OpenAlex
- W2067562626
- Cited by
- 774
- References
- 1
- Citations by year
- 2026: 53 · 2025: 51 · 2024: 43 · 2023: 59 · 2022: 60 · 2021: 78 · 2020: 68 · 2019: 50 · 2018: 62 · 2017: 57 · 2016: 56 · 2015: 42 · 2014: 38 · 2013: 23 · 2012: 11
- FWCI
- 12.24
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Neural Networks (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
- Keywords
- privileged information, support vector machine, learning paradigms
- MeSH terms
- Algorithms, Artificial Intelligence, Bayes Theorem, Forecasting, Language, Learning, Protein Conformation, Proteins, Time Factors, Sequence Analysis, Protein, Databases, Genetic, Information Dissemination, Mathematical Concepts
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