Research map / Learning theory and algorithms / Sample complexity
Maximum sampled conditional likelihood for informative subsampling
HaiYing Wang, Jae Kwang Kim
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
- Scale-invariant Optimal Sampling for Rare-events Data and Sparse Models (NeurIPS 2024 · similarity 0.89)
- Optimal Subsampling with Influence Functions (NeurIPS 2018 · similarity 0.88)
- Robust Gradient-Based Markov Subsampling (AAAI 2020 · similarity 0.87)
- Direct Fisher Score Estimation for Likelihood Maximization (NeurIPS 2025 · similarity 0.85)
- Robust Sampling for Active Statistical Inference (NeurIPS 2025 · similarity 0.85)
- A Black-Box Debiasing Framework for Conditional Sampling (NeurIPS 2025 · similarity 0.84)
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.
