Papers by Jiale Zhao

8 papers
RubricHub: A Comprehensive and Highly Discriminative Rubric Dataset via Automated Coarse-to-Fine Generation (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for generating open-ended rubrics suffer from scalability bottlenecks and coarse criteria resulting in a supervision ceiling effect.
Approach: They propose a framework for automated Coarse-to-Fine Rubric Generation . their framework uses principle-guided synthesis, multi-model aggregation, difficulty evolution .
Outcome: The proposed framework produces comprehensive and highly discriminative criteria capable of capturing the subtle nuances.
See the World, Discover Knowledge: A Chinese Factuality Evaluation for Large Vision Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing models for large vision language models do not fully reflect their knowledge capacity and reliability, resulting in erroneous outputs that do not align with the image content or provide answers lacking knowledge evidence.
Approach: They propose a Chinese-based benchmark for visual factuality across 8 major topics and 56 subtopics and a multi-hop question construction.
Outcome: The proposed model decouples visual factuality into two parts: seeing the world and discovering knowledge.
ThinkPilot: Steering Reasoning Models via Automated Think-prefixes Optimization (2026.findings-eacl)

Copied to clipboard

Challenge: Large Reasoning Models (LRMs) are powerful but still suffer from inefficient and off-target reasoning.
Approach: They propose a training-free framework that automatically optimizes Large Reasoning Models' reasoning by generating think-prefixes that evolve driven by a taxonomy of reasoning behaviors.
Outcome: The proposed framework significantly improves accuracy-length trade-off for efficient reasoning, drastically improves safety and improves instruction following.
Conv-Basis: A New Paradigm for Efficient Attention Inference and Gradient Computation in Transformers (2025.findings-emnlp)

Copied to clipboard

Challenge: a large computational cost for attention computation in large language models is a major obstacle .
Approach: They propose a convolution-like structure for attention computation using convolution matrices . they then propose an efficient approximation method to approximate the attention matrix .
Outcome: The proposed method achieves nearly linear time complexity in n1+o(1) time.
Modelling Long-distance Node Relations for KBQA with Global Dynamic Graph (2020.coling-main)

Copied to clipboard

Challenge: Existing studies rely on deep graph neural networks (GNNs) to capture rich structural information, but they lack the structural information needed for QA.
Approach: They propose a framework which captures structural information from KBs and models long-distance node relations from two perspectives.
Outcome: The proposed framework models long-distance node relations from two perspectives . it is based on two widely used multi-hop KBQA datasets .
When and What to Ask: AskBench and Rubric-Guided RLVR for LLM Clarification (2026.findings-acl)

Copied to clipboard

Challenge: Large language models respond even when prompts omit critical details or include misleading information, leading to hallucinations or reinforced misconceptions.
Approach: They propose an interactive benchmark that converts standard QA pairs into multi-turn interactions with explicit checkpoints.
Outcome: The proposed benchmark improves accuracy, rubric adherence, and interaction efficiency with strong generalization to unseen domains.
Game Development as Human-LLM Interaction (2025.acl-long)

Copied to clipboard

Challenge: Currently, game development is a highly specialized task that relies on a complex game engine powered by complex programming languages, preventing many gaming enthusiasts from handling it.
Approach: They propose a chat game engine powered by LLM that allows everyone to develop a custom game using natural language through Human-LLM interaction.
Outcome: The proposed engine is designed to support the development of custom games using natural language through Human-LLM interaction.
Generative Prompt Tuning for Relation Classification (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing prompt tuning methods for RC are limited by label spaces and rigid prompt restrictions.
Approach: They propose a generative prompt tuning method to reformulate relation classification as an infilling problem by adding cloze-style phrases to masked language modeling problems.
Outcome: The proposed method exploits rich semantics of entity and relation types and can predict label verbalizations with varying lengths at multiple predicted positions.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations