{"total":26,"rows":[{"id":"2403.03659","title":"Robust Graph Structure Learning under Heterophily","created":"2024-03-06","cited_by_count":11,"area":null},{"id":"2211.01717","title":"Learning Hypergraphs From Signals With Dual Smoothness Prior","created":"2022-11-03","cited_by_count":9,"area":null},{"id":"2310.04314","title":"Latent Graph Inference with Limited Supervision","created":"2023-10-06","cited_by_count":9,"area":null},{"id":"2211.06829","title":"Methods for Recovering Conditional Independence Graphs: A Survey","created":"2022-11-13","cited_by_count":7,"area":null},{"id":"2205.11610","title":"uGLAD: Sparse graph recovery by optimizing deep unrolled networks","created":"2022-05-23","cited_by_count":6,"area":null},{"id":"2305.15371","title":"Stochastic Unrolled Federated Learning","created":"2023-05-24","cited_by_count":6,"area":null},{"id":"2205.09575","title":"Learning Graph Structure from Convolutional Mixtures","created":"2022-05-19","cited_by_count":5,"area":null},{"id":"2308.14172","title":"A Markov Random Field model for Hypergraph-based Machine Learning","created":"2023-08-27","cited_by_count":5,"area":null},{"id":"2312.09778","title":"Hypergraph-MLP: Learning on Hypergraphs without Message Passing","created":"2023-12-15","cited_by_count":5,"area":null},{"id":"2405.19933","title":"Learning Latent Graph Structures and their Uncertainty","created":"2024-05-30","cited_by_count":4,"area":null},{"id":"2406.14786","title":"Graph Structure Learning with Interpretable Bayesian Neural Networks","created":"2024-06-20","cited_by_count":4,"area":null},{"id":"2302.13582","title":"Neural Graph Revealers","created":"2023-02-27","cited_by_count":3,"area":null},{"id":"2210.01002","title":"ASGNN: Graph Neural Networks with Adaptive Structure","created":"2022-10-03","cited_by_count":2,"area":null},{"id":"2503.08760","title":"Heterogeneous Graph Structure Learning through the Lens of Data-generating Processes","created":"2025-03-11","cited_by_count":2,"area":null},{"id":"2210.17101","title":"Unrolled Graph Learning for Multi-Agent Collaboration","created":"2022-10-31","cited_by_count":1,"area":null},{"id":"2301.06662","title":"Graph Learning Across Data Silos","created":"2023-01-17","cited_by_count":1,"area":null},{"id":"2302.04384","title":"SF-SGL: Solver-Free Spectral Graph Learning from Linear Measurements","created":"2023-02-09","cited_by_count":1,"area":null},{"id":"2403.06535","title":"Decentralized and Lifelong-Adaptive Multi-Agent Collaborative Learning","created":"2024-03-11","cited_by_count":1,"area":null},{"id":"2303.11647","title":"Are uGLAD? Time will tell!","created":"2023-03-21","cited_by_count":0,"area":null},{"id":"2308.05857","title":"Knowledge Propagation over Conditional Independence Graphs","created":"2023-08-10","cited_by_count":0,"area":null},{"id":"2308.12212","title":"Learning to Learn Financial Networks for Optimising Momentum Strategies","created":"2023-08-23","cited_by_count":0,"area":null},{"id":"2407.11429","title":"Joint Data Inpainting and Graph Learning via Unrolled Neural Networks","created":"2024-07-16","cited_by_count":0,"area":null},{"id":"2412.17734","title":"LASE: Learned Adjacency Spectral Embeddings","created":"2024-12-23","cited_by_count":0,"area":null},{"id":"2605.18316","title":"Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2608.19914","title":"Multi-Source Wasserstein Distributionally Robust Graph Learning","created":"2026-08-20","cited_by_count":0,"area":null},{"id":"2609.02286","title":"From topology learning to graph generation: A unifying perspective","created":"2026-09-02","cited_by_count":0,"area":null}],"next_cursor":null}