5 citations · 8 across the 3 of their papers we have counts for
4 papers · 1 filter
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…
On the automorphism groups of rank-4 primitive coherent configurations
Bohdan Kivva
The minimal degree of a permutation group is the minimum number of points not fixed by non-identity elements of . Lower bounds on the minimal degree have strong structural c…
Learning latent causal graphs via mixture oracles
Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar +1
We study the problem of reconstructing a causal graphical model from data in the presence of latent variables. The main problem of interest is recovering the causal structure over…
Improved upper bounds for the rigidity of Kronecker products
Bohdan Kivva
The rigidity of a matrix for target rank is the minimum number of entries of that need to be changed in order to obtain a matrix of rank at most . At MFCS'77, Valian…