3 citations · 3 across the 5 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2024
Optimal estimation of Gaussian (poly)trees
Yuhao Wang, Ming Gao, Wai Ming Tai +2
We develop optimal algorithms for learning undirected Gaussian trees and directed Gaussian polytrees from data. We consider both problems of distribution learning (i.e. in KL dista…
cs.LG2021★ 3 cited
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families
Goutham Rajendran, Bohdan Kivva, Ming Gao +1
Greedy algorithms have long been a workhorse for learning graphical models, and more broadly for learning statistical models with sparse structure. In the context of learning direc…