Structural results about on-line learning models with and without queries

DOI10.1023/A:1007614417594zbMath0947.68080OpenAlexW1581366585MaRDI QIDQ1961317

Peter Auer, Philip M. Long

Publication date: 17 January 2000

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007614417594

zbMATH Keywords

computational learning theorylearning with queries

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (7)

Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning ⋮ Randomized prediction of individual sequences ⋮ Learning conditional preference networks ⋮ A note on the price of bandit feedback for mistake-bounded online learning ⋮ The complexity of exact learning of acyclic conditional preference networks from swap examples ⋮ New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ⋮ Theory revision with queries: Horn, read-once, and parity formulas

This page was built for publication: Structural results about on-line learning models with and without queries