atlas

Research map / Learning theory and algorithms / Sample complexity

Sparse Logistic Regression Learns All Discrete Pairwise Graphical Models

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 30 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use an ℓ2,1 constraint instead of an ℓ1 constraint for general-alphabet logistic regression (ablation)Pairwise graphical model structure learning · General discrete pairwise graphical modelssample complexity dependence on alphabet size: k^5 -> k^4Helped
Use ℓ2,1-constrained logistic regression rather than SparsitronGeneral pairwise graphical model structure learning · 3-by-3 grid, k=4 and k=6samples required for graph recoveryHelped
Apply ℓ1-constrained logistic regression without an incoherence conditionIsing model structure learning · Diamond graph simulation with incoherence value above 1exact graph recoveryHelped
Optimize the constrained regressions using mirror descentProposed logistic-regression graph recovery algorithms · Ising and general pairwise graphical modelsruntime while retaining statistical guarantees: \tilde{O}(n^2)Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy