Jiarui Yu

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

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 5 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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
6 papers
Reinforcement learning · 52% Information extraction and text analysis · 17% Language models and text generation · 13%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

Topics — the 14 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › reward design
reinforcement learning with verifiable rewards
1.922026
Rethinking Entropy Interventions in RLVR: An Entropy Change Perspective · ACL (1) 2026
ReDit: Reward Dithering for Improved LLM Policy Optimization · NeurIPS 2025
Natural language and speech › Language models and text generation
large language model reasoning
1.222026
ReDit: Reward Dithering for Improved LLM Policy Optimization · NeurIPS 2025
Rethinking Entropy Interventions in RLVR: An Entropy Change Perspective · ACL (1) 2026
Machine learning › Reinforcement learning › regularization for reinforcement learning
entropy regularization
1.012026
Rethinking Entropy Interventions in RLVR: An Entropy Change Perspective · ACL (1) 2026
Machine learning › Reinforcement learning
policy optimization
0.912025
ReDit: Reward Dithering for Improved LLM Policy Optimization · NeurIPS 2025
Machine learning › Reinforcement learning › reward design
reward shaping
0.912025
ReDit: Reward Dithering for Improved LLM Policy Optimization · NeurIPS 2025
Visual content generation and editing › vector graphics generation
SVG generation
0.912025
UniSVG: A Unified Dataset for Vector Graphic Understanding and Generation with Multimodal Large Language Models · ACM Multimedia 2025
Visual content generation and editing
vector graphics generation
0.912025
UniSVG: A Unified Dataset for Vector Graphic Understanding and Generation with Multimodal Large Language Models · ACM Multimedia 2025
Natural language and speech › Information extraction and text analysis
event extraction
0.812024
SPEED++: A Multilingual Event Extraction Framework for Epidemic Prediction and Preparedness · EMNLP 2024
Natural language and speech › Information extraction and text analysis › event extraction
multilingual event extraction
0.812024
SPEED++: A Multilingual Event Extraction Framework for Epidemic Prediction and Preparedness · EMNLP 2024
Computer vision › Vision and language
image captioning
0.712023
CgT-GAN: CLIP-guided Text GAN for Image Captioning · ACM Multimedia 2023
Computer vision › Video understanding and tracking
long video understanding
0.612022
Unified QA-aware Knowledge Graph Generation Based on Multi-modal Modeling · ACM Multimedia 2022
Knowledge graphs
knowledge graph construction
0.612022
Unified QA-aware Knowledge Graph Generation Based on Multi-modal Modeling · ACM Multimedia 2022
Knowledge graphs › knowledge graph construction
multimodal knowledge graph construction
0.612022
Unified QA-aware Knowledge Graph Generation Based on Multi-modal Modeling · ACM Multimedia 2022
Computer vision › Vision and language › vision-language model
multimodal large language model
0.312025
UniSVG: A Unified Dataset for Vector Graphic Understanding and Generation with Multimodal Large Language Models · ACM Multimedia 2025

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

multimodal large language model · 1.7large language model · 1.5policy optimization · 1.0entropy intervention · 1.0random noise perturbation · 0.9GRPO · 0.9generative adversarial network · 0.7adversarial training · 0.7CLIP-based reward · 0.7multimodal pretraining · 0.6multimodal pre-training · 0.6
YearPublicationVenuePosition
2026 Rethinking Entropy Interventions in RLVR: An Entropy Change Perspective
abstract
Zhezheng Hao, Hong Wang, Haoyang Liu, Jian Luo, Jiarui Yu, Hande Dong, Qiang Lin, Can Wang, Jiawei Chen. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Zhezheng Hao, Jiarui Yu, Hande Dong
ACL (1)5
2025 UniSVG: A Unified Dataset for Vector Graphic Understanding and Generation with Multimodal Large Language Models
abstract
Unlike bitmap images, scalable vector graphics (SVG) maintain quality when scaled, frequently employed in computer vision and artistic design in the representation of SVG code. In this era of proliferating AI-powered systems, enabling AI to understand and generate SVG has become increasingly urgent. However, AI-driven SVG understanding and generation (U&G) remain significant challenges. SVG code, equivalent to a set of curves and lines controlled by floating-point parameters, demands high precision in SVG U&G. Besides, SVG generation operates under diverse conditional constraints, including textual prompts and visual references, which requires powerful multi-modal processing for condition-to-SVG transformation. Recently, the rapid growth of Multi-modal Large Language Models (MLLMs) have demonstrated capabilities to process multi-modal inputs and generate complex vector controlling parameters, suggesting the potential to address SVG U&G tasks within a unified model. To unlock MLLM's capabilities in the SVG area, we propose an SVG-centric dataset called UniSVG, comprising 525k data items, tailored for MLLM training and evaluation. To our best knowledge, it is the first comprehensive dataset designed for unified SVG generation (from textual prompts and images) and SVG understanding (color, category, usage, etc.). As expected, learning on the proposed dataset boosts open-source MLLMs' performance on various SVG U&G tasks, surpassing SOTA close-source MLLMs like GPT-4V. We release dataset, benchmark, weights, codes and experiment details on https://ryanlijinke.github.io/.
Jiarui Yu, Chenxing Wei, Hande Dong, Liangjing Yang, Zhicai Wang, Yanbin Hao
ACM Multimedia2
2025 ReDit: Reward Dithering for Improved LLM Policy Optimization
abstract
DeepSeek-R1 has successfully enhanced Large Language Model (LLM) reasoning capabilities through its rule-based reward system. While it's a ''perfect'' reward system that effectively mitigates reward hacking, such reward functions are often discrete. Our experimental observations suggest that discrete rewards can lead to gradient anomaly, unstable optimization, and slow convergence. To address this issue, we propose ReDit (Reward Dithering), a method that dithers the discrete reward signal by adding simple random noise. With this perturbed reward, exploratory gradients are continuously provided throughout the learning process, enabling smoother gradient updates and accelerating convergence. The injected noise also introduces stochasticity into flat reward regions, encouraging the model to explore novel policies and escape local optima. Experiments across diverse tasks demonstrate the effectiveness and efficiency of ReDit. On average, ReDit achieves performance comparable to vanilla GRPO with only approximately 10% the training steps, and furthermore, still exhibits a 4% performance improvement over vanilla GRPO when trained for a similar duration. Visualizations confirm significant mitigation of gradient issues with ReDit. Moreover, theoretical analyses are provided to further validate these advantages.
Chenxing Wei, Jiarui Yu, Ying He 0006, Hande Dong, Yao Shu, F. Richard Yu
NeurIPS2
2025 CVLP-NaVD: Contrastive Visual-language Pre-training Models for Non-annotated Visual Description
abstract
Non-annotated visual description (NaVD) aims to describe generic visuals without human-annotated pairwise data. The generic visuals refer to images and videos. Existing works mainly focus on one specific visual modality, i.e., image or video. In this article, we propose a new framework for this task, which can directly be applied to both image and video with the pipeline unchanged. Essentially, it is a unified framework that flexibly adapts to images and videos. Recently, contrastive visual-language pre-training models (CVLPs) have experienced rapid development, demonstrating powerful abilities to align vision and language. To continuously leverage advanced CVLPs, our framework is designed to work well with general CVLPs. It can easily use image-language CVLPs for image input and switch to video-language CVLPs for video input. Specifically, we propose a CVLP-based framework for NaVD, named CVLP-NaVD. It follows the paradigm of adversarial learning, containing a generator and a discriminator. The generator takes an image or a video as input and produces a corresponding language description, while the discriminator evaluates the generated sentence for its naturalness in human-like language. Apart from the naturalness, CVLPs play a crucial role in enhancing the alignment between visual and language signals during generation. Particularly, we explore three rewarding strategies to compute the alignment score, including directly calculating cosine similarity (i.e., VL-cross), projecting visual embeddings into the textual domain (i.e., VL-project), and their combination (i.e., VL-mix). The three strategies are fully examined in different scenarios. Finally, we conduct extensive experiments with various unpaired and unsupervised setups in both image and video captioning tasks. The experimental results demonstrate that our CVLP-NaVD outperforms the state-of-the-art methods significantly.
Yanbin Hao, Jiarui Yu, Bin Zhu 0006, Shuo Wang 0008, Tong Xu 0001
ACM Trans. Multim. Comput. Commun. Appl.3
2024 SPEED++: A Multilingual Event Extraction Framework for Epidemic Prediction and Preparedness
abstract
Tanmay Parekh, Jeffrey Kwan, Jiarui Yu, Sparsh Johri, Hyosang Ahn, Sreya Muppalla, Kai-Wei Chang, Wei Wang, Nanyun Peng. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.
Tanmay Parekh, Jeffrey Kwan, Jiarui Yu, Sparsh Johri, Hyosang Ahn, Sreya Muppalla, Kai-Wei Chang 0001, Wei Wang 0010, Nanyun Peng 0001
EMNLP3
2024 Event Detection from Social Media for Epidemic Prediction
abstract
Tanmay Parekh, Anh Mac, Jiarui Yu, Yuxuan Dong, Syed Shahriar, Bonnie Liu, Eric Yang, Kuan-Hao Huang, Wei Wang, Nanyun Peng, Kai-Wei Chang. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
Tanmay Parekh, Anh Mac, Jiarui Yu, Syed Shahriar, Bonnie Liu, Eric Yang, Kuan-Hao Huang, Wei Wang 0010, Nanyun Peng 0001, Kai-Wei Chang 0001
NAACL-HLT3
2024 Combining travel behavior in metro passenger flow prediction: A smart explainable Stacking-Catboost algorithm
Jiarui Yu, Ximing Chang, Songhua Hu, Haodong Yin
Inf. Process. Manag.1
2023 How Can Contrastive Pre-training Benefit Audio-Visual Segmentation? A Study from Supervised and Zero-shot Perspectives
Jiarui Yu, Yanbin Hao, Jinmeng Wu, Tong Xu 0001, Shuo Wang 0008, Xiangnan He 0001
BMVC1
2023 CgT-GAN: CLIP-guided Text GAN for Image Captioning
abstract
The large-scale visual-language pre-trained model, Contrastive Language-Image Pre-training (CLIP), has significantly improved image captioning for scenarios without human-annotated image-caption pairs. Recent advanced CLIP-based image captioning without human annotations follows a text-only training paradigm, i.e., reconstructing text from shared embedding space. Nevertheless, these approaches are limited by the training/inference gap or huge storage requirements for text embeddings. Given that it is trivial to obtain images in the real world, we propose CLIP-guided text GAN (CgT-GAN), which incorporates images into the training process to enable the model to "see" real visual modality. Particularly, we use adversarial training to teach CgT-GAN to mimic the phrases of an external text corpus and CLIP-based reward to provide semantic guidance. The caption generator is jointly rewarded based on the caption naturalness to human language calculated from the GAN's discriminator and the semantic guidance reward computed by the CLIP-based reward module. In addition to the cosine similarity as the semantic guidance reward (i.e., CLIP-cos), we further introduce a novel semantic guidance reward called CLIP-agg, which aligns the generated caption with a weighted text embedding by attentively aggregating the entire corpus. Experimental results on three subtasks (ZS-IC, In-UIC and Cross-UIC) show that CgT-GAN outperforms state-of-the-art methods significantly across all metrics. Code is available at https://github.com/Lihr747/CgtGAN.
Jiarui Yu, Yanbin Hao, Bin Zhu 0006, Tong Xu 0001, Xiangnan He 0001
ACM Multimedia1
2023 A SM2 based efficient and lightweight batch verification approach for IC cards
Jiarui Yu, Jingsong Cui, Hang Tu, Chunwu Yu
J. Inf. Secur. Appl.1
2022 Unified QA-aware Knowledge Graph Generation Based on Multi-modal Modeling
abstract
Understanding the long duration videos' storyline is often considered a major challenge in the field of video understanding. To promote research on understanding longer videos in the community, the deep video understanding (DVU) task is suggested for recognizing interactions at the scene level and relationships at the movie level, as well as answering questions at these two levels. In this work, we propose a unified QA-aware knowledge graph generation approach, which consists of the relation-centric graph and interaction-centric graph and demonstrates the powerful performance of multimodal pre-training models in solving such problems. Extensive validations on the HLVU dataset demonstrate the effectiveness of our proposed method.
Penggang Qin, Jiarui Yu, Yan Gao 0017, Derong Xu, Yunkai Chen, Tong Xu 0001, Enhong Chen, Yanbin Hao
ACM Multimedia2