When redundancy matters: machine teaching of representations

DOI10.1007/S10994-025-06954-3MaRDI QIDQ6868172zbMATH OpenFDO

Authors C. Ferri, Dario Garigliotti, J. Hernández-Orallo, Brigt Håvardstun, Jan Arne Telle

Publication date 26 January 2026

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10994-025-06954-3

zbMATH Keywords

concept representationsmachine teachingredundancy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A compact fixpoint semantics for term rewriting systems
• Can the catenation of two weakly sparse languages be dense?
• Inductive Logic Programming: Theory and methods
• Measuring teachability using variants of the teaching dimension
• Models of cooperative teaching and learning
• On sparse languages \(L\) such that \(LL= \Sigma^*\)
• On the complexity of teaching
• Preference-based teaching
• The teaching size: computable teachers and learners for universal languages
• Universal codeword sets and representations of the integers

This page was built for publication: When redundancy matters: machine teaching of representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868172)