prunAdag separates parameters into optimisable and decreasable sets, updates them with Adagrad-like rules, and provably drives the average gradient norm to zero at rate O(log(k)/sqrt(k+1)).
Adaptive subgradient methods for online learning and stochastic optimization.,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
prunAdag: an adaptive pruning-aware gradient method
prunAdag separates parameters into optimisable and decreasable sets, updates them with Adagrad-like rules, and provably drives the average gradient norm to zero at rate O(log(k)/sqrt(k+1)).