Sequential sampling techniques for algorithmic learning theory
From MaRDI portal
Recommendations
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Adaptive sampling methods for scaling up knowledge discovery algorithms
- Efficient sampling strategies for relational database operations
- scientific article; zbMATH DE number 51379 (Why is no real title available?)
- scientific article; zbMATH DE number 1461225 (Why is no real title available?)
- scientific article; zbMATH DE number 1453042 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3062496 (Why is no real title available?)
- PALO: a probabilistic hill-climbing algorithm
- Probability Inequalities for Sums of Bounded Random Variables
- Query size estimation by adaptive sampling
Cited in
(9)- A sequential sampling procedure for genetic algorithms
- Absolute convergence and error thresholds in non-active adaptive sampling
- scientific article; zbMATH DE number 1984563 (Why is no real title available?)
- scientific article; zbMATH DE number 2080438 (Why is no real title available?)
- scientific article; zbMATH DE number 2083809 (Why is no real title available?)
- scientific article; zbMATH DE number 2090195 (Why is no real title available?)
- Sequential schemes for frequentist estimation of properties in statistical model checking
- Better sum estimation via weighted sampling
- Optimal learning for sequential sampling with non-parametric beliefs
This page was built for publication: Sequential sampling techniques for algorithmic learning theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581359)