Faster Sublinear Algorithms using Conditional Sampling.
Themistoklis GouleakisChristos TzamosManolis ZampetakisPublished in: SODA (2017)
Keyphrases
- optimization problems
- learning algorithm
- computationally demanding
- computationally efficient
- sampling strategy
- times faster
- machine learning
- computational cost
- significant improvement
- evolutionary algorithm
- upper bound
- worst case
- theoretical analysis
- sample size
- computational efficiency
- random sampling
- sampling algorithm
- data structure
- objective function
- sampling strategies