Difference-of-Convex Regularization for Graph Learning by Differentiable Programming
DGX agentarXiv:2608.12757v1 Announce Type: cross Abstract: Laplacian-regularized minimization is fundamental in signal processing and machine learning, but is limited by the dense and ill-conditioned nature of