On Exact Learning from Random Walk

DOI10.1007/11894841_17zbMATH Open1168.68393OpenAlexW2124151042MaRDI QIDQ3522985FDOQ3522985

Nader H. Bshouty, Iddo Bentov

Publication date: 4 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11894841_17

Mathematics Subject Classification ID

Computational learning theory (68Q32) Sums of independent random variables; random walks (60G50)

Cited In (7)

• On learning thresholds of parities and unions of rectangles in random walk models
• Learning Theory
• Exploiting random walks for learning
• Exact learning when irrelevant variables abound
• Title not available (Why is that?)
• Exact and efficient sampling of conditioned walks
• On biased random walks, corrupted intervals, and learning under adversarial design

   Recommendations

• Exploiting random walks for learning 👍 👎
• Title not available (Why is that?) 👍 👎
• Learning DNF from random walks 👍 👎
• Title not available (Why is that?) 👍 👎
• Learning Theory 👍 👎

This page was built for publication: On Exact Learning from Random Walk

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