17 citations · 17 across the 1 of their papers we have counts for
3 papers
Does the -norm Learn a Sparse Graph under Laplacian Constrained Graphical Models?
Jiaxi Ying, José Vinícius de M. Cardoso, Daniel P. Palomar
We consider the problem of learning a sparse graph under the Laplacian constrained Gaussian graphical models. This problem can be formulated as a penalized maximum likelihood estim…
Learning Undirected Graphs in Financial Markets
José Vinícius de Miranda Cardoso, Daniel P. Palomar
We investigate the problem of learning undirected graphical models under Laplacian structural constraints from the point of view of financial market data. We show that Laplacian co…
Structured Graph Learning Via Laplacian Spectral Constraints
Sandeep Kumar, Jiaxi Ying, Jos'e Vin'icius de M. Cardoso +1
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning fro…