The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Machine Teaching: An Inverse Problem to Machine Learning and an Approach Toward Optimal Education
Open accessAbstract
I draw the reader's attention to machine teaching, the problem of finding an optimal training set given a machine learning algorithm and a target model. In addition to generating fascinating mathematical questions for computer scientists to ponder, machine teaching holds the promise of enhancing education and personnel training. The Socratic dialogue style aims to stimulate critical thinking.
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
Bengio, Y., Louradour, J., Collobert, R., & Weston, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553380 · Cited by 5,366 · cited 1×
“Human experiments also call for new developments in machine teaching, such as the sequential teaching setting (Bengio et al. 2009; Khan, Zhu, and Mutlu 2011; McCandliss et al. 2002; Kumar, Packer, and Koller 2010; Lee and Grauman 2011; Cakmak and Lopes 2012; Pashler and Mozer 2013; Kobayashi and…”
BackgroundUsing Machine Teaching to Identify Optimal Training-Set Attacks on Machine Learners
Mei, S., & Zhu, X. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9569 · Cited by 346
Self-citationMCCANDLISS, B. D., FIEZ, J. A., PROTOPAPAS, A., CONWAY, M., & MCCLELLAND, J. L. (2002) · Cognitive, Affective, & Behavioral Neuroscience · doi:10.3758/cabn.2.2.89 · Cited by 303
New Potentials for Data‐Driven Intelligent Tutoring System Development and Optimization
Koedinger, K. R., Brunskill, E., Baker, R. S. J. D., McLaughlin, E. A., & Stamper, J. (2013) · AI Magazine · doi:10.1609/aimag.v34i3.2484 · Cited by 178 · cited 1×
“Discrete optimization methods, such as those based on submodularity, may be applicable here (Krause and Golovin 2014; Iyer and Bilmes 2013; Bach 2013; Feige 1998; Krause and Guestrin 2005; Nemhauser, Wolsey, and Fisher 1978).”
Method
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“ing is provably stronger than data poisoning, we are unaware of any formal statements addressing this. One possible approach would be to use insights and techniques from work on machine teaching (see [438] for reference) to understand “optimal” data poisoning attacks, as in [292]. Any formal statement will likely depe…”
Human-in-the-loop machine learning: a state of the art
Mosqueira-Rey, E., Hernández-Pereira, E., Alonso-Ríos, D., Bobes-Bascarán, J., & Fernández-Leal, Á. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10246-w · Cited by 1,025
Exploring students' perspectives on generative AI-assisted academic writing
Kim, J., Yu, S., Detrick, R., & Li, N. (2025) · Education and Information Technologies · doi:10.1007/s10639-024-12878-7 · Cited by 438
“…GenAI could follow Bloom’s taxonomy model, and nudge and guide students to stimulate critical thinking, develop higher-level thinking questions (Zhu, 2015), analyze patterns in students’ responses, assess higher-order inquiry skills, and challenge students to think more deeply and critically…”
Lai, V., & Tan, C. (2019) · Proceedings of the Conference on Fairness, Accountability, and Transparency · doi:10.1145/3287560.3287590 · Cited by 377
“This direction also connects to the area of machine teaching [51, 68, 82].”
BackgroundOptimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.08.045 · Cited by 365
Spector, J. M., & Ma, S. (2019) · Smart Learning Environments · doi:10.1186/s40561-019-0088-z · Cited by 272
Data Poisoning Attacks against Autoregressive Models
Alfeld, S., Zhu, X., & Barford, P. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10237 · Cited by 205
Self-citationWang, T., Zhu, J.-Y., Torralba, A., & Efros, A. A. (2018) · arXiv · doi:10.48550/arxiv.1811.10959 · Cited by 194
Grounding Interactive Machine Learning Tool Design in How Non-Experts Actually Build Models
Yang, Q., Suh, J., Chen, N.-C., & Ramos, G. (2018) · Proceedings of the 2018 Designing Interactive Systems Conference · doi:10.1145/3196709.3196729 · Cited by 156
The intertwined histories of artificial intelligence and education
Doroudi, S. (2023) · International Journal of Artificial Intelligence in Education · doi:10.1007/s40593-022-00313-2 · Cited by 129
Understanding Human Intelligence through Human Limitations
Griffiths, T. L. (2020) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2020.09.001 · Cited by 88
Knowledge Learning With Crowdsourcing: A Brief Review and Systematic Perspective
Zhang, J. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105434 · Cited by 66
“Thus, machine teaching [112], the inverse problem of machine learning, can be embedded in the active learning procedure, where the selected teaching examples are pushed”
BackgroundThe Theoretical and Methodological Opportunities Afforded by Guided Play With Young Children
Yu, Y., Shafto, P., Bonawitz, E., Yang, S. C.-H., Golinkoff, R. M., Corriveau, K. H., Hirsh-Pasek, K., & Xu, F. (2018) · Frontiers in Psychology · doi:10.3389/fpsyg.2018.01152 · Cited by 59
Metadata
- Authors
- Zhu, X.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2015-03-04
- Volume
- 29
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2182055801
- Cited by
- 216
- References
- 4
- FWCI
- 7.76
- Type
- conference paper
- Language
- en
- Open access
- diamond
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.