paper-with-me

Papers

Dense neural networks as sparse graphs and the lightning initialization

2018-09-24 · Thomas Pircher, Dominik Haspel, Eberhard Schlücker

Even though dense networks have lost importance today, they are still used as final logic elements. It could be shown that these dense networks can be simplified by the sparse graph interpretation. This in turn shows that the information flow between input and output is not optimal with an initialization common today. The lightning initialization sets the weights so that complete information paths exist between input and output from the start. It turned out that pure dense networks and also more complex networks with additional layers benefit from this initialization. The networks accuracy increases faster. The lightning initialization has two parameters which behaved robustly in the tests carried out. However, especially with more complex networks, an improvement effect only occurs at lower learning rates, which shows that the initialization retains its positive effect over the epochs with learning rate reduction.

📄 PDF Abstract BibTeX arXiv:1809.08836

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

The Role and Relationship of Initialization and Densification in 3D Gaussian Splatting

2026-03-21 · Ivan Desiatov, Torsten Sattler arxiv

3D Gaussian Splatting (3DGS) has become the method of choice for photo-realistic 3D reconstruction of scenes, due to being able to efficiently and accurately recover the scene appearance and geometry from images. 3DGS re…

3D ReconstructionPoint Clouds

Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimization

2021-02-02 · Kale-ab Tessera, Sara Hooker, Benjamin Rosman

Training sparse networks to converge to the same performance as dense neural architectures has proven to be elusive. Recent work suggests that initialization is the key. However, while this direction of research has had …

Graphons of Line Graphs

2024-09-03 · Sevvandi Kandanaarachchi, Cheng Soon Ong

We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The m…

MPFlow: Learning Budgeted Max-Flow Optimization on the Lightning Network with Deep Graph Reinforcement Learning

2026-07-09 · Harrison Rush, Vincent Davis, Simone Antonelli, Vikash Singh 외 arxiv

We address liquidity placement in the Bitcoin Lightning Network (LN): given a fixed budget, which channels should a node open to maximize its routing capacity? We cast this as a budget-constrained combinatorial optimizat…

Reinforcement Learning

Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks

2022-06-02 · Mansheej Paul, Brett W. Larsen, Surya Ganguli, Jonathan Frankle 외

A striking observation about iterative magnitude pruning (IMP; Frankle et al. 2020) is that $\unicode{x2014}$ after just a few hundred steps of dense training $\unicode{x2014}$ the method can find a sparse sub-network th…