Towards Explaining the Power of Constant-depth Graph Neural Networks for Structured Linear Programming
No confident code implementation found for this paper. 3 possible matches can be shown below.
No confident code implementation found for this paper. 3 possible matches can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
OGNI-DC: Robust Depth Completion with Optimization-Guided Neural Iterations
Illustrator's Depth: Monocular Layer Index Prediction for Image Decomposition
Repurposing Diffusion-Based Image Generators for Monocular Depth Estimation
DCPI-Depth: Explicitly Infusing Dense Correspondence Prior to Unsupervised Monocular Depth Estimation
Depth Anything: Unleashing the Power of Large-Scale Unlabeled Data
PatchRefiner: Leveraging Synthetic Data for Real-Domain High-Resolution Monocular Metric Depth Estimation
@article{li2026towards,
title = {Towards Explaining the Power of Constant-depth Graph Neural Networks for Structured Linear Programming},
author = {Qian Li and Minghui Ouyang and Tian Ding and Yuyi Wang and Qingjiang Shi and Ruoyu Sun},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:2bd726b260709ad1d0880347aa5a812169c103e9},
journal = {ICLR 2025 2025}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2bd726b260709ad1d0880347aa5a812169c103e9)