Papers by Hongyu Wang
Copied to clipboard
| Challenge: | Existing code sandboxes fail to provide accurate verification and efficiency under high-concurrency workloads. |
| Approach: | They propose a high-fidelity code verification system that provides sandbox feedback for RL training and evaluation. |
| Outcome: | The proposed system outperforms heuristic-matching baselines on LiveCodeBench and training stability on high-concurrency workloads. |
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: | In order to comprehensively verify the robustness and generalization of MRC models, we construct a real-world Chinese dataset - DuReader_robust . |
| Approach: | They introduce a real-world Chinese dataset to evaluate the robustness and generalization of MRC models from three aspects: over-sensitivity, over-stability and generalisation. |
| Outcome: | The proposed model fails to perform well on the challenge test set and may provide suggestions for future model development. |
Copied to clipboard
| Challenge: | Existing methods for full-attention dLLMs rely on random masking strategies that overlook intrinsic token dependencies. |
| Approach: | They propose an attention-guided denoising and optimization framework that aligns training and optimization with attention-derived dependencies. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on mathematical and coding benchmarks. |
Copied to clipboard
| Challenge: | SpeechMatrix is a large-scale multilingual corpus of speech-to-speech translations mined from real speech of European Parliament recordings. |
| Approach: | They present a large-scale multilingual corpus of speech-to-speech translations mined from real speech of European Parliament recordings. |
| Outcome: | The proposed model can train bilingual models on 136 language pairs with 418 thousand hours of speech. |
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 approaches to identifying inappropriate content require extensive human-labeled data and lack cross-issue generalization. |
| Approach: | They propose a reasoning-enhanced multimodal large language model (MLLM) pretraining paradigm for unified inappropriate content detection. |
| Outcome: | The proposed model improves the MLLM's performance in both zero-shot and supervised fine-tuning settings and shows strong generalization capabilities to emergent, previously unseen issues. |
Copied to clipboard
| Challenge: | Existing methods for error identification often overlook validation of generated results . text-to-SQL is a technology that converts natural language questions into executable SQL queries . |
| Approach: | They propose to integrate a multi-grained error identification method into existing methods to detect SQL errors. |
| Outcome: | The proposed method can be integrated as a plugin into various methods, providing effective error identification and correction capabilities. |
Copied to clipboard
| Challenge: | Existing approaches to generate research ideas rely on retrieval or prompt engineering to generate ideas. |
| Approach: | They propose a method that uses iterative planning and search to boost creative potential of LLMs by integrating external knowledge with broader and deeper insights. |
| Outcome: | The proposed method outperforms the current state-of-the-art in generating 2.5 times more top-rated ideas based on 170 seed papers in a Swiss Tournament evaluation. |
Copied to clipboard
| Challenge: | Pre-trained language models have shown remarkable memory formation, but vanilla networks without pre-training suffer catastrophic forgetting problem. |
| Approach: | They conduct experiments to investigate the retentive-forgetful contradiction between vanilla and pre-trained language models by controlling the target knowledge types, learning strategies and learning schedules. |
| Outcome: | The results show that pre-trained language models are forgetful and pre-training leads to retentive models . |
Copied to clipboard
| Challenge: | Existing RAG paradigms suffer from the impact of flawed information introduced during the retrieval phrase, thereby diminishing the reliability and correctness of the generated output. |
| Approach: | They propose a framework that empowers models to discern and process information based on its credibility. |
| Outcome: | The proposed framework outperforms existing models with retrieval augmentation and exhibits robustness despite increasing noise in the context. |
Copied to clipboard
| Challenge: | Existing datasets for non-English passage retrieval are lacking in quality and accuracy. |
| Approach: | They present a large-scale Chinese dataset for passage retrieval . they reduce false negatives by manually annotating results pooled from multiple retrievers . |
| Outcome: | The proposed dataset reduces false negatives in development and testing sets and removes similar training queries. |
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: | Low-Rank Adaptation (LoRA) is a parameter-efficient fine-tuning algorithm for large-scale language models. |
| Approach: | They conduct a systematic study of Low-Rank Adaptation (LoRA) on diverse tasks and rich resources with different learning capacities. |
| Outcome: | The proposed algorithm can achieve remarkable performance in high-resource and multi-task scenarios, even comparable to full fine-tuning. |
Copied to clipboard
| Challenge: | a new study examines speech-to-speech translation (S2ST) that translates speech from one language into another . the research area for unwritten languages remains a research area with little exploration due to the lack of training data. |
| Approach: | They propose a system that translates speech from one language into another . they use Taiwanese Hokkien as an example of an unwritten language . |
| Outcome: | The proposed system can be used to train models in languages without standard writing systems. |
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: | Existing text-based speech-to-speech translation systems rely on cascaded approach . text-to text translation systems require text generation and a single input to generate output . |
| Approach: | They propose a textless speech-to-speech translation system that can translate speech from one language into another without the need of text data. |
| Outcome: | The proposed system can translate speech from one language into another without text data. |
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 studies have discovered notable disparities in their performance across different languages. |
| Approach: | They conduct a systematic investigation into the behaviors of large language models across 27 different languages on 3 different scenarios and reveals a Linguistic Map correlates with the richness of available resources and linguistic family relations. |
| Outcome: | The proposed model demonstrates that there are significant disparities in performance across languages across 27 different languages on 3 different scenarios. |
Copied to clipboard
| Challenge: | Current instruction tuning relies on teacher models or human intervention to generate and refine the instructions and responses for training, which are costly, non-sustainable, and may lack diversity. |
| Approach: | They propose a human/model-free compositional data synthesis method that can create rich and diverse augmentations from existing instruction tuning data to enhance large language models. |
| Outcome: | The proposed method improves performance over benchmarks and reduces training costs by 80% compared with original instruction tuning. |
Copied to clipboard
| Challenge: | Conventional approaches relying on extensive parameter learning for multimodal perception are rigid and computationally inefficient. |
| Approach: | They propose a parameter-free method that constructs visual-tactile cross-modal knowledge directly by retrieving similar visual-touch data for given visual and tactile inputs and generating tactile descriptions through a voting mechanism. |
| Outcome: | The proposed method achieves comparable performance to large-scale cross-modal models without training across a wide range of datasets. |
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 methods for XMC struggle with the growing set of labels due to their static label assumptions, and embedding-based methods struggle with complex mapping relationships due to late interaction paradigm. |
| Approach: | They propose a large language model (LLM) powered agent framework for extreme multi-label classification, XMC-Agent, which can effectively learn, manage and predict the extremely large and dynamically increasing set of labels. |
| Outcome: | The proposed framework can learn, manage and predict the extremely large and dynamically growing set of labels and achieves state-of-the-art performance on three standard datasets. |
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: | In-context learning (ICL) has gained considerable attention due to its data efficiency and task adaptability. |
| Approach: | They propose to de-biase demonstration bias in in-context learning by focusing on semantic ambiguity induced by demonstrations and reducing the semantic hazard. |
| Outcome: | The proposed methods significantly improve performance on six datasets. |
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: | Multimodal large language models (MLLMs) capture semantics of short video content but fail to account for policy-specific details. |
| Approach: | They propose a framework that integrates In-prompt Process Supervision into MLLMs . they propose sequential reasoning over ancillary questions during fine-tuning . |
| Outcome: | IPS outperforms baseline MLLMs on public and proprietary benchmarks . replacing human-annotated ancillary labels with MLML-generated ones results in performance degradation. |
Copied to clipboard
| Challenge: | Entity matching (EM) is a critical step in entity resolution (ER). |
| Approach: | They propose a method that incorporates record interactions from different perspectives. |
| Outcome: | The proposed framework improves on 8 ER datasets and 10 LLMs and achieves higher efficiency and effectiveness. |
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: | Existing systems that use pre-trained large language models to perform multi-step logical reasoning have been unable to perform this task. |
| Approach: | They propose a system that uses language models to perform multi-step logical reasoning and incorporates explicit planning into the inference procedure. |
| Outcome: | The proposed system outperforms other competing methods on multiple datasets and significantly outperformed chain-of-thought prompting on the PrOntoQA dataset. |
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 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: | Current named entity recognition methods struggle with text-image mismatch problem due to a lack of visual context. |
| Approach: | They propose an adaptive mixup image augmentation method that generates augmented images based on matching score between text and image . |
| Outcome: | The proposed method can be integrated into existing models and demonstrate consistent performance improvements. |
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: | a comprehensive evaluation of QM models should be conducted on natural texts, not on artificial adversarial examples . ral models are often not robust to adversarials, which means they predict unexpected outputs . |
| Approach: | They use a Chinese dataset to evaluate the robustness of QM models . they show that the effect of artificial adversarial examples does not work on natural texts . |
| Outcome: | The proposed model is more robust than other models on natural questions with 32 linguistic perturbations. |
Copied to clipboard
| Challenge: | Existing approaches to answer open-domain question have encountered term mismatch and limited interaction between IR systems and large language models. |
| Approach: | They propose a method which leverages the guidance and feedback gained from the analysis to provide faithful and consistent extensions for effective question answering. |
| Outcome: | Experiments on four open-domain question answering datasets show the proposed method performs well under zero-shot settings. |
Copied to clipboard
| Challenge: | 1-bit large language models have spurred interest in ternary LLMs, but efficient edge inference is still scarce. |
| Approach: | They propose an inference system optimized for 1-bit large language models . they propose a new library that facilitates sub-2-bits-per-weight inference . |
| Outcome: | The proposed inference system achieves 6.25x speed increase over full-precision baselines and 2.32x over low-bit baselines. |
Copied to clipboard
| Challenge: | Existing routing strategies rely on heuristics, external predictors, or absolute quality estimation to capture whether the large model provides a worthwhile improvement over the small one. |
| Approach: | They propose a budget allocation problem for routing large model to large model . they propose heuristics, external predictors, or absolute quality estimation to determine the optimal signal for budgeted decisions. |
| Outcome: | The proposed model outperforms heuristics, quality/difficulty estimation baselines and achieves a superior quality–budget Pareto frontier. |
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: | In this study, we uncover interpretable latents that govern RAG behavior in large language models . Sparse Autoencoders are used to control large language model (LLM) behavior . |
| Approach: | They leverage Sparse Autoencoders within the LLaMA Scope to uncover latents that govern RAG behaviors. |
| Outcome: | The proposed model can be used to control large language models without architectural modifications. |
Copied to clipboard
| Challenge: | Existing methods to pre-train speech and text use unlabeled data to learn universal feature representations. |
| Approach: | They propose a method to jointly pre-train speech and text in an encoder-decoder modeling framework for speech translation and recognition. |
| Outcome: | The proposed method achieves between 1.7 and 2.3 BLEU improvement above the state of the art on the MuST-C speech translation dataset and comparable WERs to wav2vec 2.0 on the Librispeech speech recognition task. |