Papers by Bin Ding

13 papers
Reducing Spurious Correlations in Aspect-based Sentiment Analysis with Explanation from Large Language Models (2023.findings-emnlp)

Copied to clipboard

Challenge: Aspect-based sentiment analysis models are susceptible to learning spurious correlations between words . a recent study shows that feature engineering is time-consuming and costly .
Approach: They propose to use a template to prompt LLMs to generate an appropriate explanation for the sentiment polarity of each aspect to reduce spurious correlations.
Outcome: The proposed methods improve ABSA models and their generalization ability.
DevEval: A Manually-Annotated Code Generation Benchmark Aligned with Real-World Code Repositories (2024.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks are poorly aligned with real-world code repositories and are insufficient to evaluate the coding abilities of Large Language Models (LLMs).
Approach: They propose a repository-level benchmark named DevEval to evaluate LLMs' coding abilities in real-world code repositories.
Outcome: The proposed benchmarks show that the LLMs perform better in real-world code repositories than existing benchmarks.
Improving Knowledge Graph Embedding Using Simple Constraints (P18-1)

Copied to clipboard

Challenge: Recent efforts focused on designing more complicated models or incorporating extra information beyond triples.
Approach: They propose to use non-negativity constraints on entity representations and approximate entailment constraints on relation representations to improve KG embedding.
Outcome: The proposed model outperforms baseline models on WordNet, Freebase, and DBpedia.
A Novel Matching Paradigm: Unified Generative and Discriminative LLM with Prompt Compression for Relevance Learning (2026.acl-industry)

Copied to clipboard

Challenge: Existing approaches to matching use Large Language Models as feature extractors, underutilizing their full modeling capabilities.
Approach: They propose a matching paradigm that integrates two-tower, single-towing, and generative tasks within a unified LLM framework via attention-mask partitioning.
Outcome: The proposed model achieves superior performance and strong practical value in an industrial search engine.
StraGo: Harnessing Strategic Guidance for Prompt Optimization (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for prompt optimization often lead to prompt drifting, wherein newly generated prompts canadversely impact previously successful cases while addressing failures.
Approach: They propose a method to mitigate prompt drifting by integrating in-context learning to formulate specific, actionable strategies for prompt optimization.
Outcome: The proposed approach mitigates prompt drifting by leveraging insights from both successful and failed cases to identify critical factors for achieving optimization objectives.
Non-Autoregressive Sentence Ordering (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing sentence ordering approaches only leverage unilateral dependencies during decoding and cannot fully explore the semantic dependency between sentences.
Approach: They propose a non-autoregressive ordering network that explores bilateral dependencies between sentences and predicts sentences for each position in parallel.
Outcome: The proposed model outperforms existing autoregressive sentence ordering approaches and yields competitive performance compared with the state-of-the-arts.
WikiSeeker: Rethinking the Role of Vision-Language Models in Knowledge-Based Visual Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for Knowledge-Based Visual Question Answering rely on images as the retrieval key, and often overlook or misplace the role of Vision-Language Models (VLMs)
Approach: They propose a multi-modal RAG framework that assigns VLMs two specialized agents: a Refiner and an Inspector.
Outcome: Experiments on EVQA, InfoSeek, and M2KR show that the proposed framework achieves state-of-the-art performance with significant improvements in both retrieval accuracy and answer quality.
ProActor: Timing-Aware Reinforcement Learning for Proactive Task Scheduling Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to measuring and optimizing proactive task-oriented agents lack generalizable end-to-end solutions.
Approach: They propose a framework for conversational task scheduling that integrates proactiveness reinforcement learning with a domain-agnostic annotation methodology.
Outcome: The proposed framework enables scalable proactiveness reinforcement learning (RL) Experiments on two newly auto-annotated datasets demonstrate significant improvements in proactive timing while maintaining action consistency comparable to state-of-the-art baselines.
Beyond Code Pairs: Dialogue-Based Data Generation for LLM Code Translation (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable capabilities in code translation, yet their performance deteriorates in low-resource programming domains such as Fortran and emerging frameworks like CUDA .
Approach: They propose a dual-LLM Questioner–Solver pipeline that integrates external knowledge from compilers and runtime feedback to generate verified translations and multi-turn dialogues.
Outcome: The proposed model outperforms proprietary models on key metrics like compilation success and accuracy.
AMPO: Automatic Multi-Branched Prompt Optimization (2024.emnlp-main)

Copied to clipboard

Challenge: Existing prompt engineering techniques are limited to producing single flow instructions, struggling with handling diverse patterns.
Approach: They propose an automatic prompt optimization method that iteratively develops a multi-branched prompt using failure cases as feedback.
Outcome: The proposed method achieves the best results across five tasks and demonstrates significant optimization efficiency due to adoption of a minimal search strategy.
Boosting LLM’s Molecular Structure Elucidation with Knowledge Enhanced Tree Search Reasoning (2025.acl-long)

Copied to clipboard

Challenge: Molecular structure elucidation involves deducing a molecule’s structure from various types of spectral data, which is crucial in chemical experimental analysis.
Approach: They propose a Knowledge-enhanced reasoning framework for Molecular Structure Elucidation that leverages Monte Carlo Tree Search for test-time scaling as a plugin to extend the LLMs’ coverage of the chemical structure space.
Outcome: The proposed framework significantly improves on both GPT-4o-mini and GPT4o, and a specialized molecule-spectrum scorer improves performance.
In-Context Example Retrieval from Multi-Perspectives for Few-Shot Aspect-Based Sentiment Analysis (2024.lrec-main)

Copied to clipboard

Challenge: Existing approaches to solve few-shot aspect-based sentiment analysis (ABSA) are suboptimal for this task because of in-context examples .
Approach: They propose to retrieve in-context examples for few-shot aspect-based sentiment analysis . they construct positive and negative pairs from three perspectives and train the retriever .
Outcome: The proposed retrieval framework outperforms baselines on four ABSA datasets.
SeaEval for Multilingual Foundation Models: From Cross-Lingual Alignment to Cultural Reasoning (2024.naacl-long)

Copied to clipboard

Challenge: a new benchmark for multilingual foundation models is being developed . brittleness of foundation models in the dimensions of semantics and multilinguality is a key limitation .
Approach: They propose a benchmark for multilingual foundation models, SeaEval . they examine how well these models comprehend cultural practices, nuances, and values .
Outcome: The proposed model can be used to evaluate multilingual and multicultural scenarios.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations