Pages that link to "Item:Q3142590"
From MaRDI portal
The following pages link to Learning Binary Relations and Total Orders (Q3142590):
Displaying 15 items.
- Teaching randomized learners with feedback (Q553294) (← links)
- Tell me who I am: An interactive recommendation system (Q733719) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- A model of interactive teaching (Q1362340) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- Online learning of binary and \(n\)-ary relations over clustered domains. (Q1872704) (← links)
- Collaborate with strangers to find own preferences (Q2471699) (← links)
- Ignorant vs. Anonymous Recommendations (Q3452859) (← links)
- Recent Developments in Algorithmic Teaching (Q3618563) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- On competitive recommendations (Q5964063) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
- Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning (Q6162075) (← links)
- On locating and neighbor-locating colorings of sparse graphs (Q6611083) (← links)
