Demo Data from VLDB 2026 / reviewers in the wild / expert
Jiajun Wen 0005
dblp:422/3477
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0004-6058-2521ORCID · reported
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 |
Efficient and distributed learning · 50% Learning paradigms · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model merging |
1.0 | 1 | 2026 | From Parameter to Representation: A Closed-Form Approach for Controllable Model Merging · AAAI 2026 |
Machine learning › Learning paradigms › multi-task learning
parameter interference |
1.0 | 1 | 2026 | From Parameter to Representation: A Closed-Form Approach for Controllable Model Merging · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
pareto front · 1.0multi-objective optimization · 1.0closed-form solution · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | From Parameter to Representation: A Closed-Form Approach for Controllable Model MergingabstractModel merging combines expert models for multitask performance but faces challenges from parameter interference. This has sparked recent interest in controllable model merging, giving users the ability to explicitly balance performance trade-offs. Existing approaches employ a compile-then-query paradigm, performing a costly offline multi-objective optimization to enable fast, preference-aware model generation. This offline stage typically involves iterative search or dedicated training, with complexity that grows exponentially with the number of tasks. To overcome these limitations, we shift the perspective from parameter-space optimization to a direct correction of the model's final representation. Our approach models this correction as an optimal linear transformation, yielding a closed-form solution that replaces the entire offline optimization process with a single-step, architecture-agnostic computation. This solution directly incorporates user preferences, allowing a Pareto-optimal model to be generated on-the-fly with complexity that scales linearly with the number of tasks. Experimental results show our method generates a superior Pareto front with more precise preference alignment and drastically reduced computational cost. Jian Yang 0028, Handing Wang, Jiajun Wen 0005 |
AAAI | 4 |