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.

Yuren Zhang

dblp:270/6517 · DBLP profile ↗
← Back
13ranked-venue papers
5as first author
10since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 8 · 2 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 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.

Databases, data mining, and information retrieval
6 papers
Recommender systems · 85% Knowledge graphs · 13% Data mining · 2%
Artificial intelligence
5 papers
Representation and self-supervised learning · 43% Trustworthy machine learning · 36% Vision and language · 18%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

Topics — the 20 heaviest of 21, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial attack
1.012026
Text-Guided Gradient Refinement: Resolving Multimodal Gradient Conflicts to Boost Adversarial Attacks on Vision-Language Models · AAAI 2026
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
1.012026
Text-Guided Gradient Refinement: Resolving Multimodal Gradient Conflicts to Boost Adversarial Attacks on Vision-Language Models · AAAI 2026
Computer vision › Vision and language
vision-language model
1.012026
Text-Guided Gradient Refinement: Resolving Multimodal Gradient Conflicts to Boost Adversarial Attacks on Vision-Language Models · AAAI 2026
Recommender systems
user modeling
0.922024
AdaptSSR: Pre-training User Model with Augmentation-Adaptive Self-Supervised Ranking · NeurIPS 2023
Pre-training General User Representation with Multi-type APP Behaviors · IJCAI 2024
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
Intent Oriented Contrastive Learning for Sequential Recommendation · AAAI 2025
Recommender systems
sequential recommendation
0.912025
Intent Oriented Contrastive Learning for Sequential Recommendation · AAAI 2025
Recommender systems › user modeling
user intent modeling
0.912025
Intent Oriented Contrastive Learning for Sequential Recommendation · AAAI 2025
Machine learning › Representation and self-supervised learning
pre-training
0.812024
Pre-training General User Representation with Multi-type APP Behaviors · IJCAI 2024
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
user representation learning
0.812024
Pre-training General User Representation with Multi-type APP Behaviors · IJCAI 2024
Computing education › educational assessment
computerized adaptive testing
0.812024
Computerized Adaptive Testing via Collaborative Ranking · NeurIPS 2024
Computing education
educational assessment
0.812024
Computerized Adaptive Testing via Collaborative Ranking · NeurIPS 2024
Recommender systems
collaborative filtering
0.812024
Computerized Adaptive Testing via Collaborative Ranking · NeurIPS 2024
Recommender systems › personalized ranking
collaborative ranking
0.812024
Computerized Adaptive Testing via Collaborative Ranking · NeurIPS 2024
Recommender systems
click-through rate prediction
0.612022
Clustering based Behavior Sampling with Long Sequential Data for CTR Prediction · SIGIR 2022
Recommender systems › sequential recommendation
user behavior sequence modeling
0.612022
Clustering based Behavior Sampling with Long Sequential Data for CTR Prediction · SIGIR 2022
Recommender systems
explainable recommendation
0.412020
Leveraging Demonstrations for Reinforcement Recommendation Reasoning over Knowledge Graphs · SIGIR 2020
Knowledge graphs
knowledge graph reasoning
0.412020
Leveraging Demonstrations for Reinforcement Recommendation Reasoning over Knowledge Graphs · SIGIR 2020
Knowledge graphs › knowledge graph reasoning
multi-hop reasoning
0.412020
Leveraging Demonstrations for Reinforcement Recommendation Reasoning over Knowledge Graphs · SIGIR 2020
Data mining › clustering › pattern-based clustering
item clustering
0.212022
Clustering based Behavior Sampling with Long Sequential Data for CTR Prediction · SIGIR 2022
Machine learning › Reinforcement learning
actor-critic methods
0.112020
Leveraging Demonstrations for Reinforcement Recommendation Reasoning over Knowledge Graphs · SIGIR 2020

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

contrastive learning · 3.1subsequence segmentation · 1.7theoretical guarantee · 1.5pre-training · 1.5multi-type behavior modeling · 1.5collaborative ranking · 1.5hard negative sampling · 1.3data augmentation · 1.3gradient refinement · 1.0self-supervised consistency pre-training · 0.6clustering · 0.6reinforcement learning · 0.4path demonstration · 0.4adversarial actor-critic · 0.4
YearPublicationVenuePosition
2026 Text-Guided Gradient Refinement: Resolving Multimodal Gradient Conflicts to Boost Adversarial Attacks on Vision-Language Models
Tianzuo Luo, Hengyuan Guo, Yuren Zhang
AAAI4
2026 Retina-enhanced multimodal deep learning for assessment of cardiovascular-kidney metabolic syndrome related outcomes
Keqing Dong, Yuren Zhang, Sichao Cheng, Yuqian Bao, Huating Li, Weiping Jia
Vis. Comput.4
2025 Intent Oriented Contrastive Learning for Sequential Recommendation
abstract
Sequential recommendation aims to predict the next item a user is likely to interact with based on their historical interaction sequence. Capturing user intent is crucial in this process, as each interaction is typically driven by specific intentions (e.g., buying skincare products for skin maintenance, buying makeup for cosmetic purposes, etc.). However, users often have multiple, dynamically changing intents, making it challenging for models to accurately learn these intents when relying on the entire historical sequence as input. To address this, we propose a novel framework called Intent Oriented Contrastive Learning for Sequential Recommendation (IOCLRec). This framework begins by segmenting users’ sequential behaviors into multiple subsequences, which represent the coarse-grained intents of users at different points in their interaction history. These subsequences form the basis for the three contrastive learning modules within IOCLRec. The fine-grained intent contrastive learning module uncovers detailed intent representations, while the single-intent and multi-intent contrastive learning modules utilize intent-oriented data augmentation operators to capture the diverse intents of users. These three modules work synergistically, driving comprehensive performance optimization in intricate sequential recommendation scenarios. Our method has been extensively evaluated on four public datasets, demonstrating superior effectiveness.
Wuhong Wang, Jianhui Ma 0001, Yuren Zhang, Kai Zhang 0038, Junzhe Jiang 0001, Yihui Yang, Yacong Zhou, Zheng Zhang 0048
AAAI3
2025 Diffusion-TS: A Hybrid Model for Human Skeleton Prediction
Yuren Zhang, Atsuya Watanabe, Zhongnan Pu, Lei Jing 0001
MoMM1
2025 Real-time Automotive Ethernet Intrusion Detection Using Sliding Window-Based Temporal Convolutional Residual Attention Networks
Yuren Zhang, Jiapeng Xiu
J. Inf. Secur. Appl.1
2024 Pre-training General User Representation with Multi-type APP Behaviors
Yuren Zhang, Min Hou 0004, Kai Zhang 0038, Yuqing Yuan, Zhihao Ye, Enhong Chen
IJCAI1
2024 Computerized Adaptive Testing via Collaborative Ranking
abstract
As the deep integration of machine learning and intelligent education, Computerized Adaptive Testing (CAT) has received more and more research attention. Compared to traditional paper-and-pencil tests, CAT can deliver both personalized and interactive assessments by automatically adjusting testing questions according to the performance of students during the test process. Therefore, CAT has been recognized as an efficient testing methodology capable of accurately estimating a student’s ability with a minimal number of questions, leading to its widespread adoption in mainstream selective exams such as the GMAT and GRE. However, just improving the accuracy of ability estimation is far from satisfactory in the real-world scenarios, since an accurate ranking of students is usually more important (e.g., in high-stakes exams). Considering the shortage of existing CAT solutions in student ranking, this paper emphasizes the importance of aligning test outcomes (student ranks) with the true underlying abilities of students. Along this line, different from the conventional independent testing paradigm among students, we propose a novel collaborative framework, Collaborative Computerized Adaptive Testing (CCAT), that leverages inter-student information to enhance student ranking. By using collaborative students as anchors to assist in ranking test-takers, CCAT can give both theoretical guarantees and experimental validation for ensuring ranking consistency.
Zirui Liu 0010, Yan Zhuang 0001, Qi Liu 0003, Jiatong Li 0002, Yuren Zhang, Zhenya Huang, Shijin Wang 0001
NeurIPS5
2023 AdaptSSR: Pre-training User Model with Augmentation-Adaptive Self-Supervised Ranking
abstract
User modeling, which aims to capture users' characteristics or interests, heavily relies on task-specific labeled data and suffers from the data sparsity issue. Several recent studies tackled this problem by pre-training the user model on massive user behavior sequences with a contrastive learning task. Generally, these methods assume different views of the same behavior sequence constructed via data augmentation are semantically consistent, i.e., reflecting similar characteristics or interests of the user, and thus maximizing their agreement in the feature space. However, due to the diverse interests and heavy noise in user behaviors, existing augmentation methods tend to lose certain characteristics of the user or introduce noisy behaviors. Thus, forcing the user model to directly maximize the similarity between the augmented views may result in a negative transfer. To this end, we propose to replace the contrastive learning task with a new pretext task: Augmentation-Adaptive SelfSupervised Ranking (AdaptSSR), which alleviates the requirement of semantic consistency between the augmented views while pre-training a discriminative user model. Specifically, we adopt a multiple pairwise ranking loss which trains the user model to capture the similarity orders between the implicitly augmented view, the explicitly augmented view, and views from other users. We further employ an in-batch hard negative sampling strategy to facilitate model training. Moreover, considering the distinct impacts of data augmentation on different behavior sequences, we design an augmentation-adaptive fusion mechanism to automatically adjust the similarity order constraint applied to each sample based on the estimated similarity between the augmented views. Extensive experiments on both public and industrial datasets with six downstream tasks verify the effectiveness of AdaptSSR.
Qi Liu 0003, Kai Zhang 0038, Yuren Zhang, Min Hou 0004, Yuqing Yuan, Zhihao Ye, Zaixi Zhang, Sanshi Lei Yu
NeurIPS4
2022 CPEE: Civil Case Judgment Prediction centering on the Trial Mode of Essential Elements
abstract
Civil Case Judgment Prediction (CCJP) is a fundamental task in the legal intelligence of the civil law system, which aims to automatically predict the judgment results on each plea of the plaintiff. Existing studies mainly focus on making judgment predictions only on a certain civil cause (e.g., the divorce dispute) by utilizing the fact descriptions and pleas of the plaintiff, which still suffer from the various causes and complicated legal essential elements in the real court. Thus, in this paper, we formalize CCJP as a multi-task learning problem and propose a CCJP method centering on the trial mode of essential elements, CPEE, which explores the practical judicial process and analyzes comprehensive legal essential elements to make judgment predictions. Specifically, we first construct three tasks (i.e., the predictions on the civil causes, law articles, and the final judgment on each plea) necessary for CCJP, that follow the judgment process and exploit the results of intermediate subtasks to make judgment predictions. Then we design a logic-enhanced network to predict the results of three tasks and conduct a comprehensive study of civil cases. Finally, owing to the interlinked and dependent relationships among each task, we adopt the cause prediction result to help predict law articles and incorporate them into final judgment prediction through a gate mechanism. Furthermore, since the existing dataset fails to provide sufficient case information, we construct a real-world CCJP dataset that contains various causes and comprehensive legal elements. Extensive experimental results on the dataset validate the effectiveness of our method.
Lili Zhao 0002, Linan Yue, Yanqing An, Yuren Zhang, Jun Yu 0011, Qi Liu 0003, Enhong Chen
CIKM4
2022 Clustering based Behavior Sampling with Long Sequential Data for CTR Prediction
abstract
Click-through rate (CTR) prediction is fundamental in many industrial applications, such as online advertising and recommender systems. With the development of the online platforms, the sequential user behaviors grow rapidly, bringing us great opportunity to better understand user preferences.However, it is extremely challenging for existing sequential models to effectively utilize the entire behavior history of each user. First, there is a lot of noise in such long histories, which can seriously hurt the prediction performance. Second, feeding the long behavior sequence directly results in infeasible inference time and storage cost. In order to tackle these challenges, in this paper we propose a novel framework, which we name as User Behavior Clustering Sampling (UBCS). In UBCS, short sub-sequences will be obtained from the whole user history sequence with two cascaded modules: (i) Behavior Sampling module samples short sequences related to candidate items using a novel sampling method which takes relevance and temporal information into consideration; (ii) Item Clustering module clusters items into a small number of cluster centroids, mitigating the impact of noise and improving efficiency. Then, the sampled short sub-sequences will be fed into the CTR prediction module for efficient prediction. Moreover, we conduct a self-supervised consistency pre-training task to extract user persona preference and optimize the sampling module effectively. Experiments on real-world datasets demonstrate the superiority and efficiency of our proposed framework.
Yuren Zhang, Enhong Chen, Binbin Jin, Hao Wang 0076, Min Hou 0004, Wei Huang 0002, Runlong Yu
SIGIR1
2020 Activity and Relationship Modeling Driven Weakly Supervised Object Detection
abstract
This paper presents a weakly supervised object detection method based on activity label and relationship modeling, which is motivated by the assumption that configuration of human and object are similar in same activity, and joint modeling of human, active object and activity could leverage the recognition of them. Compared to most weakly supervised method taking object as independent instance, firstly, active human and object proposals are learned and filtered based on class activation map of multi-label classification. Secondly, a spatial relationship prior including relative position, scale, overlaps etc are learned dependent on action. Finally, a multi-stream object detection framework integrating the spatial prior and pairwise ROI pooling are proposed to jointly learn the object and action class. Experiments are conducted on HICO-DET dataset, and our approach outperforms the state of the art weakly supervised object detection methods.
Yinlin Li, Xu Yang 0004, Yuren Zhang
ICPR4
2020 Leveraging Demonstrations for Reinforcement Recommendation Reasoning over Knowledge Graphs
abstract
Knowledge graphs have been widely adopted to improve recommendation accuracy. The multi-hop user-item connections on knowledge graphs also endow reasoning about why an item is recommended. However, reasoning on paths is a complex combinatorial optimization problem. Traditional recommendation methods usually adopt brute-force methods to find feasible paths, which results in issues related to convergence and explainability. In this paper, we address these issues by better supervising the path finding process. The key idea is to extract imperfect path demonstrations with minimum labeling efforts and effectively leverage these demonstrations to guide path finding. In particular, we design a demonstration-based knowledge graph reasoning framework for explainable recommendation. We also propose an ADversarial Actor-Critic (ADAC) model for the demonstration-guided path finding. Experiments on three real-world benchmarks show that our method converges more quickly than the state-of-the-art baseline and achieves better recommendation accuracy and explainability.
Kangzhi Zhao, Xiting Wang, Yuren Zhang, Li Zhao 0007, Zheng Liu 0011, Chunxiao Xing, Xing Xie 0001
SIGIR3
2016 Introducing locally affine-invariance constraints into lunar surface image correspondence
Yuren Zhang, Xu Yang 0004, Hong Qiao, Zhiyong Liu 0001, Chuankai Liu
Neurocomputing1