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

Ruijun Sun

dblp:340/3131 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Computer graphics and multimedia
1 paper
Virtual and augmented reality · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Virtual and augmented reality › immersive streaming
VR streaming
1.012026
Supporting Bi-Directional Collaboration with Unmodified Immersive Applications Using AccompliceVR · IEEE Trans. Vis. Comput. Graph. 2026
Machine learning › Trustworthy machine learning
robustness
0.812024
COMI: COrrect and MItigate Shortcut Learning Behavior in Deep Neural Networks · SIGIR 2024
Machine learning › Trustworthy machine learning › robustness
shortcut learning
0.812024
COMI: COrrect and MItigate Shortcut Learning Behavior in Deep Neural Networks · SIGIR 2024
Machine learning › Trustworthy machine learning › robustness › spurious correlation
spurious correlation mitigation
0.812024
COMI: COrrect and MItigate Shortcut Learning Behavior in Deep Neural Networks · SIGIR 2024

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

frame stitching · 1.0OpenVR · 1.0knowledge distillation · 0.8empirical risk minimization · 0.8LIME · 0.8
YearPublicationVenuePosition
2026 Supporting Bi-Directional Collaboration with Unmodified Immersive Applications Using AccompliceVR
abstract
With the increasing popularity of virtual reality (VR) applications, allowing interaction with non-immersed spectators has become an important supporting functionality. To this end, a variety of VR streaming systems focus on allowing remote spectating experiences. However, such systems lack mechanisms that allow spectators to assist or explore inside VR applications alongside the VR players. To address, we explore AccompliceVR (AVR), a novel streaming and remote collaboration system. Using built-in OpenVR functionality, AVR introduces avatar representations of spectators overlaid into the normal stereo views of unmodified VR applications. AVR also enhances the remote spectator experience by stitching frames of video from the VR player to reconstruct a pseudo-panoramic view. This allows them to move around and point at the environment with an avatar. We first evaluated that AVR is compatible with a selection of the most popular VR games. The system is then validated through a paired user study with 30 participants using a mixed-design pattern. Participants played two well-known VR games (as 'pilot') and were assisted by their partner in the pair (as 'copilot'). The results support that AVR shows significant improvement in communication between pilots and copilots and enhances the pilot's understanding of instructions from their copilot.
Ruijun Sun, Anthony Steed
IEEE Trans. Vis. Comput. Graph.1
2024 COMI: COrrect and MItigate Shortcut Learning Behavior in Deep Neural Networks
abstract
Deep Neural Networks (DNNs), despite their notable progress across information retrieval tasks, encounter the issues of shortcut learning and struggle with poor generalization due to their reliance on spurious correlations between features and labels. Current research mainly mitigates shortcut learning behavior using augmentation and distillation techniques, but these methods could be laborious and introduce unwarranted biases. To tackle these, in this paper, we propose COMI, a novel method to COrrect and MItigate shortcut learning behavior. Inspired by the ways students solve shortcuts in educational scenarios, we aim to reduce model's reliance on shortcuts and enhance its ability to extract underlying information integrated with standard Empirical Risk Minimization (ERM). Specifically, we first design Correct Habit (CoHa) strategy to retrieve the top m challenging samples for priority training, which encourages model to rely less on shortcuts in the early training. Then, to extract more meaningful underlying information, the information derived from ERM is separated into task-relevant and task-irrelevant information, the former serves as the primary basis for model predictions, while the latter is considered non-essential. However, within task-relevant information, certain potential shortcuts contribute to overconfident predictions. To mitigate this, we design Deep Mitigation (DeMi) network with shortcut margin loss to adaptively control the feature weights of shortcuts and eliminate their influence. Besides, to counteract unknown shortcut tokens issue in NLP, we adopt locally interpretable module-LIME to help recognize shortcut tokens. Finally, extensive experiments conducted on NLP and CV tasks demonstrate the effectiveness of COMI, which can perform well on both IID and OOD samples.
Lili Zhao 0002, Qi Liu 0003, Linan Yue, Wei Chen 0156, Liyi Chen 0001, Ruijun Sun
SIGIR6
2024 HACAN: a hierarchical answer-aware and context-aware network for question generation
Ruijun Sun, Hanqin Tao, Yanmin Chen, Qi Liu 0003
Frontiers Comput. Sci.1
2024 A relation-aware representation approach for the question matching system
Yanmin Chen, Enhong Chen, Kun Zhang 0015, Qi Liu 0003, Ruijun Sun
World Wide Web (WWW)5