Research map / Learning theory and algorithms / Sample complexity
Efficient Learning of Discrete Graphical Models
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Suprise instead of the prior methods | Pairwise multi-alphabet graphical model structure recovery · Pairwise multi-alphabet models | sample complexity dependence on interaction strength: O(\exp(14\gamma)) -> O(\exp(12\gamma)) | Helped |
| Use Suprise instead of the cited prior method | Binary L-wise graphical model structure recovery · Binary L-wise models | sample complexity dependence on interaction strength: O(\exp(O(\gamma L))) -> O(\exp(4\gamma L)) | Helped |
Closest papers by meaning
- Learning of Discrete Graphical Models with Neural Networks (NeurIPS 2020 · similarity 0.87)
- Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics (ICML 2021 · similarity 0.87)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.86)
- Learning Gaussian DAG Models without Condition Number Bounds (ICML 2025 · similarity 0.85)
- Parameter Estimation in DAGs from Incomplete Data via Optimal Transport (ICML 2024 · similarity 0.85)
- A Generic Family of Graphical Models: Diversity, Efficiency, and Heterogeneity (ICML 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.