6 citations · 24 across the 9 of their papers we have counts for
10 papers
Identifiability of deep generative models without auxiliary information
Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar +1
We prove identifiability of a broad class of deep latent variable models that (a) have universal approximation capabilities and (b) are the decoders of variational autoencoders tha…
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…
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS
Bohdan Kivva, Aaron Potechin
In this paper we show that simple semidefinite programs inspired by degree SOS can exactly solve the tensor nuclear norm, tensor decomposition, and tensor completion problems o…
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
Bohdan Kivva
One of the central results in the representation theory of distance-regular graphs classifies distance-regular graphs with and second largest eigenvalue . In…
On the spectral gap and the automorphism group of distance-regular graphs
Bohdan Kivva
We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the…
On the automorphism groups of distance-regular graphs and 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…
Automaton groups and complete square complexes
Ievgen Bondarenko, Bohdan Kivva
The first example of a non-residually finite group in the classes of finitely presented small-cancelation groups, automatic groups, and CAT(0) groups was constructed by Wise as the…