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

Dinggen Zhang

dblp:320/0625 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper
Language models and text generation · 30% Transfer learning and domain adaptation · 30% Optimization for machine learning · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › optimization
iterative optimization
1.012026
Escaping Optimization Stagnation: Taking Steps Beyond Task Arithmetic via Difference Vectors · AAAI 2026
Natural language and speech › Language models and text generation
knowledge editing
1.012026
Escaping Optimization Stagnation: Taking Steps Beyond Task Arithmetic via Difference Vectors · AAAI 2026
Machine learning › Transfer learning and domain adaptation › parameter-based transfer learning
task arithmetic
1.012026
Escaping Optimization Stagnation: Taking Steps Beyond Task Arithmetic via Difference Vectors · AAAI 2026
Machine learning › Efficient and distributed learning
model merging
0.312026
Escaping Optimization Stagnation: Taking Steps Beyond Task Arithmetic via Difference Vectors · AAAI 2026

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

task vectors · 1.0difference vectors · 1.0anisotropic scaling · 1.0
YearPublicationVenuePosition
2026 Escaping Optimization Stagnation: Taking Steps Beyond Task Arithmetic via Difference Vectors
abstract
Current methods for editing pre-trained models face significant challenges, primarily high computational costs and limited scalability. Task arithmetic has recently emerged as a promising solution, using simple arithmetic operations—addition and negation—based on task vectors which are the differences between fine-tuned and pre-trained model weights, to efficiently modify model behavior. However, the full potential of task arithmetic remains underexplored, primarily due to limited mechanisms for overcoming optimization stagnation. To address this challenge, we introduce the notion of difference vector, a generalized form of task vectors derived from the historical movements during optimization. Using difference vectors as directed perturbations, we proposed the Difference Vector-based Anisotropic Scaling Iterative algorithm (DV-BASI) to enable a continuous optimization process for task arithmetic methods without relying on any additional modules or components. Notably, by leveraging escapability and directional advantages of difference vectors, the average performance on different tasks of the multi-task model merged by DV-BASI may even outperform models individually fine-tuned. Based on this observation, we extend the application of difference vectors to a feasible fine-tuning method for single-task models. On the practical side, DV-BASI allows expressive searching directions with few learnable parameters and forms a scalable framework. We also integrate DV-BASI with task arithmetic methods and advanced optimization techniques to achieve state-of-the-art performance on both supervised and unsupervised evaluation protocols.
Dinggen Zhang, Zhiwu Xie
AAAI3