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

Sinbadliu

dblp:383/7016 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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
2 papers
Language models and text generation · 76% Question answering and dialogue systems · 19% Knowledge representation and reasoning · 6%
Network and information security
1 paper
Web and mobile security · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
chain-of-thought reasoning
0.912025
Fact-R1: Towards Explainable Video Misinformation Detection with Deep Reasoning · NeurIPS 2025
Natural language and speech › Language models and text generation › text generation › open-ended text generation
creative text generation
0.912025
Innovative Thinking, Infinite Humor: Humor Research of Large Language Models through Structured Thought Leaps · ICLR 2025
Natural language and speech › Language models and text generation › text generation
humor generation
0.912025
Innovative Thinking, Infinite Humor: Humor Research of Large Language Models through Structured Thought Leaps · ICLR 2025
Natural language and speech › Language models and text generation
large language model
0.912025
Fact-R1: Towards Explainable Video Misinformation Detection with Deep Reasoning · NeurIPS 2025
Natural language and speech › Question answering and dialogue systems
multi-hop reasoning
0.912025
Innovative Thinking, Infinite Humor: Humor Research of Large Language Models through Structured Thought Leaps · ICLR 2025
Web and mobile security › harmful content detection
misinformation detection
0.912025
Fact-R1: Towards Explainable Video Misinformation Detection with Deep Reasoning · NeurIPS 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
knowledge graph completion
0.312025
Innovative Thinking, Infinite Humor: Humor Research of Large Language Models through Structured Thought Leaps · ICLR 2025

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

reinforcement learning · 2.6group relative policy optimization · 1.7direct preference optimization · 1.7instruction evolution · 0.9GPT-4o · 0.9
YearPublicationVenuePosition
2025 Innovative Thinking, Infinite Humor: Humor Research of Large Language Models through Structured Thought Leaps
abstract
Humor is previously regarded as a gift exclusive to humans for the following reasons. Humor is a culturally nuanced aspect of human language, presenting challenges for its understanding and generation. Humor generation necessitates a multi-hop reasoning process, with each hop founded on proper rationales. Although many studies, such as those related to GPT-o1, focus on logical reasoning with reflection and correction, they still fall short in humor generation. Due to the sparsity of the knowledge graph in creative thinking, it is arduous to achieve multi-hop reasoning. Consequently, in this paper, we propose a more robust framework for addressing the humor reasoning task, named LoL. LoL aims to inject external information to mitigate the sparsity of the knowledge graph, thereby enabling multi-hop reasoning. In the first stage of LoL, we put forward an automatic instruction-evolution method to incorporate the deeper and broader thinking processes underlying humor. Judgment-oriented instructions are devised to enhance the model's judgment capability, dynamically supplementing and updating the sparse knowledge graph. Subsequently, through reinforcement learning, the reasoning logic for each online-generated response is extracted using GPT-4o. In this process, external knowledge is re-introduced to aid the model in logical reasoning and the learning of human preferences. Finally, experimental results indicate that the combination of these two processes can enhance both the model's judgment ability and its generative capacity. These findings deepen our comprehension of the creative capabilities of large language models (LLMs) and offer approaches to boost LLMs' creative abilities for cross-domain innovative applications.
Sinbadliu, Xuguang Lan
ICLR5
2025 Fact-R1: Towards Explainable Video Misinformation Detection with Deep Reasoning
abstract
The rapid spread of multimodal misinformation on social media has raised growing concerns, while research on video misinformation detection remains limited due to the lack of large-scale, diverse datasets. Existing methods often overfit to rigid templates and lack deep reasoning over deceptive content. To address these challenges, we introduce FakeVV, a large-scale benchmark comprising over 100,000 video-text pairs with fine-grained, interpretable annotations. In addition, we further propose Fact-R1, a novel framework that integrates deep reasoning with collaborative rule-based reinforcement learning. Fact-R1 is trained through a three-stage process: (1) misinformation long-Chain-of-Thought (CoT) instruction tuning, (2) preference alignment via Direct Preference Optimization (DPO), and (3) Group Relative Policy Optimization (GRPO) using a novel verifiable reward function. This enables Fact-R1 to exhibit emergent reasoning behaviors comparable to those observed in advanced text-based reinforcement learning systems, but in the more complex multimodal misinformation setting. Our work establishes a new paradigm for misinformation detection, bridging large-scale video understanding, reasoning-guided alignment, and interpretable verification.
Fanrui Zhang, Qiang Zhang 0051, Jun Chen 0005, Sinbadliu, Junxiong Lin, Jiahong Yan, Jiawei Liu 0001, Zhengjun Zha
NeurIPS5