Papers by Hongyu Zhang
Copied to clipboard
| Challenge: | Existing methods for Named entity recognition (NER) rely on labeled data, which is labor-intensive. |
| Approach: | They propose a method to de-biase DS-NER models by a structural Causal Model . they propose to use a causal invariance regularizer to make them more robust . |
| Outcome: | The proposed method significantly improves DS-NER models on four datasets and three DS NER models. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive capabilities but their application in open-ended, knowledge-intensive, complex reasoning scenarios is limited. |
| Approach: | They propose a framework that integrates risk assessment of intermediate reasoning states with dynamic retrieval-augmented generation within a Monte Carlo tree search paradigm. |
| Outcome: | The proposed framework outperforms the state-of-the-art KAR methods by up to 23.10% and the latest RAG-equipped large reasoning models by upto 25.37%. |
Copied to clipboard
| Challenge: | Existing mRAG systems suffer from a language bias during reranking, systematically favoring English and the query’s native language. |
| Approach: | They propose a language-agnostic utility-driven reranker alignment technique to mitigate language bias during re-ranking. |
| Outcome: | The proposed approach mitigates language bias and consistently improves mRAG performance across languages. |
Copied to clipboard
| Challenge: | Recent LLM-based search agents often concatenate the full interaction history into the context, producing long and noisy inputs and increasing compute cost and memory overhead. |
| Approach: | They propose an agent framework that maintains a compact memory during multi-turn interactions. |
| Outcome: | The proposed framework outperforms strong history-concatenation (ReAct-style) baselines on a range of public datasets while maintaining nearly constant token counts across multi-turn interactions. |
Copied to clipboard
| Challenge: | Existing presentation agents rely on predefined workflows and fixed templates to generate presentations. |
| Approach: | They propose an agentic framework that adapts to diverse user intents and iterative refinement based on observation. |
| Outcome: | The proposed framework can be used to generate presentations with environmental observations. |
Copied to clipboard
| Challenge: | Parallel Coordinated Reasoning (PaCoRe) overcomes a central limitation of contemporary language models: their inability to scale test-time compute (TTC) far beyond sequential reasoning under a fixed context window. |
| Approach: | They propose a training-and-inference framework to overcome a central limitation of language models: their inability to scale test-time compute (TTC) under a fixed context window. |
| Outcome: | The proposed model scales to multi-million-token effective TTC without exceeding context limits. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can replicate insecure patterns from training data. |
| Approach: | They propose a framework that leverages distributed security-relevant cues by aggregating representations from multiple upper layers via an attention-based module. |
| Outcome: | Experiments show that the framework improves the secure-and-correct generation rate by 11.9% over baselines. |
Copied to clipboard
| Challenge: | Existing approaches to improve the reasoning performance of large language models rely on intuitive instance-level feedback, which limits the reasoning capabilities. |
| Approach: | They propose a framework that pushes LLMs toward System-2-like critic capability by using a step-wise CoT reasoning paradigm and automatic construction of weak-supervision data without human annotation. |
| Outcome: | The proposed model significantly improves task-solving performance by filtering out invalid solutions or iterative refinement. |
Copied to clipboard
| Challenge: | Open-domain question answering is a task that requires answering questions based on a collection of document images. |
| Approach: | They propose to use document images to answer questions using layouts and visual features instead of text. |
| Outcome: | The proposed approach reduces human cost and improves scalability of QA systems by incorporating layouts and visual features. |
Copied to clipboard
| Challenge: | Existing benchmarks focus on character-centric approach and fail to reflect real-world applications. |
| Approach: | RMTBench is a user-centric bilingual role-playing benchmark featuring 80 diverse characters and over 8,000 dialogue rounds. |
| Outcome: | RMTBench features 80 diverse characters and over 8,000 dialogue rounds. |
Copied to clipboard
| Challenge: | Existing multimodal corpora for conversational humor are coarse-grained and insufficient to support the conversational comprehension task. |
| Approach: | They constructed a multimodal humor corpus based on a Chinese sitcom and used both unimodal and multimodal methods to test the corpus. |
| Outcome: | The proposed method outperforms unimodal and multimodal methods in the evaluation of a Chinese sitcom for conversational humor recognition. |
Copied to clipboard
| Challenge: | Current research on large language models with retrieval-augmented code generation (RACG) has focused on single-language settings, leaving their cross-lingual effectiveness underexplored. |
| Approach: | They construct a dataset covering 13 PLs with nearly 14K instances to study cross-lingual code knowledge transfer in RACG. |
| Outcome: | The proposed model shows unequal cross-lingual knowledge transfer even with direct injection and shows limited reliance on natural language information embedded in code when equipped with a code-specific retriever. |
Copied to clipboard
| Challenge: | Existing methods for relation extraction assume that text is noisy, but its corresponding labels are clean. |
| Approach: | They propose a framework that combines neural network and probabilistic modelling to denoise noisy relation labels. |
| Outcome: | The proposed framework improves the current art in uncovering the ground-truth relation labels. |
Copied to clipboard
| Challenge: | Large language models exhibit behavior that deviates from the boundaries of their knowledge during response generation. |
| Approach: | They propose a framework that allows large language models to explore their knowledge boundaries and self-correct generation behavior through fine-grained feedback signals. |
| Outcome: | The proposed framework enables LLMs to explore their knowledge boundaries and self-correct generation behavior through fine-grained feedback signals. |
Copied to clipboard
| Challenge: | Existing retrieval approaches often overlook patient-specific factual knowledge embedded in EHRs . existing retrieval frameworks often overlook this factual information, limiting its effectiveness in clinical decision-making. |
| Approach: | They propose a recurrence generation-augmented retrieval framework that synergizes factual and conceptual knowledge from dual sources. |
| Outcome: | The proposed framework improves on factual-aware medical QA benchmarks. |
Copied to clipboard
| Challenge: | API recommendation tools can help programmers use APIs by recommending which APIs to be used next given the APIs that have been written. |
| Approach: | They propose a cross-library API recommendation approach that uses BPE to split API calls in each sequence and pre-train a GPT based language model. |
| Outcome: | The proposed APIRecX can recommend APIs that are previously regarded as OOV . it can migrate knowledge of existing libraries to a new library and recommend API that is previously viewed as OVO . |
Copied to clipboard
| Challenge: | Existing Dev Knowledge QA benchmarks are limited in development knowledge scope and often not built from real user queries. |
| Approach: | They conduct preliminary analysis of real user–LLM dialogues from WildChat to investigate the importance of Dev Knowledge QA in AI-assisted software development scenarios. |
| Outcome: | The proposed benchmark is based on real user–LLM dialogues from WildChat. |
Copied to clipboard
| Challenge: | Existing work on how to finetune but neglects the issue of where to fine-tune language models is expensive. |
| Approach: | They propose to use transition traces of latent representation to compute deviations (or loss) and then estimate the gain of each layer in reducing deviation (or gain). |
| Outcome: | The proposed approach outperforms baseline methods and is cost-benefit balanced. |
Copied to clipboard
| Challenge: | Existing methods often apply coarse-grained constraints over entire reasoning trajectories . Existing approaches often apply unsafe constraints, causing unsafe outputs . |
| Approach: | They propose a trajectory-level training framework that mitigates Self-Jailbreak . they propose 'chain-of-guardrail' to mitigate self-jailbreak by targeting step-level interventions . |
| Outcome: | The proposed framework mitigates Self-Jailbreak by targeting step-level interventions while maintaining reasoning ability. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) generate code for given contexts, such as incomplete code, class, data structure, or project-specific information. |
| Approach: | They propose a compiler feedback-based code generation approach that leverages static analysis to identify mismatches between the generated code and the project's context. |
| Outcome: | The proposed model outperforms retrieval-based code generation baselines and significantly outperfies the existing large language models. |
Copied to clipboard
| Challenge: | Existing approaches to automatically generate commit messages are repetitive or redundant. |
| Approach: | They propose a retrieval-augmented neural commit message generation method which treats the retrieved similar commit as an exemplar and leverages it to generate an accurate commit message. |
| Outcome: | The proposed method outperforms baselines on a large dataset with five programming languages and can boost existing Seq2Seq models in commit message generation. |
Copied to clipboard
| Challenge: | Recent data augmentations for code search are at the raw-data level, which requires additional code analysis and training cost. |
| Approach: | They propose a general format of representation-level augmentation that unifies existing methods. |
| Outcome: | The proposed methods can boost the performance of code search models on a large-scale dataset. |
Copied to clipboard
| Challenge: | Existing web agents suffer from limited robustness, efficiency and task success due to lack of structural understanding of websites and lack of browsing priors in pre-trained models. |
| Approach: | They propose an agent-oriented sitemap protocol that integrates structured website knowledge into web agents. |
| Outcome: | The proposed agent-oriented sitemap improves robustness, efficiency and effectiveness without extra training. |
Copied to clipboard
| Challenge: | Existing knowledge graph construction frameworks require predefined schemas, limiting their scalability and domain coverage. |
| Approach: | They propose a framework for fully autonomous knowledge graph construction that eliminates the need for predefined schemas. |
| Outcome: | The proposed framework outperforms state-of-the-art models on multi-hop QA tasks and enhances LLM factuality. |
Copied to clipboard
| Challenge: | Large Language Model (LLM) agents struggle with ultra-long-horizon tasks requiring hundreds or thousands of interaction steps. |
| Approach: | They propose a framework that reconceptualizes context management as a Next Step Prediction problem. |
| Outcome: | The proposed framework improves task success rates and robust cross-lingual performance. |
Copied to clipboard
| Challenge: | Existing methods to translate natural language descriptions into visualization queries focus on spoken languages, not sign languages. |
| Approach: | They propose a sign language interface that enables the DHH community to engage more fully with data analysis. |
| Outcome: | The proposed interface can be used by the deaf and hard-of-hearing community. |
Copied to clipboard
| Challenge: | Effective content moderation is essential for video platforms to safeguard user experience and uphold community standards. |
| Approach: | They propose a method to transform a generative MLLM into a multimodal classifier using minimal discriminative training data. |
| Outcome: | The proposed method improves F1 score by 66.50% over traditional classifiers while requiring only 2% of the fine-tuning data. |
Copied to clipboard
| Challenge: | Recent studies have identified significant redundancy in large language models . quantization and pruning are two methods that reduce computational resources . |
| Approach: | They propose simple pruning methods that prune redundant layers based on their BI scores. |
| Outcome: | The proposed pruning methods demonstrate superior performance over previous pruning methods. |
Copied to clipboard
| Challenge: | Existing methods for code summarization do not capture rich information in ASTs . existing methods are labor-intensive and time-consuming to document code with good summaries manually. |
| Approach: | They propose a model that hierarchically splits and reconstructs ASTs by a neural network . they propose to use AST embeddings and a vanilla code token encoder to generate the model . |
| Outcome: | The proposed model splits and reconstructs ASTs into subtrees and then aggregates embeddings of subtreas to get the complete AST. |
Copied to clipboard
| Challenge: | Existing pretraining models take the first 256 tokens of code snippets by default, limiting the input length to 512. |
| Approach: | They propose a baseline SEA model which splits long code into code blocks and aggregates them to obtain a comprehensive long code representation. |
| Outcome: | The proposed model can model long code without changing their internal structure and re-pretraining. |
Copied to clipboard
| Challenge: | Earlier studies of instruction tuning on Large Language Models focus on creating large, varied, and high-quality datasets with responses curated by human experts. |
| Approach: | They propose to use a smaller and weaker model to fine tune a larger and stronger model . they find it can largely speed up the data filtering and improve performance . |
| Outcome: | The proposed model can filter instruction data faster and better on benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown significant potential in code generation, but they also present challenges regarding the protection of Intellectual Property (IP) related to model architectures, weights, and training data. |
| Approach: | They propose a multi-bit watermarking technique that embeds additional information to preserve provenance details, such as the vendor ID of an LLM. |
| Outcome: | The proposed technique preserves provenance details while maintaining syntactical correctness of generated code. |
Copied to clipboard
| Challenge: | Code search is to search reusable code snippets from source code corpus based on natural languages queries. |
| Approach: | They propose a method to accelerate code search with deep hashing and code classification by using deep hashes and code hash. |
| Outcome: | The proposed method can save 90% of retrieval time while preserving at least 99% of retrievals accuracy. |
Copied to clipboard
| Challenge: | Automated Alignment (ALM) is a set of algorithms designed to align Large Language Models (LLMs) with human intentions and values while minimizing manual intervention. |
| Approach: | They propose an open-source toolkit that integrates mainstream automated algorithms through a consistent interface and an accessible workflow supporting one-click execution for prompt synthesis and automatic alignment signal construction. |
| Outcome: | The proposed framework enables easy reproduction of existing results through extensive benchmarks and facilitates the development of novel approaches via modular components. |
Copied to clipboard
| Challenge: | Data augmentation is a critical technique in deep learning. |
| Approach: | They propose a novel text augmentation paradigm leveraging large language models . they incorporate seed text into a context expanded by LLM and ask it to regenerate a variant based on the expanded context. |
| Outcome: | The proposed model generates high-quality and diverse augmented text with a transplant-then-regenerate approach. |
Copied to clipboard
| Challenge: | Existing safety alignment methods rely on fine-tuning, which inadvertently leads to the increased complexity and computational resources required. |
| Approach: | They propose a safety re-alignment framework with Low-Rank Safety Subspace Fusison that exploits low-rank safety characteristics of LLMs by constructing a low-ranked projection matrix to extract the principal components of safety vectors. |
| Outcome: | The proposed method exploits low-rank safety subspace of the LLMs and is stable during fine-tuning process and is isolated from the model’s general capabilities. |
Copied to clipboard
| Challenge: | Existing methods that reuse layer parameters are limited by incompatibility . a central challenge is to make cross-scale knowledge transfer effective and efficient . |
| Approach: | They propose a method that uses latent semantic alignment to facilitate cross-scale knowledge transfer . they use activations to pair target and source layers in latent space to achieve alignment . |
| Outcome: | The proposed method is effective when source and target models differ in architecture and parameterization. |
Copied to clipboard
| Challenge: | Existing federated frameworks for cross-domain sequential recommendation rely on user alignment, which increases communication costs and privacy risks. |
| Approach: | They propose a federated cross-domain sequential recommendation framework that eliminates the need for user alignment between platforms. |
| Outcome: | The proposed framework eliminates the need for user alignment between platforms. |
Copied to clipboard
| Challenge: | MRC requires machines to understand text and answer questions about the text. |
| Approach: | They propose a simple system Baidu submitted for MRQA 2019 Shared Task that focused on generalization of machine reading comprehension (MRC) models. |
| Outcome: | The proposed system is ranked at top 1 of all participants in terms of averaged F1 score. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have made significant advances in code generation through the ‘Chain-of-Thought’ prompting technique. |
| Approach: | They propose a framework which aims to transfer LLMs’ reasoning capabilities to smaller models through distillation. |
| Outcome: | The proposed framework improves the smaller model's code generation performance by over 130% on the APPS benchmark. |
Copied to clipboard
| Challenge: | Existing methods for generating presentations from documents focus on improving and evaluating content quality in isolation, overlooking visual appeal and structural coherence. |
| Approach: | They propose an edit-based presentation generation system that analyzes and iterates on slides to create new slides. |
| Outcome: | The proposed presentation generation tool outperforms existing methods in three dimensions . it analyzes slides, iterates and generates edit actions based on selected slides . |
Copied to clipboard
| Challenge: | Recent approaches to classification of vulnerabilities ignore their relationships and treat each class in isolation, resulting in non-scalable code vector representations. |
| Approach: | They propose a hierarchical contrastive learning framework to bring vector representations of related CWEs closer together and use max-pooling to enable the model to handle longer vulnerability code inputs. |
| Outcome: | The proposed framework outperforms state-of-the-art methods by 2.97%-17.90% on accuracy and 0.98%-22.27% on weighted-F1 with even better performance on higher-quality datasets. |
Copied to clipboard
| Challenge: | Existing sparse attention methods for long-context generation pose high latency . general sparsity methods cause excessive accuracy degradation without considering code structure . |
| Approach: | They propose a training-free **S**tructure-**a**ware **b**lock-spa**r**s**e** attention mechanism that bridges the gap between logical and computational sparsity. |
| Outcome: | The proposed method reduces TTFT by 45-55% while maintaining accuracy within 3% of dense attention. |
Copied to clipboard
| Challenge: | Existing knowledge enhancement techniques for pre-trained language models (PLMs) introduce noisy entity representations. |
| Approach: | They propose a knowledge enhancement filter that integrates external knowledge bases to enhance PLMs' ability to capture entity knowledge. |
| Outcome: | The proposed method achieves the highest F1-score and accuracy while reducing the computational cost by 1.7-2.5x. |
Copied to clipboard
| Challenge: | Existing Chinese resources are small in scale and limited to specific domains, making them insufficient for LLM post-training. |
| Approach: | They propose a Chinese-annotated reward model and a preference dataset to address this gap . they evaluate Chinese RMs on CheemsBench and construct an RM that captures human preferences . |
| Outcome: | The proposed RM achieves state-of-the-art performance on CheemsBench and CheeMePreference. |
Copied to clipboard
| Challenge: | Existing approaches to extract syntactic features from text or sentences are limited by the loss of rich structural information contained in the syntax tree. |
| Approach: | They propose to embed the syntax parse tree of sentence into a learnable distributed representation . they show that the approach improves upon the prior art and achieves new performance records . |
| Outcome: | The proposed approach improves upon the prior art and achieves new performance records on five benchmarking data sets. |
Copied to clipboard
| Challenge: | Recent studies in formal mathematical reasoning have shown an unstoppable growth trend. |
| Approach: | They constructed 18k high-quality instruction-response pairs across five mainstream formal specification languages and evaluated them against ten open-sourced LLMs. |
| Outcome: | The proposed model compared instruction-response pairs across five formal specification languages and found that the LLMs were good at writing proof segments when given either the code, or the detailed description of proof steps. |
Copied to clipboard
| Challenge: | a new method for text-to-image generation models is proposed to address these limitations . SSA focuses on learning structured semantic embeddings across different modalities . |
| Approach: | They propose a method to evaluate text-to-image generation models using structured semantic embeddings . they propose to learn mutated prompts by substituting words with equivalent or nonequivalent alternatives . |
| Outcome: | The proposed method improves the measurement of semantic consistency of text-to-image generation models. |
Copied to clipboard
| Challenge: | EquiBench is a new benchmark to evaluate large language models' ability to reason about program semantics . Unlike natural language, code is executable. |
| Approach: | They propose a benchmark to evaluate large language models through equivalence checking . EquiBench consists of 2400 program pairs across four languages and six categories . |
| Outcome: | The proposed benchmark consists of 2400 program pairs across four languages and six categories. |
Copied to clipboard
| Challenge: | Current evaluations for large language models use a single-item assessment paradigm . current evaluations struggle to discern whether a model possesses the required capabilities or merely memorizes/guesses the answers to specific questions. |
| Approach: | They propose a framework to evaluate large language models using atomic test objectives. |
| Outcome: | The proposed evaluation framework resists data contamination and reduces interference of potential biases, and sheds light on the design of future principled and trustworthy LLM evaluation protocols. |
Copied to clipboard
| Challenge: | *Natural Language to Visualization (NL2Vis) seeks to transform natural-language descriptions into visual representations of given tables. |
| Approach: | They propose a collaborative agent workflow for NL2Vis that incorporates three agents . the model is called **nvAgent** and comprises a processor agent for database processing and context filtering, a composer agent for planning visualization generation and a validator agent for code translation and output verification. |
| Outcome: | The proposed workflow surpasses state-of-the-art models on the VisEval benchmark. |
Copied to clipboard
| Challenge: | Creating spreadsheet formulas remains a tedious and error-prone task for many end-users . a novel task is proposed to generate spreadsheet formulae from a user's NL query . |
| Approach: | They propose a task to generate formulas that are grounded on a spreadsheet table given a Natural Language query as input. |
| Outcome: | The proposed task generates formulas that are grounded on a spreadsheet table, given a natural language query as input. |