Papers by Jie Hao
Copied to clipboard
| Challenge: | Existing approaches to mathematical reasoning rely on static heuristics or pre-determined reasoning strategies. |
| Approach: | They propose an adaptive framework that integrates fuzzy theory into LLM-based mathematical reasoning. |
| Outcome: | The proposed framework outperforms state-of-the-art models while offering effective and interpretable diagnostics of intermediate problem-solving states. |
Copied to clipboard
| Challenge: | OpenWebAgent integrates large language models and large multimodal models to improve web automation. |
| Approach: | They propose to integrate large language models and large multimodal models into an open toolkit to optimize web automation. |
| Outcome: | The open toolkit integrates both large language models (LLMs) and large multimodal models (LMMs) it enables the development of powerful, task-oriented web agents, significantly enhancing user experience and operational efficiency on the web. |
Copied to clipboard
| Challenge: | Large-scale conversational AI agents such as Alexa, Siri, and Google Assistant are becoming increasingly popular in real-world applications to assist users in daily life. |
| Approach: | They propose a unified contextual query rewriting model that unifies QR for friction reduction and contextual carryover . they leverage the text-to-text unified framework which uses independent tasks with weighted loss to account for task importance . |
| Outcome: | The proposed model reduces friction and contextual carryover by using multiple auxiliary tasks. |
Copied to clipboard
| Challenge: | Recent studies have shown that a hybrid of self-attention networks (SANs) and recurrent neural networks (RNNs) outperforms both individual architectures, while not much is known about why the hybrid models work. |
| Approach: | They propose to use an advanced variant of self-attention networks (SANs) to enhance the strength of hybrid models by introducing a syntax-oriented inductive bias to perform tree-like composition. |
| Outcome: | The proposed model outperforms both individual models and a standard hybrid model on a machine translation task. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been used to evaluate the safety of their users . however, evaluation questions in current benchmarks are too straightforward and difficult to update with practical relevance due to their lack of correlation with real-world events. |
| Approach: | They propose a question-generation framework to evaluate the safety of LLMs in the Chinese context. |
| Outcome: | The proposed framework reduces decline rate while maintaining similar attack success rate. |
Copied to clipboard
| Challenge: | Existing methods to fine-tune pre-trained language models (PLMs) are not safe, since the fine-uning process is invisible to the user. |
| Approach: | They propose a technique to study the dynamic process of fine-tuning for finding poisonous dimensions using diffusion theory. |
| Outcome: | The proposed approach can detect poisonous dimensions with abnormal dynamics, purify them and fine-tune them on a clean dataset. |
Copied to clipboard
| Challenge: | Existing datasets for event understanding have limited coverage due to complexity of tasks. |
| Approach: | They propose a dataset that augments MAVEN datasets with event argument annotations . they propose 98,591 events and 290,613 arguments obtained with laborious human annotation . |
| Outcome: | The proposed dataset is the first all-in-one dataset supporting event detection, event argument extraction, and event relation extraction. |
Copied to clipboard
| Challenge: | Existing methods for extracting relational facts from text have been successful . but with explosion of Web text, human knowledge is increasing drastically . |
| Approach: | They propose to improve relation extraction methods to extract relational facts from text . they analyze existing methods and show promising directions towards more powerful RE . |
| Outcome: | The proposed methods can extract relational facts from text, but they are still lacking in the current field. |
Copied to clipboard
| Challenge: | Existing studies show that the lack of recurrence modeling hinders the development of a translation model. |
| Approach: | They propose to model recurrence for Transformer with an additional recurrent encoder. |
| Outcome: | The proposed model outperforms the deep model on EnglishGerman and ChineseEnglish translation tasks. |
Copied to clipboard
| Challenge: | Recent advances in pre-training and fine-tuning methods have drastically reshaped the landscape of natural language processing research. |
| Approach: | They propose a lightweight BERT model that introduces sparse block structures into the attention matrix to reduce memory consumption and training/inference time. |
| Outcome: | The proposed model uses 18.7-36.1% less memory and 12.0-25.1% more time to learn compared to an advanced BERT-based model, RoBERTa. |
Copied to clipboard
| Challenge: | Existing methods for enhancing performance through increased use of expert knowledge often result in diminishing sparsity during expert selection. |
| Approach: | They propose a framework that integrates the computational processes of MoE with the concept of knowledge transferring in multi-task learning. |
| Outcome: | The proposed framework outperforms existing methods under identical conditions concerning the number of experts. |
Copied to clipboard
| Challenge: | Existing reference-free metrics have obvious limitations for evaluating controlled text generation models. |
| Approach: | They propose an unsupervised reference-free metric which evaluates controlled text generation from different aspects by formulating each aspect into multiple text infilling tasks. |
| Outcome: | The proposed metric has higher correlations with human judgments while obtaining better generalization of evaluating generated texts from different models and with different qualities. |
Copied to clipboard
| Challenge: | Experimental results demonstrate the superior performance of our method. |
| Approach: | They propose to leverage conditional variational mechanism to simplify pinyin IME . they employ a strategy that facilitates interaction between pinyan and Chinese character information . |
| Outcome: | The proposed method improves the performance of pinyin input method engine (IME) under low-resource conditions. |
Copied to clipboard
| Challenge: | Long-context inference is crucial for advancing large language models, but its prefill speed remains a bottleneck. |
| Approach: | They propose an efficient long-context inference framework that leverages multi-host approximate attention to enhance prefill speed. |
| Outcome: | The proposed framework achieves speedups of 9.2, 4.2, and 1.6 without any degradation in performance. |
Copied to clipboard
| Challenge: | Existing benchmarks on punchline comprehension suffer from language shortcuts that allow models to rely on text, lack of question diversity, and narrow focus on a specific domain of multimodal content. |
| Approach: | They propose a multimodal punchline comprehension benchmark to assess models' ability to comprehend punchlines. |
| Outcome: | The proposed model surpasses in-context learning and chain-of-thought in punchline comprehension. |
Copied to clipboard
| Challenge: | Existing prompting methods struggle with complex tasks and reasoning stability, limiting their practical deployment. |
| Approach: | They propose a framework that adaptively balances reasoning accuracy and computational efficiency by employing a lightweight Derailer mechanism to assess reasoning stability and selectively triggers an advanced Rerailer verification process only when necessary. |
| Outcome: | The proposed framework achieves significant accuracy improvements (8-11%) while maintaining 2-3 times better efficiency than existing verification methods. |
Copied to clipboard
| Challenge: | Existing benchmarks on longcontext large language models fail to reflect their deep understanding capabilities across diverse tasks. |
| Approach: | They propose a benchmark to assess the ability of long-context large language models to handle long-text problems. |
| Outcome: | The proposed model achieves 50.1% accuracy when directly answering the questions . human experts achieve only 53.7% accuracy under a 15-minute time constraint . |
Copied to clipboard
| Challenge: | In a large fraction of the global traffic from smart digital assistants, frictions in dialogues may be attributed to incorrect understanding of the entities in a user's query due to factors including ambiguous mentions, mispronunciation, background noise and faulty on-device signal processing. |
| Approach: | They propose a parametric transformer-based language model to learn patterns from in-session customer-device interactions coupled with a non-parametric personalized entity index to compute the correct query. |
| Outcome: | The proposed system improves on the existing system and shows that it can learn the correct query from in-session customer-device interactions. |
Copied to clipboard
| Challenge: | Existing approaches to generate accurate and different-appearing paraphrases require massive parallel samples for training. |
| Approach: | They propose a novel approach that accomplishes Unsupervised Paraphrasing by Simulated Annealing by performing local editing. |
| Outcome: | The proposed approach outperforms existing models in automatic and human evaluations on Quora, Wikianswers, MSCOCO, and Twitter. |
Copied to clipboard
| Challenge: | Large-scale conversational AI based dialogue systems like Alexa, Siri, and Google Assistant, are getting more and more prevalent in real-world applications to help users across the globe. |
| Approach: | They propose a contextual rephrase detection model ContReph to automatically identify rephrasings from multi-turn dialogues using contextual information and user-agent interaction signals. |
| Outcome: | The proposed model outperforms the pairwise rephrase detection models by leveraging the context and user-agent interaction signals. |
Copied to clipboard
| Challenge: | Existing work on pretraining models for text classification uses image encoders instead of visual prompts. |
| Approach: | They propose a method to deploy large-scale pre-trained models in the prompt-tuning paradigm in few-shot learning. |
| Outcome: | The proposed method outperforms the most recent prompt-tuning methods on five public text classification datasets. |
Copied to clipboard
| Challenge: | a recent study shows that large language models have limited generalization in low-resource languages like Chinese. |
| Approach: | They propose to evaluate the zero-shot generalizability of large language models to the Chinese language . they release only half of the dataset publicly, with the remainder kept private . |
| Outcome: | The Chinese Instruction-Following Benchmark evaluates the generalizability of LLMs to the Chinese language. |
Copied to clipboard
| Challenge: | a framework that leverages the visual-language model to select key knowledge retrieved by DPR and answer questions improves performance of the baseline on the open-domain Knowledge-based VQA benchmark, OK-VQA. |
| Approach: | They propose a framework that leverages visual-language models to retrieve related knowledge . they use dense passage retrieval to retrieve knowledge related to visual-linguistics . |
| Outcome: | The proposed framework significantly improves the baseline on the open-domain Knowledge-based VQA benchmark, OK-VQA. |
Copied to clipboard
| Challenge: | Few-shot domain adaptation and NOTA detection are two real-world challenges for few-shot relation classification models. |
| Approach: | They propose a task to investigate two aspects of few-shot relation classification models . they build upon the FewRel dataset by adding a new test set in a different domain . |
| Outcome: | The proposed task can evaluate few-shot domain adaptation and few- shot none-of-the-above detection on a new domain and NOTA relation choice. |
Copied to clipboard
| Challenge: | Existing Byzantine-resistant aggregations detect poisonous clients but cannot defend against backdoor injection by malicious attackers in natural language tasks. |
| Approach: | They propose to embed client parameters to enhance Byzantine-resistant aggregations. |
| Outcome: | The proposed client embeddings detect poisonous clients and discard them . the proposed algorithms can't defend against backdoor injection by malicious attackers in natural language tasks . |
Copied to clipboard
| Challenge: | Speculative sampling is an efficient way to accelerate the auto-regressive generation process of large language models. |
| Approach: | They propose a frequency-ranked speculative sampling framework that optimizes draft candidate selection through vocabulary space compression. |
| Outcome: | Experiments show that FR-Spec reduces LM Head computation overhead by 75% while ensuring the equivalence of the final output distribution. |
Copied to clipboard
| Challenge: | Existing datasets only cover limited relation types at once, which prevents models from taking full advantage of relation interactions. |
| Approach: | They construct a large-scale human-annotated ERE dataset with improved annotation schemes to address these drawbacks. |
| Outcome: | The proposed dataset is larger than existing datasets of all the ERE tasks by at least an order of magnitude. |
Copied to clipboard
| Challenge: | Existing research lacks systematic analysis of the applicability and methodology of cross-modal skill injection. |
| Approach: | They investigate the applicability and methodology of cross-modal skill injection by integrating a domain-expert LLM into a VLM. |
| Outcome: | The proposed method enables transfer of domain-specific expertise from Large Language Models (LLMs) to VLMs without incurring additional training data requirements or significant computational overhead. |
Copied to clipboard
| Challenge: | Large-scale conversational AI agents such as Alexa, Siri and Google Assistant help millions of users to perform a lot of tasks. |
| Approach: | They propose a Constrained Generation Framework for query rewriting at global and personalized levels. |
| Outcome: | The proposed framework significantly boosts the query rewriting performance. |
Copied to clipboard
| Challenge: | Existing work on lifelong learning requires incremental memory space to learn a model . existing work on experience replay or elastic weighted consolidation requires incremental space . |
| Approach: | They propose a framework that leverages a recall optimization mechanism to memorize parameters of previous tasks via regularization and a domain drift estimation algorithm to compensate the drift between different domains in the embedding space. |
| Outcome: | The proposed framework outperforms SOTA models on paraphrase and dialog response generation tasks. |
Copied to clipboard
| Challenge: | Existing pre-training models lack long-turn dialogue sessions due to the scarcity of long-term sessions. |
| Approach: | They propose a framework that can automatically construct billion-scale long-turn dialogues by reorganizing existing short-turn ones. |
| Outcome: | The proposed framework can automatically construct billion-scale long-turn dialogues by reorganizing existing short-turn ones. |
Copied to clipboard
| Challenge: | Existing methods for video retrieval rely on embedding-based full-corpus scanning, but there is a bottleneck in semantic asymmetry and computational redundancy. |
| Approach: | They propose a multi-agent framework that rethinks retrieval as cooperative reasoning . they parse raw videos into a structured semantic library, enabling explicit attribute-level indexing . |
| Outcome: | The proposed framework bridges the granularity mismatch gap by parsing raw videos into a structured semantic library . it employs a Logic-aware Debate mechanism with a strict veto protocol . the proposed framework achieves competitive performance without task-specific fine-tuning . |
Copied to clipboard
| Challenge: | Existing studies on Android agents lack systematic research on open-source and closed-source models. |
| Approach: | They propose a framework for Android agents that includes an operation environment and a reproducible benchmark. |
| Outcome: | The proposed framework lifts the success rate of open-source LLMs and LMMs from 4.59% to 21.50% for LLM and 1.93% to 13.28% for LMM. |
Copied to clipboard
| Challenge: | Existing research on information extraction tasks focuses on one specific task, but in real-world scenarios, new data of different IE tasks and domains come in a stream over time. |
| Approach: | They propose a parameter- and deployment-efficient prompt tuning method to evaluate the UIE system under a “lifelong learning” setting. |
| Outcome: | The proposed method is able to learn new tasks without forgetting old ones and expand knowledge and functionalities without retraining the whole system. |
Copied to clipboard
| Challenge: | Existing graph neural networks can only process multi-hop relational reasoning on pre-defined graphs and cannot be directly applied in natural language relational reasoning. |
| Approach: | They propose a graph neural network with generated parameters using natural language sentences as inputs. |
| Outcome: | The proposed model can process relational reasoning on graphs and in natural language processing tasks. |
Copied to clipboard
| Challenge: | Existing models of open-domain dialogue comprehension have limited conversational understanding and response generation. |
| Approach: | They propose a multi-source probing method to probe dialogue comprehension abilities of open-domain dialogue models. |
| Outcome: | The proposed method aggregates features from multiple sources to accomplish diverse task goals and conducts downstream tasks in a generative manner consistent with dialogue model pre-training to leverage model capabilities. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained language models are limited to low-data regimes and require learning different modules to adapt to diverse tasks. |
| Approach: | They propose a framework for parameter-efficient fine-tuning that trains modules per task . they use an instance-dense retriever and a prototypical hypernetwork to generate conditional modules . |
| Outcome: | The proposed framework outperforms existing methods on multi-task learning and few-shot transfer learning. |
Copied to clipboard
| Challenge: | Existing methods for jailbreaking LLMs are implemented by binding backdoors to predefined phrases as first few output tokens, inducing the LLM’s next-token prediction to produce continuous responses. |
| Approach: | They propose a model editing-based jailbreak backdoor attack that hijacks LLM representations into a acceptance domain rather than binding to a few output tokens. |
| Outcome: | The proposed model editing method outperforms existing methods, showing stronger jailbreak capabilities across LLMs and datasets. |
Copied to clipboard
| Challenge: | In-context learning (ICL) is a promising capability for large language models (LLMs) but its underlying mechanism remains unexplored. |
| Approach: | They propose a demonstration compression technique to expedite inference and an analysis framework for diagnosing ICL errors in GPT2-XL. |
| Outcome: | The proposed method improves ICL performance and expedites inference. |
Copied to clipboard
| Challenge: | Initial studies have focused on task-specific, independent LLM-empowered agents, but the potential of LLMs within a multi-agent collaborative framework for classroom simulation with real user participation remains unexplored. |
| Approach: | They propose a multi-agent classroom simulation teaching framework that recognizes representative class roles and introduces a novel class control mechanism for automatic classroom teaching. |
| Outcome: | The proposed framework can simulate dynamic learning environment for users with active teacher-student and student-studente interactions. |
Copied to clipboard
| Challenge: | Recent studies have highlighted the lack of adversarial robustness in pre-trained models. |
| Approach: | They propose a fine-tuning approach that conducts selective updates when adapting pre-trained models to downstream tasks. |
| Outcome: | The proposed approach improves adversarial robustness on downstream tasks . it eliminates spurious updates, leading to flatter and wider optima than the conventional method . |
Copied to clipboard
| Challenge: | Existing models for dialogue rewriting suffer from the robustness issue, i.e., performances drop dramatically when testing on a different dataset. |
| Approach: | They propose a sequence-tagging-based approach that reduces the search space while preserving the core of the task. |
| Outcome: | The proposed model significantly reduces the search space while still covering the core of the task. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are generalist agents capable of operating within complex environments. |
| Approach: | They propose a class of tools that can serve as a middleware layer shielding LLMs from environmental complexity. |
| Outcome: | The proposed tool can shield the LLM from environmental complexity in two representative complex environments. |
Copied to clipboard
| Challenge: | Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence. |
| Approach: | They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included . |
| Outcome: | The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model. |
Copied to clipboard
| Challenge: | Standard RL approaches suffer from reward sparsity and mode-seeking behavior . lack of diversity hinders exploration necessary for optimal learning . |
| Approach: | They propose a framework that leverages external feedback as a dynamic control variable to explicitly balance exploration and exploitation within the semantic space. |
| Outcome: | Experiments on Tau Bench and SearchQA show that the proposed framework outperforms standard RL baselines. |
Copied to clipboard
| Challenge: | Contextual query rewriting (CQR) is a crucial component in Conversational AI agents, leveraging contextual information from previous user-agent conversations to improve comprehension of current user intent. |
| Approach: | They propose a framework to enhance the CQR model's capability in generating user preference-aligned rewrites. |
| Outcome: | The proposed framework improves the CQR model's ability to generate user preference-aligned rewrites. |
Copied to clipboard
| Challenge: | Existing neural machine translation models use a deep multi-head self-attention network with no explicit phrase information. |
| Approach: | They propose a neural network that combines multi-head self-attention and phrase modeling to train attention heads to attend to phrases in either n-gram or syntactic formalisms. |
| Outcome: | The proposed approach improves on English-to-German and NIST Chinese-to English translation tasks. |
Copied to clipboard
| Challenge: | Existing methods to fix faulty queries are limited in their ability to fix them. |
| Approach: | They propose a Personalized Adaptive Interactions Graph Encoder that integrates user's affinities and query semantics to refine utterance embeddings. |
| Outcome: | The proposed Query Rewriting (QR) techniques improve the rewrite accuracy of state-of-the-art baselines by 12.5–17.5% while having nearly ten times fewer parameters. |
Copied to clipboard
| Challenge: | Existing datasets may leak shallow heuristics via entity mentions, thus contributing to the high performance on RE benchmarks. |
| Approach: | They propose an entity-masked contrastive framework for relation extraction to gain a deeper understanding on textual context and type information while avoiding rote memorization of entities. |
| Outcome: | The proposed framework improves the effectiveness and robustness of neural models in different RE scenarios. |