REVIEW 18 cited by
Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stopping
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
read the original abstract
Fine-tuning pretrained contextual word embedding models to supervised downstream tasks has become commonplace in natural language processing. This process, however, is often brittle: even with the same hyperparameter values, distinct random seeds can lead to substantially different results. To better understand this phenomenon, we experiment with four datasets from the GLUE benchmark, fine-tuning BERT hundreds of times on each while varying only the random seeds. We find substantial performance increases compared to previously reported results, and we quantify how the performance of the best-found model varies as a function of the number of fine-tuning trials. Further, we examine two factors influenced by the choice of random seed: weight initialization and training data order. We find that both contribute comparably to the variance of out-of-sample performance, and that some weight initializations perform well across all tasks explored. On small datasets, we observe that many fine-tuning trials diverge part of the way through training, and we offer best practices for practitioners to stop training less promising runs early. We publicly release all of our experimental data, including training and validation scores for 2,100 trials, to encourage further analysis of training dynamics during fine-tuning.
Forward citations
Cited by 18 Pith papers
-
Phantom Transitions in Language Model Fine-Tuning: A Density-Matrix Analysis
Apparent phase transitions during fine-tuning on near-synonym tasks are phantoms originating in the softmax readout; an order parameter isolates kinematic and structural failure modes and a few dimensionless quantitie...
-
What We Observe as LLM Behavior Can Be a Side-effect of Inference Backend
Inference backend choice alone can shift LLM benchmark scores by up to 0.055 mean absolute divergence and change which questions are answered correctly, even under greedy decoding.
-
Training Large Language Models for Self-Explanation Faithfulness
RL fine-tuning with a counterfactual mention/influence reward raises LLM self-explanation faithfulness (Phi-CCT) from near zero to ~0.66 in-distribution for two 8B models, with partial transfer to held-out tasks.
-
In-Context Probing for Membership Inference in Fine-Tuned Language Models
ICP-MIA infers membership in fine-tuned LLMs by measuring confidence improvement under in-context probes, beating prior black-box attacks at low false-positive rates.
-
LobRA: Multi-tenant Fine-tuning over Heterogeneous Data
LobRA reduces GPU seconds for multi-tenant LoRA fine-tuning by 45.03%-60.67% through heterogeneous FT replicas and per-step workload-balanced dispatching.
-
Improving Data and Parameter Efficiency of Neural Language Models Using Representation Analysis
Representation smoothness can be used to regularize training, stop early without validation labels, and guide active learning combined with parameter-efficient fine-tuning, reducing data and compute.
-
Can Interpretation Predict Behavior on Unseen Data?
Presence of hierarchical attention heads on in-distribution data predicts hierarchical out-of-distribution generalization across 270 small transformers, independent of causal support.
-
Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods
A new concentration lemma for almost super-martingales yields a stopping-time convergence rate of O(log(tau)/sqrt(tau)) for a momentum SGD variant, removing one logarithmic factor.
-
RewardAnything: Generalizable Principle-Following Reward Models
RewardAnything follows natural-language reward principles at inference time and, with the new RABench benchmark, demonstrates that principle-conditioned listwise training beats fixed-preference reward models on held-o...
-
Latent-LoRA: Compact Latent-Space Adapters with Gradient-Free Routing for Continual Learning
Frozen-embedding GMMs route compact SVD-subspace LoRA adapters for task-agnostic continual learning with SOTA average performance and near-zero forgetting.
-
Stay Unique, Stay Efficient: Preserving Model Personality in Multi-Task Merging
DTS approximates task-specific model deltas with truncated SVD plus grouped thresholding and scaling, achieving near-individual multi-task accuracy with ~1% extra storage per task.
-
SindBERT, the Sailor: Charting the Seas of Turkish NLP
SindBERT releases Turkish RoBERTa base/large models trained on 312GB of text; they match existing models, with the large variant best on two of four tasks and little scaling gain.
-
Gradient-Based Model Fingerprinting for LLM Similarity Detection and Family Classification
TensorGuard classifies fine-tuned LLMs into their base-model families with 94% accuracy by clustering statistical features of weight gradients under random input perturbations.
-
Behavioral Augmentation of UML Class Diagrams: An Empirical Study of Large Language Models for Method Generation
Nine LLMs generated 3,373 UML methods across 90 diagrams from waste-management use cases, producing mostly valid, structurally faithful output with notable cross-model naming consensus.
-
Beyond Transfer Accuracy: Faithful Circuits for Controlled Low-Resource Adaptation
A mechanism-guided fine-tuning method that updates only task-relevant attention heads (found via adapted CD-T) can reduce catastrophic forgetting in low-resource cross-lingual transfer, though the headline results rel...
-
GeistBERT: Breathing Life into German NLP
A 126M-parameter German BERT, pretrained further on 1.3TB of mixed German text, beats other base models on most tested German NLP benchmarks.
-
Revisiting Bayesian Model Averaging in the Era of Foundation Models
The paper proposes Bayesian model averaging and an entropy-minimizing weight optimizer for ensembling foundation models, reporting accuracy gains over output averaging on image and text classification tasks.
-
Alignment and Safety in Large Language Models: Safety Mechanisms, Training Paradigms, and Emerging Challenges
A broad survey of LLM alignment that catalogs objectives, benchmarks, SFT/RLHF/DPO methods, and safety challenges, without contributing new experimental or theoretical results.
Discussion (0). Sign in to comment.