Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Howe Tissue

dblp:385/8970 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Language models and text generation · 32% Deep learning architectures and training · 32% Representation and self-supervised learning · 32%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
scaling laws
1.722025
Scaling Law with Learning Rate Annealing · NeurIPS 2025
Learning Dynamics in Continual Pre-Training for Large Language Models · ICML 2025
Natural language and speech › Language models and text generation › large language model training
continual pre-training
0.912025
Learning Dynamics in Continual Pre-Training for Large Language Models · ICML 2025
Machine learning › Representation and self-supervised learning › pre-training
data mixture optimization
0.912025
Domain2Vec: Vectorizing Datasets to Find the Optimal Data Mixture without Training · ICML 2025
Machine learning › Representation and self-supervised learning
dataset representation
0.912025
Domain2Vec: Vectorizing Datasets to Find the Optimal Data Mixture without Training · ICML 2025
Natural language and speech › Language models and text generation
large language model training
0.912025
Learning Dynamics in Continual Pre-Training for Large Language Models · ICML 2025
Natural language and speech › Language models and text generation › large language model training
large language model training dynamics
0.912025
Scaling Law with Learning Rate Annealing · NeurIPS 2025
Machine learning › Deep learning architectures and training › training dynamics
loss curve prediction
0.912025
Scaling Law with Learning Rate Annealing · NeurIPS 2025
Machine learning › Representation and self-supervised learning
pre-training
0.912025
Domain2Vec: Vectorizing Datasets to Find the Optimal Data Mixture without Training · ICML 2025
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.312025
Learning Dynamics in Continual Pre-Training for Large Language Models · ICML 2025

Methods — techniques the papers use, named apart from their topics

scaling law fitting · 0.9loss curve decoupling · 0.9learning rate annealing analysis · 0.9distribution alignment · 0.9dataset vectorization · 0.9
YearPublicationVenuePosition
2025 Learning Dynamics in Continual Pre-Training for Large Language Models
abstract
Continual Pre-Training (CPT) has become a popular and effective method to apply strong foundation models to specific downstream tasks. In this work, we explore the learning dynamics throughout the CPT process for large language models (LLMs). We specifically focus on how general and downstream domain performance evolves at each training step, with domain performance measured via validation losses. We have observed that the CPT loss curve fundamentally characterizes the transition from one curve to another hidden curve, and could be described by decoupling the effects of distribution shift and learning rate (LR) annealing. We derive a CPT scaling law that combines the two factors, enabling the prediction of loss at any (continual) training steps and across learning rate schedules (LRS) in CPT. Our formulation presents a comprehensive understanding of several critical factors in CPT, including the learning rate, the training steps, and the distribution distance between PT and CPT datasets. Moreover, our approach can be adapted to customize training hyper-parameters to different CPT goals such as balancing general and domain-specific performance. Extensive experiments demonstrate that our scaling law holds across various CPT datasets and training hyper-parameters.
Xingjin Wang, Howe Tissue, Linjing Li, Daniel Dajun Zeng
ICML2
2025 Domain2Vec: Vectorizing Datasets to Find the Optimal Data Mixture without Training
abstract
We introduce *Domain2Vec*, a novel approach that decomposes any dataset into a linear combination of several *meta-domains*, a new concept designed to capture the key underlying features of datasets. *Domain2Vec* maintains a vocabulary of meta-domains and uses a classifier to decompose any given dataset into a domain vector that corresponds to a distribution over this vocabulary. These domain vectors enable the identification of optimal data mixture for language model (LM) pretraining in a training-free manner under the ***D**istribution **A**lignment **A**ssumption* (DA$^{2}$), which suggests that when the data distribution of the training set and the validation set is more aligned, a lower validation loss is achieved. Moreover, *Domain2Vec* can be seamlessly integrated into previous works to model the relationship between domain vectors and LM performance, greatly enhancing the efficiency and scalability of previous methods. Extensive experiments demonstrate that *Domain2Vec* helps find the data mixture that enhances downstream task performance with minimal computational overhead. Specifically, *Domain2Vec* achieves the same validation loss on Pile-CC using only $51.5$\% of the compute required when training on the original mixture of The Pile Dataset. Under equivalent compute budget, *Domain2Vec* improves downstream performance by an average of $2.83$\%.
Mozhi Zhang, Howe Tissue, Xipeng Qiu
ICML2
2025 Scaling Law with Learning Rate Annealing
abstract
We find that the cross-entropy loss curves of neural language models empirically adhere to a scaling law with learning rate (LR) annealing over training steps: $$L(s) = L_0 + A\cdot S_1^{-\alpha} - C\cdot S_2,$$ where $L(s)$ is the validation loss at step $s$, $S_1$ is the area under the LR curve, $S_2$ is the LR annealing area, and $L_0$, $A$, $C$, $\alpha$ are constant parameters. This formulation accounts for two main effects: (1) power-law scaling over data size, and (2) the additional loss reduction during LR annealing. Unlike previous studies that only fit losses at final steps, our formulation captures the entire training curve, allowing for parameter fitting using losses from any training step. Applying the scaling law with LR annealing and fitting only one or two training curves, we can accurately predict the loss at any given step under any learning rate scheduler (LRS). This approach significantly reduces computational cost in formulating scaling laws while providing more accuracy and expressiveness. Extensive experiments demonstrate that our findings hold across a range of hyper-parameters and model architectures and can extend to scaling effect of model sizes. Moreover, our formulation provides accurate theoretical insights into empirical results observed in numerous previous studies, particularly those focusing on LR schedule and annealing. We believe that this work is promising to enhance the understanding of LLM training dynamics while democratizing scaling laws, and it is helpful to guide both research and industrial participants in refining training strategies for further LLMs.
Howe Tissue, Venus Wang
NeurIPS1