Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms.
Oliver GebhardMax Hahn-KlimrothOlaf ParczykManuel PenschuckMaurice RolvienJonathan ScarlettNelvin TanPublished in: IEEE Trans. Inf. Theory (2022)
Keyphrases
- group testing
- worst case
- theoretical analysis
- upper and lower bounds
- times faster
- learning algorithm
- data structure
- high dimensional
- orders of magnitude
- pac bayesian
- randomized algorithms
- average case
- combinatorial optimization
- computational efficiency
- machine learning algorithms
- optimization problems
- upper bound
- reinforcement learning