Papers by Jun Kong
Direct Behavior Optimization: Unlocking the Potential of Lightweight LLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing prompt optimization methods rely on extensive manual effort or meta-cognitive abilities, making them less effective for LwLLMs. |
| Approach: | They propose a direct behavior optimization parameter that transforms the optimization of complex prompts into discrete, quantifiable execution sequences using a gradient-free Monte Carlo Tree Search. |
| Outcome: | The proposed method outperforms current prompt optimization methods on seven challenging tasks where state-of-the-art LLMs excel but LwLLMs generally underperform. |
Accelerating Inference for Pretrained Language Models by Unified Multi-Perspective Early Exiting (2022.coling-1)
Copied to clipboard
| Challenge: | Existing competitive methods to accelerate inference of pretrained language models are limited by their complexity and computational consumption. |
| Approach: | They propose a unified horizontal and vertical multi-perspective early exiting framework to accelerate inference of transformer-based models. |
| Outcome: | Experiments show that MPEE can achieve higher acceleration inference with competent performance than existing competitive methods. |
Joint Semantic and Strategy Matching for Persuasive Dialogue (2023.findings-emnlp)
Copied to clipboard
Chuhao Jin, Yutao Zhu, Lingzhen Kong, Shijie Li, Xiao Zhang, Ruihua Song, Xu Chen, Huan Chen, Yuchong Sun, Yu Chen, Jun Xu
| Challenge: | Persuasive dialogue models rely on utterance semantic matching and a key aspect has been ignored . compared with utterrance semantics, conversation strategies are high-level concepts, which can be informative and provide complementary information to achieve effective persuation. |
| Approach: | They propose to model conversation semantics and strategies to match them using a BERT-like module and an auto-regressive predictor. |
| Outcome: | The proposed model improves state-of-the-art by 5% on a small and 37% on 'large' datasets. |
NarGINA: Towards Accurate and Interpretable Children’s Narrative Ability Assessment via Narrative Graphs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for assessing children's narrative ability are limited to evaluating completeness of narrative content and the coherence of expression, as well as interpretability of assessment results. |
| Approach: | They propose a computational framework for assessing narrative ability using a narrative graph to provide a concise and structured summary representation of narrative text. |
| Outcome: | The proposed framework achieves significant performance improvement over baselines while possessing good interpretability. |
Dagger Behind Smile: Fool LLMs with a Happy Ending Story (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have attracted significant attention from jailbreak attacks . existing manual designs are either easily detectable or require intricate interactions with LLMs. |
| Approach: | They propose a happy ending attack that wraps up a malicious request in a scenario template . |
| Outcome: | The proposed attack wraps up a malicious request in a scenario template involving a positive prompt formed mainly via a happy ending, fooling LLMs into jailbreaking either immediately or at a follow-up malicious request. |
Long Chain-of-Thought Fine-tuning via Understanding-to-Reasoning Transition (2025.emnlp-main)
Copied to clipboard
Chenxin An, Zhihui Xie, Xiaonan Li, Ming Zhong, Shansan Gong, Lei Li, Jun Zhang, Jingjing Xu, Lingpeng Kong
| Challenge: | Existing research on long-context scaling in language models has focused on managing lengthy input prompts instead of producing long outputs. |
| Approach: | They propose a sequence-level curriculum learning framework that shifts a model’s focus from interpreting long chain-of-thoughts to generating them. |
| Outcome: | Experiments on rigorous reasoning benchmarks, including AIME24 and GPQA Diamond, show that the proposed approach surpasses standard fine-tuning by over 10% while maintaining robust performance on understanding tasks. |
Leveraging AMR Graph Structure for Better Sequence-to-Sequence AMR Parsing (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent studies on AMR parsing often regard this task as a seq2seq translation problem. |
| Approach: | They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding. |
| Outcome: | The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0. |