arXiv (All)
open access
Difference-of-Convex Regularization for Graph Learning by Differentiable Programming
Laplacian-regularized minimization is fundamental in signal processing and machine learning, but explicit construction of the dense graph Laplacian pseudoinverse can be computationally expensive. To address this issue, we consider the setting where the graph Laplacian is given and propose a Differen
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient Optimization on the Euclidean Sphere: Riemannian Gradient Alignment as a Unifying Principle#984625
- TIGER: Inverting Transformer Gradients via Embedding-Subspace Distance Optimization#287080
- GSNR: Graph Smooth Null-Space Representation for Inverse Problems#986825
- Adam or Gauss-Newton? A Comparative Study In Terms of Basis Alignment and SGD Noise#1117260
- A dictionary learning framework for graphs via filters and optimal transport#973536
Record · ID 1201036
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive