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

Jeehye Na

dblp:397/3861 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0002-5211-4718ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 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
3 papers
Vision and language · 49% Reinforcement learning · 19% Language models and text generation · 11%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › video-language model
video large language model
1.722025
DeepVideo-R1: Video Reinforcement Fine-Tuning via Difficulty-aware Regressive GRPO · NeurIPS 2025
VidChain: Chain-of-Tasks with Metric-based Direct Preference Optimization for Dense Video Captioning · AAAI 2025
Computer vision › Vision and language
caption generation
1.012026
Improving Large Molecular Language Model via Relation-aware Multimodal Collaboration · AAAI 2026
Natural language and speech › Language models and text generation › pre-trained language model › domain-specific language model
molecular language model
1.012026
Improving Large Molecular Language Model via Relation-aware Multimodal Collaboration · AAAI 2026
Machine learning › Graph learning › molecular representation learning › molecular graph learning
molecular property prediction
1.012026
Improving Large Molecular Language Model via Relation-aware Multimodal Collaboration · AAAI 2026
Bioinformatics and computational biology › molecular informatics
molecular representation learning
1.012026
Improving Large Molecular Language Model via Relation-aware Multimodal Collaboration · AAAI 2026
Computer vision › Vision and language › video captioning
dense video captioning
0.912025
VidChain: Chain-of-Tasks with Metric-based Direct Preference Optimization for Dense Video Captioning · AAAI 2025
Machine learning › Reinforcement learning › policy optimization
group relative policy optimization
0.912025
DeepVideo-R1: Video Reinforcement Fine-Tuning via Difficulty-aware Regressive GRPO · NeurIPS 2025
Machine learning › Reinforcement learning
policy optimization
0.912025
DeepVideo-R1: Video Reinforcement Fine-Tuning via Difficulty-aware Regressive GRPO · NeurIPS 2025
Computer vision › Vision and language
temporal grounding
0.912025
VidChain: Chain-of-Tasks with Metric-based Direct Preference Optimization for Dense Video Captioning · AAAI 2025
Computer vision › Video understanding and tracking › deep video understanding
video reasoning
0.912025
DeepVideo-R1: Video Reinforcement Fine-Tuning via Difficulty-aware Regressive GRPO · NeurIPS 2025

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

multimodal attention · 2.0large language model · 2.0reinforcement fine-tuning · 0.9regression · 0.9metric-based alignment · 0.9direct preference optimization · 0.9difficulty-aware data augmentation · 0.9chain-of-tasks · 0.9
YearPublicationVenuePosition
2026 Improving Large Molecular Language Model via Relation-aware Multimodal Collaboration
abstract
Large language models (LLMs) have demonstrated their instruction-following capabilities and achieved powerful performance on various tasks. Inspired by their success, recent works in the molecular domain have led to the development of large molecular language models (LMLMs) that integrate 1D molecular strings or 2D molecular graphs into the language models. However, existing LMLMs often suffer from hallucination and limited robustness, largely due to inadequate integration of diverse molecular modalities such as 1D sequences, 2D molecular graphs, and 3D conformations. To address these limitations, we propose CoLLaMo, a large language model-based molecular assistant equipped with a multi-level molecular modality-collaborative projector. The relation-aware modality-collaborative attention mechanism in the projector facilitates fine-grained and relation-guided information exchange between atoms by incorporating 2D structural and 3D spatial relations. Furthermore, we present a molecule-centric new automatic measurement, including a hallucination assessment metric and GPT-based caption quality evaluation to address the limitations of token-based generic evaluation metrics (i.e., BLEU) widely used in assessing molecular comprehension of LMLMs. Our extensive experiments demonstrate that our CoLLaMo enhances the molecular modality generalization capabilities of LMLMs, achieving the best performance on multiple tasks, including molecule captioning, computed property QA, descriptive property QA, motif counting, and IUPAC name prediction.
Jinyoung Park 0005, Minseong Bae, Jeehye Na, Hyunwoo J. Kim
AAAI3
2026 Relevance-aware Multi-context Contrastive Decoding for Retrieval-augmented Visual Question Answering
abstract
Despite the remarkable capabilities of Large Vision Language Models (LVLMs), they still lack detailed knowledge about specific entities. Retrieval-augmented Generation (RAG) is a widely adopted solution that enhances LVLMs by providing additional contexts from an external Knowledge Base. However, we observe that previous decoding methods for RAG are sub-optimal as they fail to sufficiently leverage multiple relevant contexts and suppress the negative effects of irrelevant contexts. To this end, we propose Relevance-aware Multi-context Contrastive Decoding (RMCD), a novel decoding method for RAG. RMCD outputs a final prediction by combining outputs predicted with each context, where each output is weighted based on its relevance to the question. By doing so, RMCD effectively aggregates useful information from multiple relevant contexts while also counteracting the negative effects of irrelevant ones. Experiments show that RMCD consistently outperforms other decoding methods across multiple LVLMs, achieving the best performance on three knowledge-intensive visual question-answering benchmarks. Also, RMCD can be simply applied by replacing the decoding method of LVLMs without additional training. Analyses also show that RMCD is robust to the retrieval results, consistently performing the best across the weakest to the strongest retrieval results.
Jongha Kim, Byungoh Ko, Jeehye Na, Jinsung Yoon, Hyunwoo J. Kim
WACV3
2025 VidChain: Chain-of-Tasks with Metric-based Direct Preference Optimization for Dense Video Captioning
abstract
Despite the advancements of Video Large Language Models (VideoLLMs) in various tasks, they struggle with fine-grained temporal understanding, such as Dense Video Captioning (DVC). DVC is a complicated task of describing all events within a video while also temporally localizing them, which integrates multiple fine-grained tasks, including video segmentation, video captioning, and temporal video grounding. Previous VideoLLMs attempt to solve DVC in a single step, failing to utilize their reasoning capability. Moreover, previous training objectives for VideoLLMs do not fully reflect the evaluation metrics, therefore not providing supervision directly aligned to target tasks. To address such a problem, we propose a novel framework named VidChain comprised of Chain-of-Tasks (CoTasks) and Metric-based Direct Preference Optimization (M-DPO). CoTasks decompose a complex task into a sequence of sub-tasks, allowing VideoLLMs to leverage their reasoning capabilities more effectively. M-DPO aligns a VideoLLM with evaluation metrics, providing fine-grained supervision to each task that is well-aligned with metrics. Applied to two different VideoLLMs, VidChain consistently improves their fine-grained video understanding, thereby outperforming previous VideoLLMs on two different DVC benchmarks and also on the temporal video grounding task.
Ji Soo Lee, Jongha Kim, Jeehye Na, Jinyoung Park 0005, Hyunwoo J. Kim
AAAI3
2025 DeepVideo-R1: Video Reinforcement Fine-Tuning via Difficulty-aware Regressive GRPO
abstract
Recent works have demonstrated the effectiveness of reinforcement learning (RL)-based post-training for enhancing the reasoning capabilities of large language models (LLMs). In particular, Group Relative Policy Optimization (GRPO) has shown impressive success using a PPO-style reinforcement learning algorithm with group-normalized rewards. However, the effectiveness of GRPO in Video Large Language Models (VideoLLMs) remains underexplored. In this paper, we explore GRPO and identify two issues that hinder effective learning: (1) reliance on safeguards, and (2) vanishing advantage. To mitigate these challenges, we propose DeepVideo-R1, a video large language model trained with Reg-GRPO (Regressive GRPO) and difficulty-aware data augmentation. Reg-GRPO reformulates the GRPO loss function as a regression task that directly predicts the advantage in GRPO, eliminating the need for safeguards such as clipping and min operations. This directly aligns the model with the advantages, providing guidance to prefer better outputs. The difficulty-aware data augmentation strategy augments input prompts/videos to target solvable difficulty levels, enabling diverse reward signals. Our experimental results show that our approach significantly improves video reasoning performance across multiple benchmarks.
Jinyoung Park 0005, Jeehye Na, Jinyoung Kim 0007, Hyunwoo J. Kim
NeurIPS2