Yanrui Yu

dblp:380/8954 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0009-7543-6507ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 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.

Databases, data mining, and information retrieval
2 papers
Data integration and cleaning · 72% Query processing and optimization · 28%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › complex data query processing
video query processing
0.912025
Lava: Language Driven Scalable and Versatile Traffic Video Analytics · ACM Multimedia 2025
Multimedia analysis and retrieval
video content analysis
0.912025
Lava: Language Driven Scalable and Versatile Traffic Video Analytics · ACM Multimedia 2025
Data integration and cleaning › table discovery
joinable table discovery
0.812024
LakeBench: A Benchmark for Discovering Joinable and Unionable Tables in Data Lakes · Proc. VLDB Endow. 2024
Data integration and cleaning
table discovery
0.812024
LakeBench: A Benchmark for Discovering Joinable and Unionable Tables in Data Lakes · Proc. VLDB Endow. 2024
Data integration and cleaning › table discovery
table union search
0.812024
LakeBench: A Benchmark for Discovering Joinable and Unionable Tables in Data Lakes · Proc. VLDB Endow. 2024
Performance modeling and evaluation
benchmarking
0.212024
LakeBench: A Benchmark for Discovering Joinable and Unionable Tables in Data Lakes · Proc. VLDB Endow. 2024

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

trajectory extraction · 1.7open-world detection · 1.7multi-armed bandit · 1.7
YearPublicationVenuePosition
2025 Lava: Language Driven Scalable and Versatile Traffic Video Analytics
abstract
In modern urban environments, camera networks generate massive amounts of operational footage -- reaching petabytes each day -- making scalable video analytics essential for efficient processing. Many existing approaches adopt an SQL-based paradigm for querying such large-scale video databases; however, this constrains queries to rigid patterns with predefined semantic categories, significantly limiting analytical flexibility. In this work, we explore a language-driven video analytics paradigm aimed at enabling flexible and efficient querying of high-volume video data driven by natural language. Particularly, we build Lava, a system that accepts natural language queries and retrieves traffic targets across multiple levels of granularity and arbitrary categories. Lava comprises three main components: 1) a multi-armed bandit-based efficient sampling method for video segment-level localization; 2) a video-specific open-world detection module for object-level retrieval; and 3) a long-term object trajectory extraction scheme for temporal object association, yielding complete trajectories for object-of-interests. To support comprehensive evaluation, we further develop a novel benchmark by providing diverse, semantically rich natural language predicates and fine-grained annotations for multiple videos. Experiments on this benchmark demonstrate that Lava improves F1-scores for selection queries by 14% reduces MPAE for aggregation queries by 0.39, and achieves top-k precision of 86% while processing videos 9.6x faster than the most accurate baseline. Our code and dataset are available at https://github.com/yuyanrui/LAVA.
Yanrui Yu, Tianfei Zhou, Jiaxin Sun, Lianpeng Qiao, Lizhong Ding 0003, Ye Yuan 0001, Guoren Wang
ACM Multimedia1
2025 VideoRFT: Incentivizing Video Reasoning Capability in MLLMs via Reinforced Fine-Tuning
abstract
Reinforcement fine-tuning (RFT) has shown great promise in achieving humanlevel reasoning capabilities of Large Language Models (LLMs), and has recently been extended to MLLMs. Nevertheless, reasoning about videos, which is a fundamental aspect of human intelligence, remains a persistent challenge due to the complex logic, temporal and causal structures inherent in video data. To fill this gap, we propose VideoRFT, a novel approach that extends the RFT paradigm to cultivate human-like video reasoning capabilities in MLLMs. VideoRFT follows the standard two-stage scheme in RFT: supervised fine-tuning (SFT) with chain-of-thought (CoT) annotations, followed by reinforcement learning (RL) to improve generalization. A central challenge to achieve this in the video domain lies in the scarcity of large-scale, high-quality video CoT datasets. We address this by building a multi-expert-driven, cognition-inspired CoT curation pipeline. First, we devise a cognition-inspired prompting strategy to elicit a reasoning LLM to generate preliminary CoTs based solely on rich, structured, and literal representations of video content. Subsequently, these CoTs are revised by a MLLM conditioned on the actual video, ensuring visual consistency and reducing visual hallucinations. This pipeline results in two new datasets, i.e.VideoRFT-CoT-102K for SFT and VideoRFT-RL-310K for RL. To further strengthen the RL phase, we introduce a novel semantic-consistency reward that explicitly promotes the alignment between textual reasoning and visual evidence. This reward encourages the model to produce coherent, context-aware reasoning outputs grounded in visual input. Extensive experiments show that VideoRFT achieves state-of-the-art performance on six video reasoning benchmarks.
Cheems Wang, Yanrui Yu, Ye Yuan 0001, Rui Mao 0001, Tianfei Zhou
NeurIPS2
2024 LakeBench: A Benchmark for Discovering Joinable and Unionable Tables in Data Lakes
abstract
Discovering tables from poorly maintained data lakes is a significant challenge in data management. Two key tasks are identifying joinable and unionable tables, crucial for data integration, analysis, and machine learning. However, there's a lack of a comprehensive benchmark for evaluating existing methods. To address this, we introduce LakeBench, a large-scale table discovery benchmark. It evaluates effectiveness, efficiency, and scalability of table join & union search methods. With over 16 million real tables, LakeBench is 1,600X larger than existing datasets and 100X larger in storage size. It includes synthesized and real queries with ground truth, totaling more than 10 thousand queries - 10X more than used in any existing evaluation. We spent over 7,500 human hours labeling these queries and constructing diverse query categories for thorough evaluation. Our benchmark thoroughly evaluates state-of-the-art table discovery methods, providing insights into their performance and highlighting research opportunities.
Chengliang Chai, Lei Cao 0004, Qin Yuan 0001, Yanrui Yu, Zhaoze Sun, Ziqi Cao, Kaisen Jin, Yuqing Jiang, Yuanfang Zhang, Ye Yuan 0001, Guoren Wang, Nan Tang 0001
Proc. VLDB Endow.6