Research map / Learning theory and algorithms / Sample complexity
Greedy Approximation Algorithms for Active Sequential Hypothesis Testing
Kyra Gan, Su Jia, Andrew A Li
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- A Bandit Approach to Sequential Experimental Design with False Discovery Control (NeurIPS 2018 · similarity 0.87)
- Adaptive Active Hypothesis Testing under Limited Information (NeurIPS 2017 · similarity 0.86)
- Efficient Biological Data Acquisition through Inference Set Design (ICLR 2025 · similarity 0.84)
- Peeking with PEAK: Sequential, Nonparametric Composite Hypothesis Tests for Means of Multiple Data Streams (ICML 2024 · similarity 0.83)
- Performance Bounds for Active Binary Testing with Information Maximization (ICML 2024 · similarity 0.82)
- YEAST: Yet Another Sequential Test (NeurIPS 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
