Research map / Learning theory and algorithms / Sample complexity
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families
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
- Learning Exponential Families from Truncated Samples (NeurIPS 2023 · similarity 0.89)
- Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk (NeurIPS 2023 · similarity 0.86)
- Sampling from Log-Concave Distributions with Infinity-Distance Guarantees (NeurIPS 2022 · similarity 0.86)
- Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers (ICLR 2024 · similarity 0.85)
- Sample Complexity of Branch-length Estimation by Maximum Likelihood (ICML 2025 · similarity 0.83)
- Chain of Log-Concave Markov Chains (ICLR 2024 · 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.