arXiv (All)
open access
Convex Optimization of Spiking Neural Networks with Global and Approximation Guarantees
Spiking neural networks (SNNs) have been proposed as energy-efficient alternatives to deep neural networks. Their training is non-convex and involves a non-differentiable spike function, so existing methods offer no guarantee of reaching a global optimum. We address this issue by formulating SNN opt
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
- Selection and Optimization of Temporal Spike Encoding Methods for Spiking Neural Networks#19745
- Improving Learning in Spiking Neural Networks#374444
- Contrastive Attention Mitigates Spectral Bias in Spiking Transformers#1156675
- What can a neuron compute#349739
- Neuromorphic architectures as numerical solvers for computational neuroscience#792397
Record · ID 1297122
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