Tianxin Wei

Tianxin Wei

Auto-generated profile, based on publicly available information

Tianxin Wei

University of Illinois Urbana Champaign, Champaign, IL, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 May 2024
Verified
Conference Paper
Open access
HZHansi Zeng
Hansi Zeng
CLChen Luo
Chen Luo
BJBowen Jin
Bowen Jin
SSSheikh Muhammad Sarwar
Sheikh Muhammad Sarwar
TWTianxin Wei
Tianxin Wei
HZHamed Zamani
Hamed Zamani
Recent research has shown that transformer networks can be used as differentiable search indexes by representing each document as a sequence of document ID tokens. These generative retrieval models cast the retrieval problem to a document ID generation problem for each query. Despite their elegant design, existing generative retrieval models only perform well on artificially-constructed and small-scale collections. This paper represents an important milestone in generative retrieval research by showing that generative retrieval models can be trained to perform effectively on large-scale standard retrieval benchmarks. In more detail, we propose RIPOR- an optimization framework for generative retrieval that is designed based on two often-overlooked fundamental design considerations. First, RIPOR introduces a novel prefix-oriented ranking optimization algorithm for accurate estimation of relevance score during sequential document ID generation. Second, RIPOR constructs document IDs based on the relevance associations between queries and documents. Evaluation on MSMARCO and TREC Deep Learning Track reveals that RIPOR surpasses state-of-the-art generative retrieval models by a large margin (e.g., 30.5% MRR improvements on MS MARCO Dev Set).

20 July 2025
Verified
Conference Paper
Open access
MAMengting Ai
Mengting Ai
TWTianxin Wei
Tianxin Wei
YCYifan Chen
Yifan Chen
ZZZhichen Zeng
Zhichen Zeng
RZRitchie Zhao
Ritchie Zhao
JHJingrui He
Jingrui He

21 October 2023
Verified
Conference Paper
Open access
XHXinrui He
Xinrui He
TWTianxin Wei
Tianxin Wei
JHJingrui He
Jingrui He
The growth of e-commerce has seen a surge in popularity of platforms like Amazon, eBay, and Taobao. This has given rise to a unique shopping behavior involving baskets - sets of items purchased together. As a less studied interaction mode in the community, the question of how should shopping basket complement personalized recommendation systems remains under-explored. While previous attempts focused on jointly modeling user purchases and baskets, the distinct semantic nature of these elements can introduce noise when directly integrated. This noise negatively impacts the model's performance, further exacerbated by significant noise (e.g., a user is misled to click an item or recognizes it as uninteresting after consuming it) within both user and basket behaviors. In order to cope with the above difficulties, we propose a novel Basket recommendation framework via Noise-tolerated Contrastive Learning, named BNCL, to handle the noise existing in the cross-behavior integration and within-behavior modeling. First, we represent the basket-item interactions as the hypergraph to model the complex basket behavior, where all items appearing in the same basket are treated as a single hyperedge. Second, cross-behavior contrastive learning is designed to suppress the noise during the fusion of diverse behaviors. Next, to further inhibit the within-behavior noise of the user and basket interactions, we propose to exploit invariant properties of the recommenders w.r.t augmentations through within-behavior contrastive learning. A novel consistency-aware augmentation approach is further designed to better identify the noisy interactions with the consideration of the above two types of interactions. Our framework BNCL offers a generic training paradigm that is applicable to different backbones. Extensive experiments on three shopping transaction datasets verify the effectiveness of our proposed method.

10 November 2025
Verified
Conference Paper
Open access
LZLecheng Zheng
Lecheng Zheng
BJBaoyu Jing
Baoyu Jing
ZLZihao Li
Zihao Li
ZZZhichen Zeng
Zhichen Zeng
TWTianxin Wei
Tianxin Wei
JHJingrui He
Jingrui He

24 August 2024
Verified
Conference Paper
Open access
YBYikun Ban
Yikun Ban
YQYunzhe Qi
Yunzhe Qi
TWTianxin Wei
Tianxin Wei
LLLihui Liu
Lihui Liu
JHJingrui He
Jingrui He
The contextual bandit has been identified as a powerful framework to formulate the recommendation process as a sequential decision-making process, where each item is regarded as an arm and the objective is to minimize the regret of T rounds. In this paper, we study a new problem, Clustering of Neural Bandits, by extending previous work to the arbitrary reward function, to strike a balance between user heterogeneity and user correlations in the recommender system. To solve this problem, we propose a novel algorithm called M-CNB, which utilizes a meta-learner to represent and rapidly adapt to dynamic clusters, along with an informative Upper Confidence Bound (UCB)-based exploration strategy. We provide an instance-dependent performance guarantee for the proposed algorithm that withstands the adversarial context, and we further prove the guarantee is at least as good as state-of-the-art (SOTA) approaches under the same assumptions. In extensive experiments conducted in both recommendation and online classification scenarios, M-CNB outperforms SOTA baselines. This shows the effectiveness of the proposed approach in improving online recommendation and online classification performance.

20 July 2025
Verified
Conference Paper
Open access
TWTianxin Wei
Tianxin Wei
YCYifan Chen
Yifan Chen
XHXinrui He
Xinrui He
WBWenxuan Bao
Wenxuan Bao
JHJingrui He
Jingrui He