Papers by Haoyu Wang
Copied to clipboard
| Challenge: | Existing approaches to RAG neglect system state variables, resulting in poor performance and erroneous knowledge accumulation. |
| Approach: | They propose a framework that incorporates a Turing Complete System to manage state variables and manage retrieval halting. |
| Outcome: | The proposed framework improves on seven real-world healthcare datasets and shows that it is more accurate than existing methods. |
Copied to clipboard
| Challenge: | Existing approaches to extract multiple relations from a paragraph require multiple passes over the paragraph. |
| Approach: | They propose a method to extract multiple relations from a paragraph by encoding the paragraph only once. |
| Outcome: | The proposed approach can perform state-of-the-art on the benchmark ACE 2005. |
Copied to clipboard
| Challenge: | Existing methods for grounding video frames with dense annotations require enormous amount of human effort. |
| Approach: | They propose to ground natural language in video frames with only one frame labeled . they propose an end-to-end model that eliminates interference of irrelevant frames . |
| Outcome: | The proposed model can ground natural language in all video frames with only one frame labeled . the proposed model eliminates interference of irrelevant frames based on branch search and cropping techniques . |
Copied to clipboard
| Challenge: | In this work, we focus on the semantic classification of events in context to help machines gain a deeper understanding of events. |
| Approach: | They propose to integrate event semantics into downstream tasks to help machines understand events better. |
| Outcome: | The proposed model improves the understanding of events in context. |
Copied to clipboard
| Challenge: | Indirect Prompt Injection attacks can be exploited by LLMs that are embedded with external data. |
| Approach: | They propose a detection-based approach that leverages the behavioral states of LLMs to identify potential IPI attacks. |
| Outcome: | The proposed approach reduces the success rate of attacks to 0.03% on the BIPIA benchmark. |
Copied to clipboard
| Challenge: | Existing approaches to reduce memory footprint of long-context LLMs rely on RoPE-induced oscillations. |
| Approach: | They propose a frequency-domain framework that converts RoPE-induced oscillations into sparse spectral representations. |
| Outcome: | The proposed framework achieves efficient compression with performance comparable to FP16 benchmarks. |
Copied to clipboard
| Challenge: | Despite advances in training Large Language Models, they remain vulnerable to jailbreak, an adversarial attack method. |
| Approach: | They propose an adversarial jailbreak algorithm that exploits the gradient information of the suffix tokens to accelerate the optimization process. |
| Outcome: | The proposed model achieves 1.5x speedup while maintaining high attack success rates. |
Copied to clipboard
| Challenge: | Existing models of event processing do not understand the essentiality of step events towards a goal event. |
| Approach: | They propose to deconstruct a goal event into a discrete representation of finer-grained (step) events, which are not equally important to the goal. |
| Outcome: | The proposed model can understand the essentiality of different step events towards a goal event. |
Copied to clipboard
| Challenge: | Existing methods for textual and structural retrieval ignore mutual reinforcement and only use structural retrievals for text-rich Graph Knowledge Bases (TG-KBs). |
| Approach: | They propose a Mixture of Structural-and-Textual Retrieval to retrieve textual and structural knowledge via a Planning-Reasoning-Organizing framework. |
| Outcome: | Experiments show that the proposed framework performs better than existing methods in analyzing TG-KBs and integrating structural trajectories for candidate reranking. |
Copied to clipboard
| Challenge: | Retrieval-augmented Large Language Models struggle with complex inputs and noisy knowledge retrieval hindering model effectiveness. |
| Approach: | They propose a query generation method that integrates query generation blending with knowledge filtering to enhance retrieval-augmented LLMs. |
| Outcome: | The proposed approach surpasses state-of-the-art benchmarks on open-domain question answering benchmarks. |
Copied to clipboard
| Challenge: | Existing methods for OOD detection and ID classification tasks require massive amounts of ID labeled data and no OOD labeles. |
| Approach: | They propose to use OOD-resistant Prototypical Network to detect OOD cases with limited in-domain (ID) training data to solve this task. |
| Outcome: | The proposed solution outperforms state-of-the-art methods in zero-shot OOD detection task while maintaining a competitive performance on ID classification task. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive performance but face high computational costs and latency, limiting their deployment in resource-constrained settings. |
| Approach: | They propose a robust RAG framework for large language models via Margin-aware Preference Optimization to enhance the accuracy and reliability of SLMs. |
| Outcome: | The proposed framework surpasses state-of-the-art benchmarks on three open-domain question answering tasks. |
Copied to clipboard
| Challenge: | Multi-modal Large Language Models (MLLMs) exhibit limited generality and often fall short when compared to specialized models. |
| Approach: | They propose a multi-modal medical agent that picks the most suitable medical tools based on user inputs. |
| Outcome: | The proposed agent performs better than open-source models and the closed-source model, GPT-4o. |
Copied to clipboard
| Challenge: | Generating high-quality long-form survey articles poses significant challenges to AI Agent systems. |
| Approach: | They propose a hierarchically modular agent system for long-form survey generation . they use atomic models to implement skeleton initialization, digest construction, and skelet refinement . human evaluations demonstrate system surpasses representative baselines . |
| Outcome: | The proposed system surpasses representative baselines in both content depth and length, highlighting the strength of MCP-based modular planning. |
Copied to clipboard
| Challenge: | Existing models for multihop reasoning are limited in their performance . multi-hop reasoning requires the ability to gather information from multiple passages . |
| Approach: | They propose a method that provides the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
| Outcome: | The proposed model improves on existing models by providing the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
Copied to clipboard
| Challenge: | Recent work grouped granular events into more general events, called complex events . however, this approach assumes that a given complex event is always described in consecutive sentences . |
| Approach: | They propose a context-augmented representation learning approach that uses contextual information to model pairwise relation between granular events. |
| Outcome: | The proposed approach outperforms baselines on the complex event identification task. |
Copied to clipboard
| Challenge: | Multimodal Sentiment Analysis (MSA) is effective when using rich information from multiple sources, but the potential sentiment-irrelevant information across modalities may hinder the performance from being further improved. |
| Approach: | They propose an Adaptive Language-guided Multimodal Transformer (ALMT) that learns an irrelevance/conflict-suppressing representation from visual and audio features under guidance of language features at different scales. |
| Outcome: | The proposed model achieves state-of-the-art on several popular datasets and an abundance of ablation shows the effectiveness of the proposed model. |
Copied to clipboard
| Challenge: | Large language models suffer from knowledge gaps and hallucinations, resulting in incorrect or poor reasoning. |
| Approach: | They propose Graph retrieval-augmented generation (GraphRAG) which integrates structured knowledge from external graphs to enhance model's reasoning. |
| Outcome: | Experiments on knowledge graph QA tasks show that GraphRAG significantly improves reasoning performance across multiple backbone models. |
Copied to clipboard
| Challenge: | Evaluating the performance of LLMs in multi-turn interactions presents significant challenges due to the complexity and variability of user behavior. |
| Approach: | They propose a benchmark framework for assessing LLMs’ function-calling capabilities in multi-turn dialogues. |
| Outcome: | The proposed framework is based on a dataset derived from popular mobile apps and anonymized user logs. |
Copied to clipboard
| Challenge: | We present a new information extraction system that can construct temporal event graphs from news documents. |
| Approach: | They propose a temporal event graph extraction system that can extract news documents . they extend the system from sentence-level event extraction to cross-document cross-media event extraction . |
| Outcome: | The proposed system can extract temporal event graphs from news documents in multiple languages and multiple data modalities. |
Copied to clipboard
| Challenge: | Existing methods for evaluating curiosity-like behaviors in large language models lack curiosity-inspired features. |
| Approach: | They propose a psychology-inspired framework to evaluate curiosity in large language models . they adapt the Five-Dimensional Curiosity scale Revised (5DCR) to LLMs . |
| Outcome: | The proposed framework evaluates curiosity in large language models using questionnaires and behavioral studies. |
Copied to clipboard
| Challenge: | Existing methods for event prediction are incomplete and noisy. |
| Approach: | They propose to use news-related event schemas to extract newsworthy events . they build a demo website and include a video demonstrating the framework . |
| Outcome: | The proposed framework can be applied to a wide variety of newsworthy scenarios. |
Copied to clipboard
| Challenge: | Existing methods to exit pre-trained language models suffer from the limitation that they have to sequentially traverse through all layers prior to the selected exit layer, which degrades their performance. |
| Approach: | They propose a homotopic and adaptive layer skipping fine-tuning method that adaptively selects the layers to skip based on a predefined budget. |
| Outcome: | The proposed method outperforms all state-of-the-art baselines on the GLUE benchmark and shows that it is highly efficient. |
Copied to clipboard
| Challenge: | Existing large language models focus on causal coherence, neglecting the complex story arcs and orchestration inherent in human narratives. |
| Approach: | They propose a high-dimensional framework for narrative orchestration that unifies human and model perspectives while jointly characterizing narrative function and structure in a common space. |
| Outcome: | The proposed framework unifies human and model perspectives while jointly characterizing narrative function and structure in a common space. |
Copied to clipboard
| Challenge: | Existing methods for paraphrase identification (PI) are limited due to lack of professional knowledge. |
| Approach: | They propose to leverage Wikipedia knowledge to accurately identify paraphrases by mining outline knowledge of given sentences from Wikipedia. |
| Outcome: | The proposed framework outperforms state-of-the-art models on two public datasets: PARADE and clinicalSTS2019. |
Copied to clipboard
| Challenge: | Existing speech-text pre-training methods are limited to one or two specific tasks, despite their success in speech-language processing tasks. |
| Approach: | They propose a temporal position prediction task to capture the speech-text alignment . they use a textual dialog pre-training task to generalize a response selection task . |
| Outcome: | The proposed model is superior in learning speech-text alignment and multi-turn dialog context. |
Copied to clipboard
| Challenge: | Existing FET noise learning methods rely on prediction distributions in instance-independent manner, which causes confirmation bias. |
| Approach: | They propose a clustering-based loss correction framework to address confirmation bias in FET . they first train a coarse backbone model as a feature extractor and noise estimator . |
| Outcome: | The proposed framework achieves the best performance over existing systems on three public datasets and is stable to hyperparameters. |
Copied to clipboard
| Challenge: | Large language models (LLMs) produce outdated or inaccurate content. Updating their knowledge efficiently and accurately without costly retraining is a major challenge. |
| Approach: | They propose a robust and scalable method that treats knowledge control as interventions within the model’s representation space. |
| Outcome: | The proposed method achieves fine-grained control over complex, unstructured knowledge while maintaining general utility with frozen base weights. |
Copied to clipboard
| Challenge: | Existing persona-based dialogue models use crowd-sourced data, such as the PersonaChat . however, the cost of such datasets is limited, and the model is not robust. |
| Approach: | They propose to disentangle persona-based dialogue generation into two sub-tasks by using a BERT-over-BERT model. |
| Outcome: | The proposed model outperforms baselines in response quality and persona consistency under different limited data settings. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained language models overlook intrinsic semantic associations between soft prompt tokens, leading to high discreteness and limited interactions. |
| Approach: | They propose a low-parameters Prompt Tuning method which leverages prompt decomposition and compressed outer product to facilitate multiple interactions among prompt tokens. |
| Outcome: | Experiments on six architectures and eight datasets show that the proposed method outperforms state-of-the-art methods in performance and efficiency. |
Copied to clipboard
| Challenge: | Recent efforts to learn explainable legal case retrieval models fail to provide faithful and interpretable explanations for legal cases. |
| Approach: | They propose a framework that uses logic rules to explain legal case retrieval results . they extend benchmarks of LeCaRD and ELAM with manually annotated logic rules . |
| Outcome: | The proposed framework is able to provide faithful explanations for legal case retrieval. |
Copied to clipboard
| Challenge: | Pre-trained language models have strong generalizability, but fine-tuning involves updating all parameters, rendering full fine-uning resource-intensive. |
| Approach: | They propose a parameter-efficient fine-tuning method that updates all pre-trained parameters during inference. |
| Outcome: | The proposed method outperforms baseline methods on five benchmarks across 20 datasets. |
Copied to clipboard
| Challenge: | Understanding natural language involves recognizing how multiple event mentions structurally and temporally interact with each other. |
| Approach: | They propose a joint constrained learning framework that enforces logical constraints within and across multiple temporal and subevent relations of events by converting constraints into differentiable learning objectives. |
| Outcome: | The proposed framework outperforms SOTA methods on benchmarks for temporal relation extraction and event hierarchy construction. |
Copied to clipboard
| Challenge: | Text-to-speech (TTS) models have been developed to generate high-quality speech. |
| Approach: | They propose an end-to-end TTS model that integrates large self-supervised speech models and conditional flow matching to model prosodic features effectively. |
| Outcome: | The proposed model improves synthesis quality and efficiency compared to existing models, showing that it generates more prosodic and expressive speech synthesizing. |
Copied to clipboard
| Challenge: | Existing methods that ignore the decompositionality of complex questions are not suitable for complex question semantic parsing. |
| Approach: | They propose a hierarchical semantic parsing method which utilizes the decompositionality of complex questions for semantic paring. |
| Outcome: | The proposed method improves on a large scale complex question semantic parsing dataset. |
Copied to clipboard
| Challenge: | Existing methods for enhancing large language models (LLMs) have achieved some success, but their knowledge understanding and memory capacity significantly degrades after extensive editing. |
| Approach: | They propose a method that stores the basis vectors of the representation space of past edits in a knowledge cache and projects the gradient of the current edit onto a space orthogonal to previous knowledge for updating. |
| Outcome: | The proposed method improves question-answering ability and hallucination mitigation by 14% and 61% for large language models after 3,000 edits. |
Copied to clipboard
| Challenge: | Existing studies on improving attribute consistency focus on incorporating attribute information in responses, but few efforts have identified the consistency relations between response and attribute profile. |
| Approach: | They propose a key-value structure information enriched BERT model to identify the profile consistency . they propose to incorporate attribute information into the generated responses . |
| Outcome: | The proposed model improves over strong baselines on downstream tasks. |
Copied to clipboard
| Challenge: | Embodied question answering requires collecting context that is distributed across multiple viewpoints . most recent vision–language models (VLMs) are constrained to a fixed and finite set of input views . |
| Approach: | They propose a training-free, test-time reasoning framework that transforms a VLM into an active viewpoint reasoner through a coarse-to-fine exploration process. |
| Outcome: | The proposed framework improves LLM-Match performance by 11.98% on four mainstream VLMs. |
Copied to clipboard
| Challenge: | Existing temporal reasoning models drop to random guessing on TODAY, suggesting that they heavily rely on spurious information rather than proper reasoning for temporal predictions. |
| Approach: | They propose a task called TODAY that evaluates whether systems can correctly understand the effect of incremental changes in temporal relation distributions. |
| Outcome: | The proposed task outperforms existing models, including GPT-3.5, on in-domain benchmarks while allowing for more appropriate annotations. |
Copied to clipboard
| Challenge: | Event mentions in text correspond to real-world events of varying degrees of granularity . task of subevent detection aims to resolve this granulem issue by recognizing membership of events . |
| Approach: | They propose a task of event-based text segmentation as an auxiliary task to improve learning for subevent detection. |
| Outcome: | The proposed method outperforms baseline methods on subevent detection, HiEve and IC datasets while achieving decent performance on EventSeg prediction. |
Copied to clipboard
| Challenge: | Existing studies on table reasoning focus on flat tables and hierarchical tables . a new dataset, HiTab, aims to examine numerical reasoning over hierarchic tables based on hierarchically structured tables - a strong challenge for existing baselines and a valuable benchmark for future research. |
| Approach: | They propose a hierarchical question answering and natural language generation dataset to study hierarchic tables. |
| Outcome: | The proposed model shows that it is effective in QA and natural language generation over hierarchical tables. |
Copied to clipboard
| Challenge: | Clinical trials are expensive and time-consuming, and accurate trial prediction is key to advancing medical treatments. |
| Approach: | They propose a framework that combines reasoning capabilities of large language models with the explainability of classical machine learning to generate, evaluate, and refine tabular features without human input. |
| Outcome: | The proposed framework performs better than SOTA methods on clinical trial prediction tasks within a limited number of iterations. |
Copied to clipboard
| Challenge: | In multi-party chat, it is common for multiple conversations to occur concurrently . a new model that automatically disentangles conversation threads is proposed . |
| Approach: | They propose a Context-Aware Thread Detection model that automatically disentangles conversation threads in chat logs. |
| Outcome: | The proposed model outperforms state-of-the-art models on four real-world chat logs. |
Copied to clipboard
| Challenge: | Autoregressive language models excel in text-to-audio generation, but lag behind diffusion models by a non-trivial margin. |
| Approach: | They propose a framework that integrates multiple isolated transformers with causal conditioning and anti-causal alignment via reinforcement learning. |
| Outcome: | The proposed framework outperforms existing LM-based and diffusion-based systems in audio synthesis. |
Copied to clipboard
| Challenge: | Existing persona-based dialogue models generate human-like responses but can hardly avoid the generation of inconsistent persona words. |
| Approach: | They propose a framework that deletes inconsistent words from a generated response prototype and further rewrites it to a personality-consistent one. |
| Outcome: | The proposed framework achieves good performance on the persona-chat dataset. |
Copied to clipboard
| Challenge: | Introspection-driven approach equips LLM agents with introspection, enhancing consistency and adaptability in solving complex tasks. |
| Approach: | They propose a zero-shot approach that equips LLM agents with introspection, enhancing consistency and adaptability in solving complex tasks. |
| Outcome: | The proposed approach improves performance and efficiency by reducing the number of trials and plan revisions by 45%. |
Copied to clipboard
| Challenge: | Existing approaches to event causality identification have primarily utilized linguistic patterns and multi-hop relational inference, risking false causality . |
| Approach: | They propose to use the Rubin Causal Model to identify event causality by generating a twin from existing corpora. |
| Outcome: | The proposed method can identify causal relations more robustly than previous methods, including GPT-4, which is demonstrated on a causality benchmark, COPES-hard. |
Copied to clipboard
| Challenge: | a new approach to event processing uses large language models to generate source documents that can be curated without manual data collection. |
| Approach: | They propose a framework that generates a graphical representation of events in documents . they show that the model is more complete than previous supervised methods . |
| Outcome: | The proposed model is more complete than human-curated schemas in most scenarios. |
Copied to clipboard
| Challenge: | Existing work on event understanding is focusing on procedural (or horizontal) tasks such as predicting the next event given an observed sequence. |
| Approach: | They propose an Analogous Process Structure Induction framework which leverages analogies among processes and conceptualization of sub-event instances to predict the whole sub- sequence of previously unseen open-domain processes. |
| Outcome: | The proposed framework can predict the whole sub-event sequence of previously unseen open-domain processes. |
Copied to clipboard
| Challenge: | Existing approaches to learn cross-lingual models require limited data to perform cross-linguistic tasks. |
| Approach: | They propose a method to remove language-associated information via minimizing representation coding rate reduction. |
| Outcome: | The proposed model outperforms state-of-the-art models on cross-lingual tasks. |
Copied to clipboard
| Challenge: | Existing methods for evaluating expressive speech focus on word accuracy, naturalness, signal quality, or emotional intensity at the utterance level. |
| Approach: | They propose a framework for Evaluating Expressive Appropriateness in speech that assesses whether a speech sample aligns with the underlying communicative intent implied by its discourse-level narrative context. |
| Outcome: | The proposed framework outperforms existing speech evaluation and analysis systems on a human-annotated test set. |
Copied to clipboard
| Challenge: | Open-source large language models (LLMs) have gained strength across diverse fields, but the majority of studies focus on English. |
| Approach: | They propose a knowledge-grounded data augmentation approach to elicit more language-specific knowledge of LLMs by enhancing their ability to serve users from different countries. |
| Outcome: | The proposed method can prune the language-agnostic supervised fine-tuning dataset without any performance degradation. |
Copied to clipboard
| Challenge: | Existing reward models rely on scalar or pairwise judgments that fail to capture multifaceted nature of human preferences. |
| Approach: | They propose a rubric-based reward model that uses a large collection of prompt, rubric pairs to generate a scalar score or preference label for each response. |
| Outcome: | The proposed model surpasses strong size-matched baselines by 8.4% across multiple benchmarks. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) enhances large language models by integrating external knowledge retrieved at inference time. |
| Approach: | They evaluate RAG systems using MassiveDS, a large-scale datastore with mixture of knowledge. |
| Outcome: | The proposed approach improves performance on knowledge-intensive NLP tasks. |
Copied to clipboard
| Challenge: | In-context learning has been validated in large language models, but the mechanism and selection strategy for in-cont example selection lacks systematic and in-depth research. |
| Approach: | They propose a data compression approach to select in-context examples using large language models. |
| Outcome: | The proposed method shows a significant improvement of 5.90% across five real-world datasets using four language models. |
Copied to clipboard
| Challenge: | Existing work on event extraction relies on labor-intensive annotation, ignoring semantic meaning of event types' labels. |
| Approach: | They propose a zero-shot event extraction approach that first identifies events with existing tools and then maps them to a given taxonomy of event types in a no-shot manner. |
| Outcome: | The proposed approach doubles the performance of previous approaches on a ACE-2005 dataset . it leverages label representations induced by pre-trained language models and maps events to the target types . |
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved remarkable performance on various NLP tasks, yet their potential in more challenging task like finance, has not been fully explored. |
| Approach: | They propose a benchmark to assess the financial knowledge of large language models (LLMs) in China. |
| Outcome: | The proposed benchmark is the most comprehensive evaluation benchmark to date for LLMs in finance. |
Copied to clipboard
| Challenge: | Existing studies have focused on extending the context length of large language models (LLMs) due to their quadratic computational complexity and a lack of high-quality long training examples, most LLMs are trained with a limited window size. |
| Approach: | They propose a training-free framework that enables large language models to effectively process long texts using a divide-and-conquer strategy for comprehensive document understanding. |
| Outcome: | The proposed framework outperforms open-source and commercial long-context LLMs and is compatible with several models. |
Copied to clipboard
| Challenge: | Existing models for event temporal relation extraction are based on data-driven machine learning . however, TEMPREL extraction is not accurate under distribution shifts. |
| Approach: | They propose to conduct counterfactual analysis to attenuate the effects of two types of training biases: the event trigger bias and the frequent label bias. |
| Outcome: | The proposed model extracts TempRel and timelines more faithfully compared to SOTA methods . it is based on two perspectives: one is to extract genuinely based upon contextual description . the other is to provide proper uncertainty estimation and abstain from extraction when no relation is described in the text . |
Copied to clipboard
| Challenge: | Existing approaches to code generation fail to consider the quality of retrieved examples. |
| Approach: | They propose a retrieval-augmented generation method that combines existing API examples to improve complexity and readability. |
| Outcome: | The proposed method achieves up to 22% accuracy improvement over baseline methods. |
Copied to clipboard
| Challenge: | Existing methods for few-shot learning are insufficient to capture task variations in natural language domains. |
| Approach: | They propose an adaptive metric learning approach that automatically determines the best weighted combination from a set of metrics obtained from meta-training tasks for a newly seen few-shot task. |
| Outcome: | The proposed method performs favorably against state-of-the-art few shot learning algorithms on real-world sentiment analysis and dialog intent classification datasets. |