← Search

Ximei Wang

16 accepted papers

2025

From Feature Interaction to Feature Generation: A Generative Paradigm of CTR Prediction Models

ICML 2025poster

Click-Through Rate (CTR) prediction models estimate the probability of users clicking on items based on feature interactions, inherently following a discriminative paradigm. However, this paradigm is prone to embedding dimensional collapse and information redundancy due to limitations of vanilla fe…

2025

Long-Sequence Recommendation Models Need Decoupled Embeddings

ICLR 2025poster

Lifelong user behavior sequences are crucial for capturing user interests and predicting user responses in modern recommendation systems. A two-stage paradigm is typically adopted to handle these long sequences: a subset of relevant behaviors is first searched from the original long sequences via an…

2024

Decoupled Training: Return of Frustratingly Easy Multi-Domain Learning

AAAI 2024technical

Multi-domain learning (MDL) aims to train a model with minimal average risk across multiple overlapping but non-identical domains. To tackle the challenges of dataset bias and domain domination, numerous MDL approaches have been proposed from the perspectives of seeking commonalities by aligning dis…

Cited by 0SourcePDFScholar
2024

On the Embedding Collapse when Scaling up Recommendation Models

ICML 2024poster

Recent advances in foundation models have led to a promising trend of developing large recommendation models to leverage vast amounts of available data. Still, mainstream models remain embarrassingly small in size and naive enlarging does not lead to sufficient performance gain, suggesting a deficie…

2024

STEM: Unleashing the Power of Embeddings for Multi-Task Recommendation

AAAI 2024technical

Multi-task learning (MTL) has gained significant popularity in recommender systems as it enables simultaneous optimization of multiple objectives. A key challenge in MTL is negative transfer, but existing studies explored negative transfer on all samples, overlooking the inherent complexities within…

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

CLIPood: Generalizing CLIP to Out-of-Distributions

ICML 2023poster

Out-of-distribution (OOD) generalization, where the model needs to handle distribution shifts from training, is a major challenge of machine learning. Contrastive language-image pre-training (CLIP) models have shown impressive zero-shot ability, but the further adaptation of CLIP on downstream tasks…

2023

ForkMerge: Mitigating Negative Transfer in Auxiliary-Task Learning

NeurIPS 2023poster

Auxiliary-Task Learning (ATL) aims to improve the performance of the target task by leveraging the knowledge obtained from related tasks. Occasionally, learning multiple tasks simultaneously results in lower accuracy than learning only the target task, which is known as negative transfer. This probl…

2022

Debiased Self-Training for Semi-Supervised Learning

NeurIPS 2022accept

Deep neural networks achieve remarkable performances on a wide range of tasks with the aid of large-scale labeled datasets. Yet these datasets are time-consuming and labor-exhaustive to obtain on realistic tasks. To mitigate the requirement for labeled data, self-training is widely used in semi-supe…

2022

X-model: Improving Data Efficiency in Deep Learning with A Minimax Model

ICLR 2022poster

To mitigate the burden of data labeling, we aim at improving data efficiency for both classification and regression setups in deep learning. However, the current focus is on classification problems while rare attention has been paid to deep regression, which usually requires more human effort to lab…

Cited by 2SourcePDFScholar
2021

Regressive Domain Adaptation for Unsupervised Keypoint Detection

CVPR 2021poster

Domain adaptation (DA) aims at transferring knowledge from a labeled source domain to an unlabeled target domain. Though many DA theories and algorithms have been proposed, most of them are tailored into classification settings and may fail in regression tasks, especially in the practical keypoint d…

Cited by 81PDFcodeScholar
2020

Minimum Class Confusion for Versatile Domain Adaptation

ECCV 2020poster

Domain Adaptation (DA) transfers a learning model from a labeled source domain to an unlabeled target domain which follows different distributions. There are a variety of DA scenarios subject to label sets and domain configurations, including closed-set and partial-set DA, as well as multi-source an…

2020

Transferable Calibration with Lower Bias and Variance in Domain Adaptation

NeurIPS 2020poster

Domain Adaptation (DA) enables transferring a learning machine from a labeled source domain to an unlabeled target one. While remarkable advances have been made, most of the existing DA methods focus on improving the target accuracy at inference. How to estimate the predictive uncertainty of DA mode…

Cited by 65SourcePDFScholar
2019

Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation

ICML 2019oral

Deep unsupervised domain adaptation (Deep UDA) methods successfully leverage rich labeled data in a source domain to boost the performance on related but unlabeled data in a target domain. However, algorithm comparison is cumbersome in Deep UDA due to the absence of accurate and standardized model s…

2019

Transferable Normalization: Towards Improving Transferability of Deep Neural Networks

NeurIPS 2019poster

Deep neural networks (DNNs) excel at learning representations when trained on large-scale datasets. Pre-trained DNNs also show strong transferability when fine-tuned to other labeled datasets. However, such transferability becomes weak when the target dataset is fully unlabeled as in Unsupervised Do…