Greedy Gaussian segmentation of multivariate time series

D Hallac, P Nystrup, S Boyd - Advances in Data Analysis and Classification, 2019 - Springer
We consider the problem of breaking a multivariate (vector) time series into segments over
which the data is well explained as independent samples from a Gaussian distribution. We …

A computationally efficient method for learning exponential family distributions

A Shah, D Shah, G Wornell - Advances in neural …, 2021 - proceedings.neurips.cc
We consider the question of learning the natural parameters of a $ k $ parameter\textit
{minimal} exponential family from iid samples in a computationally and statistically efficient …

[HTML][HTML] Graphical models for zero-inflated single cell gene expression

A McDavid, R Gottardo, N Simon… - The annals of applied …, 2019 - ncbi.nlm.nih.gov
Bulk gene expression experiments relied on aggregations of thousands of cells to measure
the average expression in an organism. Advances in microfluidic and droplet sequencing …

On learning continuous pairwise markov random fields

A Shah, D Shah, G Wornell - International conference on …, 2021 - proceedings.mlr.press
We consider learning a sparse pairwise Markov Random Field (MRF) with continuous-
valued variables from iid samples. We adapt the algorithm of Vuffray et al.(2019) to this …

On Computationally Efficient Learning of Exponential Family Distributions

A Shah, D Shah, GW Wornell - arXiv preprint arXiv:2309.06413, 2023 - arxiv.org
We consider the classical problem of learning, with arbitrary accuracy, the natural
parameters of a $ k $-parameter truncated\textit {minimal} exponential family from iid …

Square root graphical models: Multivariate generalizations of univariate exponential families that permit positive dependencies

D Inouye, P Ravikumar… - … conference on machine …, 2016 - proceedings.mlr.press
Abstract We develop Square Root Graphical Models (SQR), a novel class of parametric
graphical models that provides multivariate generalizations of univariate exponential family …

Learning the network structure of heterogeneous data via pairwise exponential Markov random fields

Y Park, D Hallac, S Boyd… - Artificial Intelligence and …, 2017 - proceedings.mlr.press
Markov random fields (MRFs) are a useful tool for modeling relationships present in large
and high-dimensional data. Often, this data comes from various sources and can have …

Learning continuous exponential families beyond gaussian

CX Ren, S Misra, M Vuffray, AY Lokhov - arXiv preprint arXiv:2102.09198, 2021 - arxiv.org
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 …

Ordinal graphical models: A tale of two approaches

AS Suggala, E Yang… - … conference on machine …, 2017 - proceedings.mlr.press
Undirected graphical models or Markov random fields (MRFs) are widely used for modeling
multivariate probability distributions. Much of the work on MRFs has focused on continuous …

A Unified Theory of Exact Inference and Learning in Exponential Family Latent Variable Models

S Sokoloski - arXiv preprint arXiv:2404.19501, 2024 - arxiv.org
Bayes' rule describes how to infer posterior beliefs about latent variables given
observations, and inference is a critical step in learning algorithms for latent variable models …