← Search

Jinda Lu

13 accepted papers

2026

Accelerating Controllable Generation via Hybrid-grained Cache

AAAI 2026technical

Controllable generative models have been widely used to improve the realism of synthetic visual content. However, such models must handle control conditions and content generation computational requirements, resulting in generally low generation efficiency. To address this issue, we propose a Hybrid

Cited by 0SourcePDFScholar
2026

Causal-HalBench: Uncovering LVLMs Object Hallucinations Through Causal Intervention

AAAI 2026technical

Large Vision-Language Models (LVLMs) often suffer from object hallucination, making erroneous judgments about the presence of objects in images. We propose this primarily stems from spurious correlations arising when models strongly associate highly co-occurring objects during training, leading to h

Cited by 0SourcePDFScholar
2026

Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals

ICML 2026poster

Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a central paradigm for scaling LLM reasoning, yet its optimization often suffers from training instability and suboptimal convergence. Through a systematic dissection of the GRPO-based objective, we reveal that the rigid clipping d…

Cited by 0SourceScholar
2026

Enhancing Multi-Modal LLMs Reasoning via Difficulty-Aware Group Normalization

ICML 2026poster

Reinforcement Learning with Verifiable Rewards (RLVR) and Group Relative Policy Optimization (GRPO) have significantly advanced the reasoning capabilities of large language models. Extending these methods to multimodal settings, however, faces a critical challenge: the instability of std-based norma…

Cited by 0SourceScholar
2026

Experience Augmented Policy Optimization for LLM Reasoning

ICML 2026poster

Reinforcement Learning with Verifiable Rewards (RLVR) is a powerful paradigm for improving the reasoning capabilities of large language models (LLMs). However, existing RLVR methods typically rely on on-policy optimization from scratch, resulting in high sampling costs and inefficient utilization of…

Cited by 0SourceScholar
2026

On the Direction of RLVR Updates for LLM Reasoning: Identification and Exploitation

ICLR 2026poster

Reinforcement learning with verifiable rewards (RLVR) has substantially improved the reasoning capabilities of large language models. While existing analyses identify that RLVR-induced changes are sparse, they primarily focus on the **magnitude** of these updates, largely overlooking their **direct…

Cited by 0SourcecodeScholar
2026

One-Way Policy Optimization for Self-Evolving LLMs

ICML 2026poster

Reinforcement Learning with Verifiable Rewards (RLVR) has become a promising paradigm for scaling reasoning capabilities of Large Language Models (LLMs). However, the sparsity of binary verifier rewards often leads to low efficiency and optimization instability. To stabilize training, existing metho…

Cited by 0SourceScholar
2026

Thinking with Frames: Generative Video Distortion Evaluation via Frame Reward Model

CVPR 2026

Recent advances in video reward models and post-training strategies have improved text-to-video (T2V) generation. While these models typically assess visual quality, motion quality, and text alignment, they often overlook key structural distortions, such as abnormal object appearances and interactio

Cited by 0SourceScholar
2025

DAMA: Data- and Model-aware Alignment of Multi-modal LLMs

ICML 2025poster

Direct Preference Optimization (DPO) has shown effectiveness in aligning multi-modal large language models (MLLM) with human preferences. However, existing methods exhibit an imbalanced responsiveness to the data of varying hardness, tending to overfit on the easy-to-distinguish data while underfit…

Cited by 0SourcePDFScholar
2025

DiffGAD: A Diffusion-based Unsupervised Graph Anomaly Detector

ICLR 2025poster

Graph Anomaly Detection (GAD) is crucial for identifying abnormal entities within networks, garnering significant attention across various fields. Traditional unsupervised methods, which decode encoded latent representations of unlabeled data with a reconstruction focus, often fail to capture critic…

2025

Unified Parameter-Efficient Unlearning for LLMs

ICLR 2025poster

The advent of Large Language Models (LLMs) has revolutionized natural language processing, enabling advanced understanding and reasoning capabilities across a variety of tasks. Fine-tuning these models for specific domains, particularly through Parameter-Efficient Fine-Tuning (PEFT) strategies like…

2024

Boosting Few-Shot Learning via Attentive Feature Regularization

AAAI 2024technical

Few-shot learning (FSL) based on manifold regularization aims to improve the recognition capacity of novel objects with limited training samples by mixing two samples from different categories with a blending factor. However, this mixing operation weakens the feature representation due to the linear…

Cited by 11SourcePDFScholar