Pith. sign in

REVIEW 1 cited by

Scheduling Techniques for Liver Segmentation: ReduceLRonPlateau Vs OneCycleLR

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 2202.06373 v1 pith:SU7VEWF4 submitted 2022-02-13 cs.CV cs.LGeess.IV

classification cs.CVcs.LGeess.IV
keywords onecyclelrsegmentationdatasetliverreducelronplateauresultsvalidationepochs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Machine learning and computer vision techniques have influenced many fields including the biomedical one. The aim of this paper is to investigate the important concept of schedulers in manipulating the learning rate (LR), for the liver segmentation task, throughout the training process, focusing on the newly devised OneCycleLR against the ReduceLRonPlateau. A dataset, published in 2018 and produced by the Medical Segmentation Decathlon Challenge organizers, called Task 8 Hepatic Vessel (MSDC-T8) has been used for testing and validation. The reported results that have the same number of maximum epochs (75), and are the average of 5-fold cross-validation, indicate that ReduceLRonPlateau converges faster while maintaining a similar or even better loss score on the validation set when compared to OneCycleLR. The epoch at which the peak LR occurs perhaps should be made early for the OneCycleLR such that the super-convergence feature can be observed. Moreover, the overall results outperform the state-of-the-art results from the researchers who published the liver masks for this dataset. To conclude, both schedulers are suitable for medical segmentation challenges, especially the MSDC-T8 dataset, and can be used confidently in rapidly converging the validation loss with a minimal number of epochs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Structure-Aware Compound-Protein Affinity Prediction via Graph Neural Networks with Group Lasso Regularization

    cs.LG 2025-07 conditional novelty 6.0 of 10

    Adding common-plus-uncommon substructure masks and group lasso or sparse group lasso losses to activity-cliff GNNs improves per-target pIC50 prediction and attribution consistency on six tyrosine kinases.

Pith tools