Papers › LaProp: Separating Momentum and Adaptivity in Adam

LaProp: Separating Momentum and Adaptivity in Adam

12 Feb 2020arXiv:2002.04839archive 2025-07-28

Liu Ziyin, Zhikang T. Wang, Masahito Ueda

We identity a by-far-unrecognized problem of Adam-style optimizers which results from unnecessary coupling between momentum and adaptivity. The coupling leads to instability and divergence when the momentum and adaptivity parameters are mismatched. In this work, we propose a method, Laprop, which decouples momentum and adaptivity in the Adam-style methods. We show that the decoupling leads to greater flexibility in the hyperparameters and allows for a straightforward interpolation between the signed gradient methods and the adaptive gradient methods. We experimentally show that Laprop has consistently improved speed and stability over Adam on a variety of tasks. We also bound the regret of Laprop on a convex problem and show that our bound differs from that of Adam by a key factor, which demonstrates its advantage.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2002.04839")

Code

Syntology Ran 3 of 7 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 3 ran with no contract checked.

By repository: official repository: 7 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Z-T-WANG/LaProp-Optimizer officialmentioned in papermentioned on GitHubpytorchMIT report
huggingface/pytorch-image-models mentioned on GitHubpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 3 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

3ran
4unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from Z-T-WANG/LaProp-Optimizer. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

make_atari Z-T-WANG/LaProp-Optimizer/rainbow/common/wrappers.py official repository ran MIT (permissive) · 6eb2fa89d6e4a36b · report
wrap_deepmind Z-T-WANG/LaProp-Optimizer/rainbow/common/wrappers.py official repository ran MIT (permissive) · 34023060eaec34a2 · report
wrap_pytorch Z-T-WANG/LaProp-Optimizer/rainbow/common/wrappers.py official repository ran MIT (permissive) · d818d11d4b5f6381 · report
DQN Z-T-WANG/LaProp-Optimizer/rainbow/model.py official repository unverified MIT (permissive) · ed2dc93a9723ec69 · report
beta_scheduler Z-T-WANG/LaProp-Optimizer/rainbow/common/utils.py official repository unverified MIT (permissive) · 11fc51b3483204eb · report
create_log_dir Z-T-WANG/LaProp-Optimizer/rainbow/common/utils.py official repository unverified MIT (permissive) · 878f223c996c5522 · report
epsilon_scheduler Z-T-WANG/LaProp-Optimizer/rainbow/common/utils.py official repository unverified MIT (permissive) · 2e0c79ff61cfd9ae · report

Tasks

Reinforcement LearningStyle Transfer

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdamSPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections