atlas

Research map / Architectures and efficiency / Pruning and efficient tuning

LEMON: Lossless model expansion

ICLR 2024 · Architectures and efficiency › Pruning and efficient tuning · approach: Parameter-efficient transfer analysis · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes LEMON, a lossless model expansion recipe that initializes larger Transformers from smaller pre-trained ones (with symmetry-breaking width expansion, average expansion for LayerNorm, and lossless depth expansion) plus a faster-decaying learning rate schedule, cutting training cost for ViT and BERT.

Problem

Training large Transformers from scratch wastes the knowledge in already-trained smaller models; existing model expansion methods either break losslessness, suffer symmetry breaking, or cannot handle indivisible width increases or diverse Transformer variants.

Approach

Lossless expansion of width and depth for Transformers that breaks neuron symmetry by using unequal fan-out coefficients, handles indivisible width via average expansion with a rescaled LayerNorm, and pairs this with a learning rate scheduler that uses the same maximum LR but decays faster.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Expand ViT(6,384) to ViT(12,768) with LEMON instead of training from scratchVision Transformer · ImageNet-1kcomputational cost savings: 56.7%Helped
Expand ViT(6,512) to ViT(12,768) with LEMON instead of training from scratchVision Transformer · ImageNet-1kcomputational cost savings: 56.7%Helped
Expand BERT(6,384) to BERT(12,768) with LEMON instead of training from scratchBERT · English Wikicomputational cost savings: 25.5%Helped
Expand BERT(6,512) to BERT(12,768) with LEMON instead of training from scratchBERT · English Wikicomputational cost savings: 33.2%Helped
Use a smaller maximum learning rate instead of the default maximum learning rate (ablation)Expanded ViT(12,768) · ImageNet-1kvalidation accuracyHurt
Use the default maximum learning rate rather than a reduced maximum learning rate (ablation)Expanded ViT(12,768) · ImageNet-1kvalidation accuracyHelped
Use faster learning-rate decay rather than the default longer schedule (ablation)Expanded ViT(12,768) · ImageNet-1kepochs to match target-model performance: 130 epochs; 56.67%Helped
Apply the optimized faster-decay training recipe to baseline expansion methods (ablation)Expanded Vision Transformers · ImageNet-1ktraining speedHelped
Use soft knowledge inheritance instead of LEMONVision Transformer target model · ImageNet-1ktraining speedNo clear effect
Use hard knowledge inheritance instead of soft knowledge inheritanceVision Transformer target model · ImageNet-1ktraining speedHelped
Use bert2BERT-FPI or bert2BERT-AKI instead of LEMONVision Transformer target model · ImageNet-1kvalidation accuracyHurt
Expand BERT(6,384) rather than BERT(6,512) to BERT(12,768)LEMON BERT · GLUEdownstream performance: 0.848 -> 0.866; 83.82 -> 85.54; 0.36 -> 0.38; 90.14 -> 90.94; 88.76 -> 89.33; 80.92 -> 81.81; 81.57 -> 81.81; 89.91 -> 9Helped

Surprising findings

Limitations

Experimental setup

Datasets: ImageNet-1k English Wikipedia GLUE

Benchmarks: ImageNet-1k English Wiki MLM GLUE

Metrics: validation accuracy MLM validation loss training iterations/epochs to target computational cost savings GLUE accuracy/correlation/MCC

Baselines: Train from scratch bert2BERT-FPI bert2BERT-AKI soft KI hard KI LiGO

Builds on: Net2Net bert2BERT Staged training knowledge inheritance DeiT

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy