Papers by Haibo Feng
Learning to Classify Events from Human Needs Category Descriptions (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Experimental results show that our method outperforms baseline methods, producing substantially better precision. |
| Approach: | They propose a zero-shot learning method that generates weak labels and trains a classifier with weakly labeled data. |
| Outcome: | The proposed method outperforms baseline methods on a human needs categorization task . it produces substantially better precision than baseline methods . |
Learning to Use Tools via Cooperative and Interactive Agents (2024.findings-emnlp)
Copied to clipboard
Zhengliang Shi, Shen Gao, Xiuyi Chen, Yue Feng, Lingyong Yan, Haibo Shi, Dawei Yin, Pengjie Ren, Suzan Verberne, Zhaochun Ren
| Challenge: | Existing methods for large language models (LLMs) use one agent to iterate and execute tools, but they suffer from performance degradation when addressing practical tasks. |
| Approach: | They propose a tool learning framework that coordinates three specialized agents for tool selection, tool execution, and action calibration separately. |
| Outcome: | The proposed framework outperforms baseline models on three datasets with 14% higher success rate. |
IPR: Intelligent Prompt Routing with User-Controlled Quality-Cost Trade-offs (2025.emnlp-industry)
Copied to clipboard
Aosong Feng, Balasubramaniam Srinivasan, Yun Zhou, Zhichao Xu, Kang Zhou, Sheng Guan, Yueyan Chen, Xian Wu, Ninad Kulkarni, Yi Zhang, Zhengyuan Shen, Dmitriy Bespalov, Soumya Smruti Mishra, Yifei Teng, Darren Yow-Bang Wang, Haibo Ding, Lin Lee Cheong
| Challenge: | Existing systems require users to manually select models or employ rigid routing rules that fail to capture the continuous spectrum of query complexity. |
| Approach: | They propose a quality-constrained intelligent prompt routing framework that automatically selects optimal models based on predicted response quality and user-specified tolerance levels. |
| Outcome: | The proposed framework achieves 43.9% cost reduction while maintaining quality parity with strongest model in the Claude family and processes requests with sub-150ms latency. |
Diffusion Language Model Inference with Monte Carlo Tree Search (2026.findings-eacl)
Copied to clipboard
Zheng Huang, Kiran Ramnath, Yueyan Chen, Aosong Feng, Sangmin Woo, Balasubramaniam Srinivasan, Zhichao Xu, Kang Zhou, Shuai Wang, Haibo Ding, Lin Lee Cheong
| Challenge: | Existing methods for inference use heuristics to determine which positions to unmask and which tokens to commit . MEDAL is an inference-time scaling framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Approach: | They propose a framework that integrates Monte Carlo Tree SEarch initialization for Diffusion Language Model inference. |
| Outcome: | The proposed framework achieves 22.0% improvement over existing inference strategies across multiple benchmarks. |
Omni-I2C: A Holistic Benchmark for High-Fidelity Image-to-Code Generation (2026.acl-long)
Copied to clipboard
Jiawei Zhou, Chi Zhang, Xiang Feng, Qiming Zhang, Haibo Qiu, Lihuo He, Dengpan Ye, Xinbo Gao, Jing Zhang
| Challenge: | a benchmark is designed to evaluate the capability of Large Multimodal Models (LMMs) in converting complex, structured digital graphics into executable code. |
| Approach: | They propose a benchmark to evaluate the capability of Large Multimodal Models to convert digital graphics into executable code. |
| Outcome: | The proposed benchmark exposes the performance gap among leading LMMs . the benchmark features 1130 meticulously curated samples . |
GLaRA: Graph-based Labeling Rule Augmentation for Weakly Supervised Named Entity Recognition (2021.eacl-main)
Copied to clipboard
| Challenge: | Named entity recognition (NER) models often need to be trained with many manual labels to perform well. |
| Approach: | They propose to train named entity recognition systems using heuristic labeling rules . they create a graph with nodes representing candidate rules extracted from unlabeled data . |
| Outcome: | The proposed method achieves an average improvement of +20% over the baseline on three NER datasets. |
CreditDecoding: Accelerating Parallel Decoding in Diffusion Large Language Models with Trace Credit (2026.acl-long)
Copied to clipboard
| Challenge: | Diffusion large language models generate text through iterative denoising with bidirectional attention, enabling richer contextual dependencies. |
| Approach: | They propose a training-free parallel decoding method that fuses Trace Credit with current logits to boost the confidence of correct but underconfident tokens. |
| Outcome: | The proposed method achieves 5.48 times speedup with +0.48 accuracy on LLaDA-8B and is orthogonal to mainstream inference optimizations. |
Weakly Supervised Named Entity Tagging with Learnable Logical Rules (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for building entity tagging systems use weak supervision . previous methods focus on disambiguating entity types based on contexts and expert-provided rules . |
| Approach: | They propose a method that bootstraps high-quality logical rules to train a neural tagger in a fully automated manner. |
| Outcome: | The proposed method outperforms weakly supervised methods on three datasets . it rivals state-of-the-art supervised method with lexicon of over 2,000 terms . |