Learning Binary Relations and Total Orders
From MaRDI portal
Recommendations
Cited in
(19)- DNF are teachable in the average case
- A model of interactive teaching
- A theory of formal synthesis via inductive learning
- Online learning of binary and \(n\)-ary relations over clustered domains.
- Learning binary relations using weighted majority voting
- Learning lexicographic orders
- Collaborate with strangers to find own preferences
- Ignorant vs. anonymous recommendations
- Recent Developments in Algorithmic Teaching
- scientific article; zbMATH DE number 67637 (Why is no real title available?)
- scientific article; zbMATH DE number 1560209 (Why is no real title available?)
- Teaching and Compressing for Low VC-Dimension
- Teaching randomized learners with feedback
- On competitive recommendations
- A note on hardness of computing recursive teaching dimension
- Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
- On locating and neighbor-locating colorings of sparse graphs
- Tell me who I am: An interactive recommendation system
- Measuring teachability using variants of the teaching dimension
This page was built for publication: Learning Binary Relations and Total Orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142590)