Learning Binary Relations and Total Orders

DOI10.1137/0222062zbMath0788.68115OpenAlexW2154368141MaRDI QIDQ3142590

Robert E. Schapire, Ronald L. Rivest, Sally A. Goldman

Publication date: 20 December 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/05aaf43373ee72b1c8bf18fdb7c36f954d9a0baa

zbMATH Keywords

learningbinary relationtotal orderhalving algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (14)

Online learning of binary and \(n\)-ary relations over clustered domains. ⋮ Ignorant vs. Anonymous Recommendations ⋮ A model of interactive teaching ⋮ A theory of formal synthesis via inductive learning ⋮ 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 ⋮ Teaching and Compressing for Low VC-Dimension ⋮ Measuring teachability using variants of the teaching dimension ⋮ Collaborate with strangers to find own preferences ⋮ Teaching randomized learners with feedback ⋮ On competitive recommendations ⋮ Tell me who I am: An interactive recommendation system ⋮ Recent Developments in Algorithmic Teaching ⋮ DNF are teachable in the average case

This page was built for publication: Learning Binary Relations and Total Orders