arXiv (All)
open access
Improved large-scale graph learning through ridge spectral sparsification
Graph-based techniques and spectral graph theory have enriched the field of machine learning with a variety of critical advances. A central object in the analysis is the graph Laplacian L, which encodes the structure of the graph. We consider the problem of learning over this Laplacian in a distribu
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
- A New Sufficient Condition for Oriented Graphs Determined by Their Generalized Skew Spectra#926349
- Teaching MLP More Graph Information: A Three-stage Multitask Knowledge Distillation Framework#1326068
- Expander Hierarchies for Normalized Cuts on Graphs#163040
- Beyond Cut Balance: Spectral Sparsification of the Nonlinear Directed Laplacian#985555
- Spectrally symmetric orientations of graphs#997458
Record · ID 1199807
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