From Static to Dynamic: A Deeper, Faster, and Adaptive Language Modeling Approach
Bibliographic record
Abstract
Transformer-empowered Pre-trained language models (PrLM) have achieved great success in sumless natural language processing tasks. Meanwhile, keeping seeking better performance leads to deeper and deeper models, which is surely suboptimal by taking the same deep model for various input samples with different learnable complexities, let alone the unnecessity of too deep model for ‘easy’ input. Therefore in this work, we explore a dynamic use of Transformer layers. In detail, we propose a novel Transformer-the-Adaptive including an estimator module that enables the model to automatically learn and evaluate the complexity of every input samples, so that the model can adaptively use the most economic numbers of layers for inference. The proposed Transformer is implemented in the current state-of-the-art PrLM, ALBERT, giving a deeper, faster and adaptive model, ALBERTa. We train four-size optimized ALBERTa models including base, large, xlarge, and xxlarge and carry out experiments on three typical tasks MRC, NLU, and NER. Experiment results show that our proposed ALBERTa model optimized by Transformer-the-Adaptive has better performance and efficiency than the original ALBERT model, which fully reflects the effectiveness of Transformer-the-Adaptive.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.005 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".