Sequential sampling techniques for algorithmic learning theory

DOI10.1016/j.tcs.2005.09.003zbMath1081.68037OpenAlexW2148292883MaRDI QIDQ2581359

Osamu Watanabe

Publication date: 10 January 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.003

zbMATH Keywords

Chernoff boundAdaptive samplingSequential samplingHoeffding boundAdaptive learning algorithm

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Efficient sampling strategies for relational database operations
• Adaptive sampling methods for scaling up knowledge discovery algorithms
• Query size estimation by adaptive sampling
• PALO: a probabilistic hill-climbing algorithm
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential sampling techniques for algorithmic learning theory