Research map / Learning theory and algorithms / Sample complexity
Unified Lower Bounds for Interactive High-dimensional Estimation under Information Constraints
Read the paperCheck your idea against 108,967 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
- Distributed Nonparametric Estimation: from Sparse to Dense Samples per Terminal (ICML 2025 · similarity 0.87)
- Locally Optimal Private Sampling: Beyond the Global Minimax (NeurIPS 2025 · similarity 0.86)
- Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability (NeurIPS 2024 · similarity 0.86)
- Instance-Optimality for Private KL Distribution Estimation (NeurIPS 2025 · similarity 0.86)
- Public-data Assisted Private Stochastic Optimization: Power and Limitations (NeurIPS 2024 · similarity 0.85)
- Differentially Private Optimization with Sparse Gradients (NeurIPS 2024 · similarity 0.85)
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.