Learning Continuous Exponential Families Beyond Gaussian
Not on the map. Why?
Abstract (arXiv)
We address the problem of learning of continuous exponential family distributions with unbounded support. While a lot of progress has been made on learning of Gaussian graphical models, we still lack scalable algorithms for reconstructing general continuous exponential families modeling higher-order moments of the data beyond the mean and the covariance. Here, we introduce a computationally efficient method for learning continuous graphical models based on the Interaction Screening approach. Through a series of numerical experiments, we show that our estimator maintains similar requirements in terms of accuracy and sample complexity scalings compared to alternative approaches such as maximization of conditional likelihood, while considerably improving upon the algorithm's run-time.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 13 of its 50 references that are in the map. First posted on arXiv 18 Feb 2021.
Builds on
13 of 50 references.
References · 13
- 2015JuMP: A Modeling Language for Mathematical Optimizationcited by 49
- 2016Interaction Screening: Efficient and Sample-Optimal Learning of Ising Modelscited by 43
- 2017Learning Graphical Models Using Multiplicative Weightscited by 43
- 2013On Graphical Models via Univariate Exponential Family Distributionscited by 26
- 2016Optimal structure and parameter learning of Ising modelscited by 26
- 2019Efficient Learning of Discrete Graphical Modelscited by 21
- 2019Learning Some Popular Gaussian Graphical Models without Condition Number Boundscited by 20
- 2017Beyond normality: Learning sparse probabilistic graphical models in the non-Gaussian settingcited by 15
- 2020On Learning Continuous Pairwise Markov Random Fieldscited by 9
- 2019Learning Ising Models with Independent Failurescited by 8
- 2014On Semiparametric Exponential Family Graphical Modelscited by 6
- 2020Learning of Discrete Graphical Models with Neural Networkscited by 5
1 more
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 1; 2025: 0; 2026: 1.
6 papers.
- 2023Provable benefits of score matchingcited by 18
- 2021A Computationally Efficient Method for Learning Exponential Family Distributionscited by 10
- 2023Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dotscited by 8
- 2023On Computationally Efficient Learning of Exponential Family Distributionscited by 2
- 2024A Unified View on Learning Unnormalized Distributions via Noise-Contrastive Estimationcited by 2
- 2026Finite Sample Bounds for Learning with Score Matchingcited by 0
- 2026Finite Sample Bounds for Learning with Score Matching13 May 2026
- 2024A Unified View on Learning Unnormalized Distributions via Noise-Contrastive Estimation26 Sep 2024
- 2023Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots28 Nov 2023
- 2023On Computationally Efficient Learning of Exponential Family Distributions12 Sep 2023
- 2023Provable benefits of score matching3 Jun 2023
- 2021A Computationally Efficient Method for Learning Exponential Family Distributions28 Oct 2021