arXiv (All)
open access
Recursive Computation of Path Homology for Stratified Digraphs
Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensional ones due to high computational complexity. A recursive algorithm is proposed to compute certain high-dimensional (reduced) path homologies of stra
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
- Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization#1117280
- Spiking neural networks for handwritten digit recognition - Supervised learning and network optimization#19749
- Subsea optical links characterization assisted by machine learning. (Caractérisation des liaisons optiques sous-marines assistée par machine learning).#489530
- Blog: Survey of Optimizers#792552
- Blog: Survey of Optimizers#788552
Record · ID 820169
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