Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families

Aug-16-2025, 08:05:28 GMT–Neural Information Processing Systems 

In practice, however, they are very efficient.