← Search

Enneng Yang

25 accepted papers

2026

Causal Direct Preference Optimization for Distributionally Robust Generative Recommendation

ICML 2026poster

Direct Preference Optimization (DPO) guides large language models (LLMs) to generate recommendations aligned with user historical behavior distributions by minimizing preference alignment loss. However, our systematic empirical research and theoretical analysis reveal that DPO tends to amplify spuri…

Cited by 0SourceScholar
2026

ECHO: Entropy-Confidence Hybrid Optimization for Test-Time Reinforcement Learning

ICML 2026poster

Test-time reinforcement learning generates multiple candidate answers via repeated rollouts and performs online updates using pseudo-labels constructed by majority voting. To reduce overhead and improve exploration, prior work introduces tree-structured rollouts, which share reasoning prefixes and b…

Cited by 0SourceScholar
2026

Efficient Bilevel Optimization for CKA-Guided MoE Upcycling

ICML 2026poster

Upcycling, a strategy that initializes Mixture-of-Experts (MoE) by replicating pre-trained feed-forward or MoE networks to expand model capacity, has become a popular method in continual learning due to its effectiveness in mitigating catastrophic forgetting. However, existing paradigms rely on indi…

Cited by 0SourceScholar
2026

Interest-Shift-Aware Logical Reasoning for Efficient Long-Sequence Recommendation

AAAI 2026technical

Logical reasoning-based recommendation methods formulate logical expressions to characterize user-item interaction patterns, incorporating regularization constraints to ensure consistency with logical rules. However, these methods face two critical challenges: (1) As sequence length increases, they

Cited by 0SourcePDFScholar
2026

MergOPT: A Merge-Aware Optimizer for Robust Model Merging

ICLR 2026poster

Model merging aims to integrate multiple independently fine-tuned expert models into a single model while preserving the knowledge of all experts. However, existing approaches mainly address parameter conflicts at the merging stage and overlook the role of the fine-tuning process, which often leads…

Cited by 0SourceScholar
2026

Merge to Remember: Sharpness-Aware Isotropic Merging for Continual Learning

ICML 2026poster

Continual learning with large pre-trained models offers significant potential for cross-task knowledge accumulation, but faces critical challenges such as catastrophic forgetting and parameter interference, especially when historical data is unavailable. Existing approaches typically rely on sequent…

Cited by 0SourceScholar
2026

OptMerge: Unifying Multimodal LLM Capabilities and Modalities via Model Merging

ICLR 2026poster

Foundation models update slowly due to resource-intensive training, whereas domain-specific models evolve rapidly between releases. Model merging seeks to combine multiple expert models into a single, more capable model, reducing storage and serving costs while supporting decentralized development.…

Cited by 0SourceScholar
2026

Plasticity Activation via Polar Operator: A Plug-in Method for Balancing Stability and Plasticity

ICML 2026poster

Continual learning (CL) seeks models that acquire new knowledge while avoiding catastrophic forgetting. However, many methods that mitigate forgetting constrain parameter updates and thereby reduce model plasticity. We revisit the singular value spectrum of gradients in representative CL methods and…

Cited by 0SourceScholar
2026

SCNS: Continual Personalization of Diffusion Models via Submodular Concept Neuron Selection

ICML 2026poster

Custom diffusion models (CDMs) have demonstrated impressive success in visual personalization tasks by enabling the generation of user-specific concepts. However, existing CDMs typically assume that personalized concepts are static and rely on costly model merging or sequential updates that are pron…

Cited by 0SourceScholar
2025

Augmenting Sequential Recommendation with Balanced Relevance and Diversity

AAAI 2025technical

By generating new yet effective data, data augmentation has become a promising method to mitigate the data sparsity problem in sequential recommendation. Existing works focus on augmenting the original data but rarely explore the issue of imbalanced relevance and diversity for augmented data, leadin…

2025

Continual Model Merging without Data: Dual Projections for Balancing Stability and Plasticity

NeurIPS 2025poster

Model merging integrates multiple expert models with diverse capabilities into a unified framework, facilitating collaborative learning. However, most existing methods assume simultaneous access to all models, which is often impractical in real-world scenarios where models are received sequentially.…

Cited by 0SourceScholar
2025

EPT: Efficient Prompt Tuning by Multi-Space Projection and Prompt Fusion

AAAI 2025technical

Prompt tuning is a promising method to fine-tune a pre-trained language model without retraining its large-scale parameters. Instead, it attaches a soft prompt to the input text, whereby downstream tasks can be well adapted by merely learning the embeddings of prompt tokens. Nevertheless, existing m…

Cited by 0SourcePDFScholar
2025

Efficient and Effective Prompt Tuning via Prompt Decomposition and Compressed Outer Product

NAACL 2025long

Prompt tuning (PT) offers a cost-effective alternative to fine-tuning large-scale pre-trained language models (PLMs), requiring only a few parameters in soft prompt tokens added before the input text. However, existing PT approaches face two significant issues: i They overlook intrinsic semantic ass…

2025

Harnessing Content and Structure in ID for Multimodal Recommendation

ICASSP 2025accepted

Multimodal recommendation aims to model user and item representations comprehensively with the involvement of multimedia content for effective recommendations. Existing research has shown that it is beneficial for recommendation performance to combine (user- and item-) ID embeddings with multimodal…

Cited by 2SourceScholar
2025

Knowledge Decoupling via Orthogonal Projection for Lifelong Editing of Large Language Models

ACL 2025long

As large language models (LLMs) require continuous knowledge updates and the mitigation of hallucination issues in generated content, lifelong model editing has become a prominent research area. A mainstream knowledge editing method usually freezes LLM’s original parameters and adds extra trainable…

2025

Merging on the Fly Without Retraining: A Sequential Approach to Scalable Continual Model Merging

NeurIPS 2025poster

Deep model merging represents an emerging research direction that combines multiple fine-tuned models to harness their specialized capabilities across different tasks and domains. Current model merging techniques focus on merging all available models simultaneously, with weight interpolation-based m…

Cited by 0SourcecodeScholar
2025

Representation Surgery in Model Merging with Probabilistic Modeling

ICML 2025poster

Model merging aims to achieve multitask performance by merging multiple expert models without the need to access the raw training data. Recent research identified the \textit{representation bias} of model merging, characterized by a discrepancy in the representation distribution between the merged a…

Cited by 0SourcePDFScholar
2024

AdaMerging: Adaptive Model Merging for Multi-Task Learning

ICLR 2024poster

Multi-task learning (MTL) aims to empower a model to tackle multiple tasks simultaneously. A recent development known as task arithmetic has revealed that several models, each fine-tuned for distinct tasks, can be directly merged into a single model to execute MTL without necessitating a retraining…

2024

Representation Surgery for Multi-Task Model Merging

ICML 2024poster

Multi-task learning (MTL) compresses the information from multiple tasks into a unified backbone to improve computational efficiency and generalization. Recent work directly merges multiple independently trained models to perform MTL instead of collecting their raw data for joint training, greatly e…

2023

AdaTask: A Task-Aware Adaptive Learning Rate Approach to Multi-Task Learning

AAAI 2023technical

Multi-task learning (MTL) models have demonstrated impressive results in computer vision, natural language processing, and recommender systems. Even though many approaches have been proposed, how well these approaches balance different tasks on each parameter still remains unclear. In this paper, we…

Cited by 62SourcePDFScholar
2023

An Efficient Dataset Condensation Plugin and Its Application to Continual Learning

NeurIPS 2023poster

Dataset condensation (DC) distills a large real-world dataset into a small synthetic dataset, with the goal of training a network from scratch on the latter that performs similarly to the former. State-of-the-art (SOTA) DC methods have achieved satisfactory results through techniques such as accurac…

Cited by 30SourcePDFScholar
2023

Basket Representation Learning by Hypergraph Convolution on Repeated Items for Next-basket Recommendation

IJCAI 2023poster

Basket representation plays an important role in the task of next-basket recommendation. However, existing methods generally adopts pooling operations to learn a basket's representation, from which two critical issues can be identified. First, they treat a basket as a set of items independent and…

Cited by 11SourcePDFScholar
2023

Data Augmented Flatness-aware Gradient Projection for Continual Learning

ICCV 2023poster

The goal of continual learning (CL) is to continuously learn new tasks without forgetting previously learned old tasks. To alleviate catastrophic forgetting, gradient projection based CL methods require that the gradient updates of new tasks are orthogonal to the subspace spanned by old tasks. This…

Cited by 24PDFScholar
2023

Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation

AAAI 2023technical

Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we obser…