Papers by Mingyi Hong
LUME: LLM Unlearning with Multitask Evaluations (2025.findings-emnlp)
Copied to clipboard
Anil Ramakrishna, Yixin Wan, Xiaomeng Jin, Kai-Wei Chang, Zhiqi Bu, Bhanukiran Vinzamuri, Volkan Cevher, Mingyi Hong, Rahul Gupta
| Challenge: | Unlearning aims to remove copyrighted, sensitive, or private content from large language models without a full retraining. |
| Approach: | They propose a multi-task unlearning benchmark LUME that unlearns short novels, biographies and public biographie . |
| Outcome: | The proposed benchmark unlearns short novels, biographies and public biographie . it also releases fine-tuned models with 1B and 7B parameter sizes as targets . |
Split-Merge: Scalable and Memory-Efficient Merging of Expert LLMs (2025.emnlp-main)
Copied to clipboard
| Challenge: | a zero-shot merging framework for large language models consolidates specialized domain experts into a single model without any further training. |
| Approach: | They propose a zero-shot merging framework that consolidates specialized domain experts into a single model without further training. |
| Outcome: | Experiments on code generation, mathematical reasoning, medical question answering, and instruction-following benchmarks confirm the versatility and effectiveness of the proposed framework. |
AssistedDS: Benchmarking How External Domain Knowledge Assists LLMs in Automated Data Science (2025.findings-emnlp)
Copied to clipboard
An Luo, Xun Xian, Jin Du, Fangqiao Tian, Ganghua Wang, Ming Zhong, Shengchun Zhao, Xuan Bi, Zirui Liu, Jiawei Zhou, Jayanth Srinivasa, Ashish Kundu, Charles Fleming, Mingyi Hong, Jie Ding
| Challenge: | Large language models (LLMs) have advanced the automation of data science workflows, yet it remains unclear whether they can critically leverage external domain knowledge as human data scientists do in practice. |
| Approach: | They propose a benchmark to evaluate how large language models handle external domain knowledge in tabular prediction tasks. |
| Outcome: | The proposed model evaluates whether it can critically leverage external domain knowledge as human data scientists do in practice. |
Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate (2025.naacl-long)
Copied to clipboard
Xiaomeng Jin, Zhiqi Bu, Bhanukiran Vinzamuri, Anil Ramakrishna, Kai-Wei Chang, Volkan Cevher, Mingyi Hong
| Challenge: | Existing methods to remove unwanted knowledge from large language models are formulated as minimizing memorization through the loss of the model. |
| Approach: | They propose a normalized gradient difference algorithm that optimizes a forgetting objective and an automatic learning rate scheduler that allows for better control over the trade-off between the objectives. |
| Outcome: | The proposed method improves on TOFU and MUSE datasets while exhibiting stable training. |
Scaling Unverifiable Rewards: A Case Study on Visual Insights (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to scale complex, open-ended tasks with unverifiable rewards are not scalable to multi-stage pipelines. |
| Approach: | They propose a process-based refinement framework that scales inference across stages of a multi-agent pipeline, instead of refining a single output over time. |
| Outcome: | The proposed framework scales inference across stages of a multi-agent pipeline, instead of refining a single output over time as in prior work. |
BrowseComp-Plus: A Fair and Disentangled Evaluation Benchmark for Deep Search Agents (2026.acl-long)
Copied to clipboard
Zijian Chen, Xueguang Ma, Shengyao Zhuang, Ping Nie, Kai Zou, Sahel Sharifymoghaddam, Andrew Liu, Joshua Green, Kshama Patel, Ruoxi Meng, Mingyi Su, Yanxi Li, Haoran Hong, Xinyu Shi, Xuye Liu, Hosna Oyarhoseini, Nandan Thakur, Crystina Zhang, Luyu Gao, Wenhu Chen, Jimmy Lin
| Challenge: | Existing benchmarks for deep search agents rely on blackbox web search APIs . dynamic and opaque web APIs hinder reproducibility and fair comparisons - authors . |
| Approach: | They propose a benchmark that employs a fixed corpus for controlled retrieval for deep search agents. |
| Outcome: | The new benchmark shows that agents that combine large language models with retrieval tools excel at complex, reasoning-intensive queries. |
BLUR: A Bi-Level Optimization Approach for LLM Unlearning (2026.eacl-long)
Copied to clipboard
Hadi Reisizadeh, Jinghan Jia, Zhiqi Bu, Bhanukiran Vinzamuri, Anil Ramakrishna, Kai-Wei Chang, Volkan Cevher, Sijia Liu, Mingyi Hong
| Challenge: | Existing algorithms to unlearn knowledge and capabilities from large datasets are unclear how to best formulate the unlearning problem. |
| Approach: | They propose to model the hierarchical structure of the unlearning problem, where the forget problem takes priority over the retain problem, and propose an algorithm that aims to unlearn knowledge and capabilities. |
| Outcome: | The proposed algorithm outperforms all state-of-the-art algorithms across unlearning tasks, models, and metrics. |