Implicit vs unfolded graph neural networks

MaRDI QIDQ6947054zbMATH OpenFDO

Authors Yongyi Yang, Tang Liu, Yangkun Wang, Zengfeng Huang, David P. Wipf

Publication date 5 August 2025

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://jmlr.org/papers/v26/22-0459.html

zbMATH Keywords

algorithm unfoldingbilevel optimizationgraph neural networksgraph-regularized energy functionsimplicit deep learning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial neural networks and deep learning (68T07) Applications of mathematical programming (90C90)

Cites work

• A characterization of proximity operators
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3905641 (Why is no real title available?)
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 3716008 (Why is no real title available?)
• Proximal splitting methods in signal processing
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

This page was built for publication: Implicit vs unfolded graph neural networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947054)