Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lukasz Gniecki

dblp:379/5356 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 60% Efficient and distributed learning · 40%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.812024
Sparser, Better, Deeper, Stronger: Improving Static Sparse Training with Exact Orthogonal Initialization · ICML 2024
Machine learning › Deep learning architectures and training › weight initialization
orthogonal initialization
0.812024
Sparser, Better, Deeper, Stronger: Improving Static Sparse Training with Exact Orthogonal Initialization · ICML 2024
Machine learning › Deep learning architectures and training › weight initialization
sparse initialization
0.812024
Sparser, Better, Deeper, Stronger: Improving Static Sparse Training with Exact Orthogonal Initialization · ICML 2024
Machine learning › Efficient and distributed learning › model compression
sparse training
0.812024
Sparser, Better, Deeper, Stronger: Improving Static Sparse Training with Exact Orthogonal Initialization · ICML 2024
Machine learning › Deep learning architectures and training
weight initialization
0.812024
Sparser, Better, Deeper, Stronger: Improving Static Sparse Training with Exact Orthogonal Initialization · ICML 2024

Methods — techniques the papers use, named apart from their topics

givens rotations · 0.8dynamical isometry · 0.8
YearPublicationVenuePosition
2024 Sparser, Better, Deeper, Stronger: Improving Static Sparse Training with Exact Orthogonal Initialization
abstract
Static sparse training aims to train sparse models from scratch, achieving remarkable results in recent years. A key design choice is given by the sparse initialization, which determines the trainable sub-network through a binary mask. Existing methods mainly select such mask based on a predefined dense initialization. Such an approach may not efficiently leverage the mask's potential impact on the optimization. An alternative direction, inspired by research into dynamical isometry, is to introduce orthogonality in the sparse subnetwork, which helps in stabilizing the gradient signal. In this work, we propose Exact Orthogonal Initialization (EOI), a novel sparse orthogonal initialization scheme based on composing random Givens rotations. Contrary to other existing approaches, our method provides exact (not approximated) orthogonality and enables the creation of layers with arbitrary densities. We demonstrate the superior effectiveness and efficiency of EOI through experiments, consistently outperforming common sparse initialization techniques. Our method enables training highly sparse 1000-layer MLP and CNN networks without residual connections or normalization techniques, emphasizing the crucial role of weight initialization in static sparse training alongside sparse mask selection.
Aleksandra Nowak 0001, Lukasz Gniecki, Filip Szatkowski, Jacek Tabor
ICML2