Pith. sign in

REVIEW

To Raise or Not To Raise: The Autonomous Learning Rate Question

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.08767 v3 pith:DLOOAGLD submitted 2021-06-16 cs.LG

classification cs.LG
keywords learningratequestionanswerautonomousgreatraisethere
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

There is a parameter ubiquitous throughout the deep learning world: learning rate. There is likewise a ubiquitous question: what should that learning rate be? The true answer to this question is often tedious and time consuming to obtain, and a great deal of arcane knowledge has accumulated in recent years over how to pick and modify learning rates to achieve optimal training performance. Moreover, the long hours spent carefully crafting the perfect learning rate can come to nothing the moment your network architecture, optimizer, dataset, or initial conditions change ever so slightly. But it need not be this way. We propose a new answer to the great learning rate question: the Autonomous Learning Rate Controller. Find it at https://github.com/fastestimator/ARC/tree/v2.0

Discussion (0). Continue with ORCID to comment.

Pith tools