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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yupeng Gao

dblp:168/6305 · DBLP profile ↗
← Back
15ranked-venue papers
2as first author
8since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 11 · 2 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Computer networks · 1Theory of computation · 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.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 69% Information retrieval · 31%
Artificial intelligence
5 papers
Trustworthy machine learning · 37% Question answering and dialogue systems · 27% Reinforcement learning · 12%
Computer graphics and multimedia
1 paper
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
debiased recommendation
1.012026
Bridging Semantic Understanding and Popularity Bias with LLMs · WWW 2026
Recommender systems
fairness-aware recommendation
1.012026
Bridging Semantic Understanding and Popularity Bias with LLMs · WWW 2026
Recommender systems › collaborative filtering
popularity bias
1.012026
Bridging Semantic Understanding and Popularity Bias with LLMs · WWW 2026
Rendering › gaussian splatting
3d gaussian splatting
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Rendering
inverse rendering
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Rendering
novel view synthesis
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Rendering
relighting
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Machine learning › Trustworthy machine learning
robustness
0.722018
Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach · ICLR (Poster) 2018
Is Robustness the Cost of Accuracy? - A Comprehensive Study on the Robustness of 18 Deep Image Classification Models · ECCV (12) 2018
Information retrieval › image retrieval › product image retrieval
fashion retrieval
0.512021
Fashion IQ: A New Dataset Towards Retrieving Images by Natural Language Feedback · CVPR 2021
Information retrieval
image retrieval
0.512021
Fashion IQ: A New Dataset Towards Retrieving Images by Natural Language Feedback · CVPR 2021
Information retrieval › image retrieval › user-centric image retrieval
interactive image retrieval
0.512021
Fashion IQ: A New Dataset Towards Retrieving Images by Natural Language Feedback · CVPR 2021
Natural language and speech › Question answering and dialogue systems
machine reading comprehension
0.412020
Interactive Fiction Game Playing as Multi-Paragraph Reading Comprehension with Reinforcement Learning · EMNLP (1) 2020
Natural language and speech › Question answering and dialogue systems › machine reading comprehension
multi-hop reading comprehension
0.412020
Interactive Fiction Game Playing as Multi-Paragraph Reading Comprehension with Reinforcement Learning · EMNLP (1) 2020
Machine learning › Reinforcement learning › reinforcement learning environment
text-based games
0.412020
Interactive Fiction Game Playing as Multi-Paragraph Reading Comprehension with Reinforcement Learning · EMNLP (1) 2020
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.312018
Is Robustness the Cost of Accuracy? - A Comprehensive Study on the Robustness of 18 Deep Image Classification Models · ECCV (12) 2018
Machine learning › Trustworthy machine learning › robustness › model robustness evaluation
adversarial robustness evaluation
0.312018
Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach · ICLR (Poster) 2018
Recommender systems
large language model-based recommendation
0.312026
Bridging Semantic Understanding and Popularity Bias with LLMs · WWW 2026
Natural language and speech › Question answering and dialogue systems
multi-party dialogue
0.112019
Context-Aware Conversation Thread Detection in Multi-Party Chat · EMNLP/IJCNLP (1) 2019
Machine learning › Probabilistic and Bayesian machine learning
extreme value theory
0.112018
Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach · ICLR (Poster) 2018
Computer vision › Image recognition and object detection
image classification
0.112018
Is Robustness the Cost of Accuracy? - A Comprehensive Study on the Robustness of 18 Deep Image Classification Models · ECCV (12) 2018

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

user simulator · 1.0transformer · 1.0large language model · 1.0instruction-based prompting · 1.0BRDF parameter separation · 0.93d gaussian splatting · 0.9structured prediction · 0.4object-centric historical observation retrieval · 0.4context-query attention · 0.4neural network · 0.4context-aware modeling · 0.4extreme value theory · 0.3
YearPublicationVenuePosition
2026 Bridging Semantic Understanding and Popularity Bias with LLMs
abstract
Semantic understanding of popularity bias is a crucial yet underexplored challenge in recommender systems, where popular items are often favored at the expense of niche content. Most existing debiasing methods treat the semantic understanding of popularity bias as a matter of diversity enhancement or long-tail coverage, neglecting the deeper semantic layer that embodies the causal origins of the bias itself. Consequently, such shallow interpretations limit both their debiasing effectiveness and recommendation accuracy. In this paper, we propose FairLRM, a novel framework that bridges the gap in the semantic understanding of popularity bias with Recommendation via Large Language Model (RecLLM). FairLRM decomposes popularity bias into item-side and user-side components, using structured instruction-based prompts to enhance the model's comprehension of both global item distributions and individual user preferences. Unlike traditional methods that rely on surface-level features such as ''diversity'' or ''debiasing'', FairLRM improves the model's ability to semantically interpret and address the underlying bias. Through empirical evaluation, we demonstrate that FairLRM enhances fairness and recommendation accuracy through a trustworthy, semantically grounded treatment of popularity bias. The source code is shown in https://github.com/LuoRenqiang/FairLRM.
Renqiang Luo, Yupeng Gao, Mingliang Hou, Jiaying Liu 0006, Shuo Yu 0001
WWW3
2025 SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering
abstract
Reconstructing 3D assets from images, known as inverse rendering (IR), remains a challenging task due to its ill-posed nature. 3D Gaussian Splatting (3DGS) has demonstrated impressive capabilities for novel view synthesis (NVS) tasks. Methods apply it to relighting by separating radiance into BRDF parameters and lighting, yet produce inferior relighting quality with artifacts and unnatural indirect illumination due to the limited capability of each Gaussian, which has constant material parameters and normal, alongside the absence of physical constraints for indirect lighting. In this paper, we present a novel framework called Spatially-vayring Gaussian Inverse Rendering (SVG-IR), aimed at enhancing both NVS and relighting quality. To this end, we propose a new representation—Spatially-varying Gaussian (SVG)—that allows per-Gaussian spatially varying parameters. This enhanced representation is complemented by a SVG splatting scheme akin to vertex/fragment shading in traditional graphics pipelines. Furthermore, we integrate a physically-based indirect lighting model, enabling more realistic relighting. The proposed SVG-IR framework significantly improves rendering quality, outperforming state-of-the-art NeRF-based methods by 2.5 dB in peak signal-to-noise ratio (PSNR) and surpassing existing Gaussian-based techniques by 3.5 dB in relighting tasks, all while maintaining a real-time rendering speed. The source code is available at https://github.com/learner-shx/SVG-IR.
Hanxiao Sun, Yupeng Gao, Jin Xie 0001, Jian Yang 0003, Beibei Wang 0002
CVPR2
2025 Event-triggered computation-reducing fuzzy intelligence control incorporating fixed-time predefined behaviors in discrete-time
Xiangwei Bu, Ruining Luo, Yupeng Gao
Fuzzy Sets Syst.3
2024 Efficient Partitioning Algorithms for Optimizing Big Graph Computation
Baoling Ning, Yupeng Gao
COCOON (2)2
2024 ICPR 2024 Competition on Resource-Limited Infrared Small Target Detection Challenge: Methods and Results
Boyang Li 0007, Xinyi Ying, Ruojing Li, Yongxian Liu, Yangsi Shi, Xin Zhang 0170, Mingyuan Hu, Yukai Zhang, Dongli Tang, Qiang Ling 0002, Zaiping Lin, Weidong Sheng, Chenxu Peng, Huoren Yang, Lingjie Liu, Zelin Shi, Yunpeng Liu 0001, Chuang Yu 0003, Jinmiao Zhao, Heng Xiang, Tianyu Li 0005, Minghang Zhou, Chenxi Lan, Dongyu Xi, Chaofan Qiao, Yupeng Gao, Yongxu Liu 0006, Deping Chen, Xiaopeng Song, Jiuping Yang, Zhaobing Qiu, Rixiang Ni, Changhai Luo, Shuyuan Zheng, Baojin Huang, Xiaoqi Zhou, Qingshan Guo, Dangxuan Wu, Haodong Zeng, Qiang Fu 0017, Yimian Dai, Renke Kou, Jian Song 0007, Changfeng Feng, Zihao Xiong, Mengxuan Xiao, Yingxu Liu, Quanyi Zhao
ICPR (34)39
2024 Semantic segmentation of remote sensing images based on multiscale features and global information modeling
Yupeng Gao, Xiaoling Luo 0002, Weihong Yan, Xueliang Fu
Expert Syst. Appl.1
2022 Mechanical equipment health management method based on improved intuitionistic fuzzy entropy and case reasoning technology
Yupeng Gao, Ruixin Bao, Zhen Pan, Guiyang Ma, Xiuquan Cai, Qiqiang Peng
Eng. Appl. Artif. Intell.1
2021 Fashion IQ: A New Dataset Towards Retrieving Images by Natural Language Feedback
abstract
Conversational interfaces for the detail-oriented retail fashion domain are more natural, expressive, and user friendly than classical keyword-based search interfaces. In this paper, we introduce the Fashion IQ dataset to support and advance research on interactive fashion image retrieval. Fashion IQ is the first fashion dataset to provide human-generated captions that distinguish similar pairs of garment images together with side-information consisting of real-world product descriptions and derived visual attribute labels for these images. We provide a detailed analysis of the characteristics of the Fashion IQ data, and present a transformer-based user simulator and interactive image retriever that can seamlessly integrate visual attributes with image features, user feedback, and dialog history, leading to improved performance over the state of the art in dialog-based image retrieval. We believe that our dataset will encourage further work on developing more natural and real-world applicable conversational shopping assistants.1
Hui Wu 0009, Yupeng Gao, Ziad Al-Halah, Steven Rennie, Kristen Grauman, Rogério Feris
CVPR2
2020 Interactive Fiction Game Playing as Multi-Paragraph Reading Comprehension with Reinforcement Learning
abstract
Interactive Fiction (IF) games with real humanwritten natural language texts provide a new natural evaluation for language understanding techniques.In contrast to previous text games with mostly synthetic texts, IF games pose language understanding challenges on the humanwritten textual descriptions of diverse and sophisticated game worlds and language generation challenges on the action command generation from less restricted combinatorial space.We take a novel perspective of IF game solving and re-formulate it as Multi-Passage Reading Comprehension (MPRC) tasks.Our approaches utilize the context-query attention mechanisms and the structured prediction in MPRC to efficiently generate and evaluate action outputs and apply an object-centric historical observation retrieval strategy to mitigate the partial observability of the textual observations.Extensive experiments on the recent IF benchmark (Jericho) demonstrate clear advantages of our approaches achieving high winning rates and low data requirements compared to all previous approaches. 1
Mo Yu, Yupeng Gao, Chuang Gan 0001, Murray Campbell, Shiyu Chang
EMNLP (1)3
2019 Context-Aware Conversation Thread Detection in Multi-Party Chat
abstract
Ming Tan, Dakuo Wang, Yupeng Gao, Haoyu Wang, Saloni Potdar, Xiaoxiao Guo, Shiyu Chang, Mo Yu. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.
Dakuo Wang, Yupeng Gao, Haoyu Wang 0002, Saloni Potdar, Shiyu Chang, Mo Yu
EMNLP/IJCNLP (1)3
2018 Is Robustness the Cost of Accuracy? - A Comprehensive Study on the Robustness of 18 Deep Image Classification Models
Dong Su, Huan Zhang 0001, Hongge Chen, Jinfeng Yi, Yupeng Gao
ECCV (12)6
2018 Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach
Tsui-Wei Weng, Huan Zhang 0001, Jinfeng Yi, Dong Su, Yupeng Gao, Cho-Jui Hsieh, Luca Daniel
ICLR (Poster)6
2016 Sampling-based distributed Kernel mean matching using spark
abstract
Limited access to supervised information may forge scenarios in real-world data mining applications, where training and test data are interconnected by a covariate shift, i.e., having equal class conditional distribution with unequal covariate distribution. Traditional data mining techniques assume that both training and test data represent an identical distribution, therefore suffer in presence of a covariate shift. Kernel Mean Matching (KMM) is a well known approach that addresses covariate shift by weighing training instances appropriately. However, it has time complexity cubic in the size of training data, which is computationally impractical for large or streaming datasets due to limited scalability. In this paper, we present a sampling-based algorithm to address the limited scalability problem of KMM. Moreover, we show that the approach is highly parallelizable, and therefore propose a distributed algorithm for estimating training instance weights efficiently using Spark. Experiment results on benchmark datasets show that the proposed approach achieves competitive estimation accuracy within much lower execution time compared to the KMM algorithm. Moreover, it indicates that larger size of training data results into a higher accuracy with minimal effect on execution time of the proposed approach.
Ahsanul Haque, Zhuoyi Wang, Swarup Chandra, Yupeng Gao, Latifur Khan, Charu C. Aggarwal
IEEE BigData4
2016 Exploiting SDN Principles for Extremely Fast Restoration in Elastic Optical Datacenter Networks
abstract
In order to find out the tradeoff between recovery time and resource overhead when a link failure occurs, we propose a software-defined based fast restoration scheme for elastic optical datacenter networks, called precomputation based restoration path (P-RP). By extending the controller functionality and OpenFlow protocol in software defined networking (SDN) technology, we establish a novel elastic optical inter-datacenter network architecture which can quickly and accurately converge the network state information with a global view for failure recovery. Based on this architecture, the P-RP performs path computation and bandwidth resource selection for restoration before a failure occurs. The experimental results demonstrate that the proposed scheme can achieve fast recovery with low blocking probability while maintaining high spectrum efficiency. Compared with existing restoration schemes, average recovery time is improved by up to 28%.
Xiancun Dong, Yupeng Gao, George N. Rouskas
GLOBECOM4
2014 Crowdsourcing based radio map anomalous event detection system for calibration-on-demand
abstract
Calibrations for Wi-Fi Indoor Positioning Systems (IPS) are expensive and time-consuming. Recalibrations are necessary periodically to compensate the drifts of radio map. Many crowdsourcing-based approaches have been proposed to calibrate the radio map strategically with user-contributed data. However, these approaches still suffer from several drawbacks. Calibration-on-demand is desirable to reduce the maintenance cost and to enhance the reliability of the Wi-Fi IPS. Wi-Fi IPS degrades only when the radio map changes significantly and lastingly. Such changes are caused by radio map anomalous events. Examples of these events include changes in indoor environment, existence of spurious data from the sensing system and unexpected failure in utility infrastructures. This paper presents a theoretical and experimental study of a crowdsourcing online Wi-Fi radio map anomalous event detection system. Detection of these events will enhance the operation intelligence of Wi-Fi IPS and enable high-level context-aware services. This system is consisted of an outlier detector for abnormal signal identification and an event discriminator for determination of event occurrence. Real world smartphone data and simulated data are used to test the performance of the system. Initial results show that the system is able to detect over 92% of simulated events and 87.5% of real world events with a low false alarm rate.
Guoping Qiu, Yupeng Gao, Xiong Fang, Andy Chang, Chuen-Yu Chan
IPIN3