{"id":"2205.11610","title":"uGLAD: Sparse graph recovery by optimizing deep unrolled networks","url":"https://codeofpaper.com/paper/2205.11610","arxiv_url":"https://arxiv.org/abs/2205.11610","published":"2022-05-23","code":"official","best":{"full_name":"Harshs27/uGLAD","url":"https://github.com/Harshs27/uGLAD","tier":"official","stars":9,"license":null,"framework":null,"language":"Python","last_commit":"2025-08-13T20:52:33"},"most_starred_community":null,"implementations":[{"full_name":"Harshs27/uGLAD","url":"https://github.com/Harshs27/uGLAD","tier":"official","stars":9,"license":null,"framework":null,"language":"Python","last_commit":"2025-08-13T20:52:33"}],"possible_matches":0}