arXiv (All)
open access
Graph Learning with Spectral Connectivity Priors for Scarce Data
Learning a sparse graph from scarce data is practically important but challenging. Motivated by the desirable combination of local sparsity and strong global connectivity exhibited by expander-like graphs, we propose spectral connectivity-regularized graph learning (SCoGL), a framework that incorpor
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
- Semiparametric Bayesian structure learning of nonparanormal directed acyclic graphs with local--global shrinkage#1070515
- RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion#141536
- Adaptive Regularization via Extreme Value Distributions for Gaussian Graphical Models#972729
- IGNN: An improved graph neufral network with integrated attention and pre-message-passing for few-shot image classification.#143038
- Recovering Unobserved Network Links from Aggregated Relational Data: Bayesian Latent Surface Modeling and Penalized Regression#996861
Record · ID 1063489
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