← Search

Ioakeim Perros

2 accepted papers

2019

Guaranteed Scalable Learning of Latent Tree Models

UAI 2019poster

We present an integrated approach to structure and parameter estimation in latent tree graphical models, where some nodes are hidden. Our overall approach follows a “divide-and-conquer” strategy that learns models over small groups of variables and iteratively merges into a global solution. The s…

Cited by 10SourcePDFScholar
2016

SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling

NeurIPS 2016poster

Tensor CANDECOMP/PARAFAC (CP) decomposition is a powerful but computationally challenging tool in modern data analytics. In this paper, we show ways of sampling intermediate steps of alternating minimization algorithms for computing low rank tensor CP decompositions, leading to the sparse alternatin…