Papers by Xing Zhou
Copied to clipboard
| Challenge: | Large language models have demonstrated impressive performance across a wide range of tasks, but this achievement comes with the trade-off of significant computational demands. |
| Approach: | They propose a scaling law that decomposes the overall validation loss and assigns different importance weights to tokens to assess a specific meta-capability. |
| Outcome: | The proposed model can predict the loss trending of models across different levels of computation without a gap between validation loss and model's downstream capabilities. |
Copied to clipboard
| Challenge: | Existing benchmarks for large language models lack information asymmetry with real-world situations. |
| Approach: | They propose a benchmark to evaluate the human-like motivational and behavioral reasoning ability of LLMs with detailed, realistic situations. |
| Outcome: | The proposed benchmark compared LLMs with real-world scenarios on seven model families and found that the most advanced models struggle with understanding "love & belonging" needs. |
Copied to clipboard
| Challenge: | closed-ended question-based benchmarks struggle with saturation as newer models emerge . crowd-sourced leaderboards rely on costly and slow human judges . |
| Approach: | They propose a framework that leverages collective intelligence from all large language models to evaluate each other. |
| Outcome: | a new framework enables a democratic, pairwise evaluation of all large language models . it achieves 97% correlation with human judgements, while significantly reducing the cost. |
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: | Text-level discourse parsing of discourse rhetorical structure (DRS) is a fundamental research topic in natural language processing. |
| Approach: | They propose a top-down neural architecture for text-level discourse parsing . they cast the parser as a recursive split point ranking task . |
| Outcome: | The proposed top-down approach is more suitable for text-level discourse parsing. |
Copied to clipboard
| Challenge: | Existing evaluation methodologies for MWPs diverge from human judgment and face challenges in recognizing mathematically equivalent answers. |
| Approach: | They propose an evaluation metric rooted in graph edit distance that features benefits such as permutation invariance and more accurate program equivalence identification. |
| Outcome: | The proposed evaluation metric features benefits such as permutation invariance and more accurate program equivalence identification. |
Copied to clipboard
| Challenge: | Mixture of Experts layers (MoEs) enable efficient scaling of language models . large autoregressive language models such as GPT-3 can be adapted to a wide range of tasks . |
| Approach: | They propose to use Mixture of Experts layers to enable efficient scaling of language models . they find that MoEs are substantially more compute efficient than dense models compared to MoE models - but only when they are more modestly trained . |
| Outcome: | The proposed model outperforms dense models in a wide range of tasks and domains. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) require a deep understanding of programming languages and their correlation with natural languages (NLs). |
| Approach: | They propose a data augmentation method that generates comments for existing code and a filtering strategy that filters out code data poorly correlated with natural language. |
| Outcome: | The proposed method outperforms the model trained on the augmented data and the model further trained on data without augmentation on two widely-used programming skill benchmarks. |
Copied to clipboard
| Challenge: | Existing approaches to train NMT models rely on sparse parallel data . a variety of PC variants yield significant improvements for low-resource NMT . |
| Approach: | They propose to transfer well-trained NMT models to low-resource languages by bidirectionally-adaptive learning strategy . they divide inner constituents of Parent encoder into two "teams" aiming to adapt to characteristics of low- and high-resourced languages . |
| Outcome: | The proposed method improves on low-resource NMT models with a variety of PC variants. |
Copied to clipboard
| Challenge: | Language models such as GPT and Llama have shown remarkable ability on diverse natural language tasks, yet their performance on complex table tasks is suboptimal. |
| Approach: | They propose a generator-validator paradigm to iteratively generate-then-validate training data from language models to fine-tune stronger Table-Specialist models that can specialize in a given task, without using manually-labeled data. |
| Outcome: | The proposed model outperforms vanilla language models on diverse table tasks and can match or surpass GPT-4 level quality. |
Copied to clipboard
| Challenge: | Optimal configuration of the learning rate (LR) is a fundamental yet formidable challenge in large-scale pre-training. |
| Approach: | They propose a Fitting Paradigm and a Transfer Paradigme to investigate fit and transfer . they propose scalability and elucidate the reasons why module-wise parameter tuning underperforms . |
| Outcome: | The proposed model reduces the search complexity by reducing the search cost by lowering the search factor. |
Copied to clipboard
| Challenge: | Recent advances in deep learning have various models that research reviews and interactions for different kinds of tasks, such as predicting restaurant survival. |
| Approach: | They propose a joint learning framework for explainable restaurant survival prediction based on multi-modal data of user-restaurant interactions and users’ textual reviews. |
| Outcome: | The proposed framework improves on two datasets showing that it can model restaurant interactions and users’ textual reviews. |
Copied to clipboard
| Challenge: | Large pre-trained language models are currently used for many NLP tasks . however, inference for these models requires significant computational resources . |
| Approach: | They propose to use a shared text encoder to amortize the computational cost of inference over multiple tasks. |
| Outcome: | The proposed method reduces the size of the extracted representations by a factor of 16 to store them for later use. |
Copied to clipboard
| Challenge: | Existing code reasoning benchmarks evaluate final output correctness under a single implementation. |
| Approach: | They propose a Code Reasoning benchmark that evaluates code reasoning through implementation invariance and process transparency. |
| Outcome: | The proposed benchmarks lack implementation invariance and process transparency . they observe superficial execution where models arrive at correct outputs without reasoning . |
Copied to clipboard
| Challenge: | Efficient processing of long contexts in large language models is essential for real-world applications such as retrieval-augmented generation and in-context learning. |
| Approach: | They propose a decoupled compressor-LLM framework that preserves contextual information within condensed embedding representations. |
| Outcome: | The proposed framework outperforms baseline models in three domains and across eight datasets while adapting to different downstream LLMs. |
Copied to clipboard
| Challenge: | Recent large-scale Visual-Language Generative Models (VLGMs) generate toxic content, e.g., offensive text and pornography images, raising significant ethical risks. |
| Approach: | They propose a bottleneck-based detoxification method to reduce toxicity while maintaining comparable generation quality. |
| Outcome: | The proposed method could reduce toxicity while maintaining comparable generation quality. |
Copied to clipboard
| Challenge: | Existing knowledge distillation methods investigate divergence measures but fail to deliver effective supervision when few distribution overlap exists between teacher and student. |
| Approach: | They propose a knowledge distillation method that exploits the Sinkhorn distance to ensure a nuanced assessment of the disparity between teacher and student distributions. |
| Outcome: | The proposed method outperforms state-of-the-art methods on all kinds of LLMs with encoder-only, encoder decoder, and decoded architectures. |
Copied to clipboard
| Challenge: | Existing automated generation methods exhibit Weak Applicability and Weak Scalability . existing methods are limited by their reliance on metadata from specific corpora . |
| Approach: | They propose an approach to generate scalable RAG benchmarks using corpus-agnostic methods . they propose a difficulty-guided metric that directs query evolution process . |
| Outcome: | The proposed approach evolves queries significantly more challenging than existing methods . it is able to dynamically increase difficulty, limiting scalability of the query . |
Copied to clipboard
| Challenge: | Existing recommendations systems are limited in generalizing to new tasks due to model scale and data size constraints. |
| Approach: | They propose an LLM-powered autonomous recommender agent, RecMind, which is capable of leveraging external knowledge to provide zero-shot personalized recommendations. |
| Outcome: | The proposed model outperforms existing zero/few-shot LLM-based recommendation baseline methods in various tasks and achieves comparable performance to a fully trained recommendation model P5. |
Copied to clipboard
| Challenge: | Long context large language models (LLMs) pose significant challenges for efficient serving due to the large memory footprint and high access overhead of KV cache. |
| Approach: | They propose a retrieval-based method to reduce the memory footprint of LLMs . they propose Windowed Rotary Position Embedding and query-aware vector quantization . |
| Outcome: | The proposed method can achieve lower performance degradation with lower overhead compared to existing methods . it can reduce the memory footprint and access overhead of long context large language models . |
Copied to clipboard
| Challenge: | NeuralClassifier is a toolkit for hierarchical multi-label text classification. |
| Approach: | They propose a toolkit for neural hierarchical multi-label text classification . they use a variety of text encoders to implement the model . |
| Outcome: | The proposed model achieves comparable performance with reported results in the literature. |
Copied to clipboard
| Challenge: | Reinforcement learning (RL) training typically improves single-sample success rates but limited exploration of diverse reasoning trajectories. |
| Approach: | They propose a training paradigm that interleaves conventional RL with inverse reinforcement learning (IRL) they propose 'Steering Probability Squeezing' to enhance exploration without external supervision . |
| Outcome: | The proposed training paradigm improves Pass@k and improves exploration of diverse reasoning trajectories without external supervision. |
Copied to clipboard
| Challenge: | Recent studies have identified "retrieval heads" in Large Language Models responsible for extracting information from input contexts. |
| Approach: | They propose to examine retrieval heads from a dynamic perspective . they establish that retrieval head activation is highly dynamic and functionally irreplaceable . |
| Outcome: | The proposed model's hidden state encodes a predictive signal for future retrieval head patterns, indicating an internal planning mechanism. |
Copied to clipboard
| Challenge: | under the pandemic of COVID-19, people experiencing COVI D19-related symptoms have a pressing need to consult doctors. |
| Approach: | They develop a medical dialog system that can provide COVID19-related consultations . they use two dialog datasets containing conversations between doctors and patients . |
| Outcome: | The proposed system can provide COVID19-related consultations, but is too small compared with general-domain dialog datasets. |
Copied to clipboard
| Challenge: | Existing methods for temporal sentence grounding ignore two crucial issues . 1) Boundary-bias: the video downsampling process may lose these two frames . 2) Reasoning-biases: such incorrect new boundary frames lead to the reasoning bias . |
| Approach: | They propose a siamese sampling mechanism to generate additional contextual frames . they use a reasoning strategy to learn the inter-relationship among these frames a . |
| Outcome: | Extensive experiments demonstrate the effectiveness of a new siamese sampling network on three challenging datasets. |
Copied to clipboard
| Challenge: | Top-down neural models still suffer from the top-down error propagation issue . previous studies gradually switch from feature-based machine learning methods to deep neural models . |
| Approach: | They propose a top-down framework that learns from discourse dependency and constituency parsing through one shared encoder and two independent decoders. |
| Outcome: | The proposed framework learns from discourse dependency and constituency parsing through one shared encoder and two independent decoders on a Chinese discourse corpus. |
Copied to clipboard
| Challenge: | Existing research focuses on character-level settings and static evaluation formats fail to capture the complexity of everyday social interactions. |
| Approach: | They propose a dynamic simulation framework for evaluating and improving persona-level role-playing in large language models (LLMs). |
| Outcome: | The proposed framework leverages user-generated social content to construct a nuanced persona bank and elicits multi-turn, context-rich interactions within simulated social environments. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) can solve complex tasks through iterative information retrieval. |
| Approach: | They propose a turn-level stage-aware policy optimization approach to solve this problem . they introduce a first-occurrence latent reward mechanism to allocate partial rewards . |
| Outcome: | Experiments show that TSPO outperforms state-of-the-art models on Qwen2.5-3B and 7B models. |
Copied to clipboard
| Challenge: | Existing benchmarks do not assess agents’ capabilities across data types . Existing tools only evaluate agents' ability to extract reasonable insights across data formats. |
| Approach: | They propose a multi-source benchmark to evaluate the performance of data analytics agents in handling diverse data sources. |
| Outcome: | The proposed agent performs end-to-end analysis over diverse data sources by automatically discovering cross-source linkages, decomposing goals, and generating robust, self-correcting code to extract actionable insights. |
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) has been used for enhancing large language models with external knowledge. |
| Approach: | They propose a framework for mining efficient graph structures via hashing to enhance RAG . they adopt an inductive paradigm where global graph structure emerges from local hash collisions . |
| Outcome: | The proposed framework outperforms existing baselines while requiring no GPU resources or token budget. |
Copied to clipboard
| Challenge: | Existing generative language models neglect an inherent challenge in text corpus during training, i.e., the imbalance between frequent tokens and infrequent ones. |
| Approach: | They propose a function to mitigate the imbalance between frequent and infrequent tokens . authors propose 'MiLe Loss' function to assess learning difficulty of tokens during training . |
| Outcome: | Experiments show that models with proposed model can improve on downstream benchmarks. |
Copied to clipboard
| Challenge: | Existing text watermarking technologies lack consistency when texts are translated into different languages. |
| Approach: | They propose a cross-lingual watermark removal attack to bypass watermarking by first obtaining a response from an LLM in a pivot language and then translating it into the target language. |
| Outcome: | The proposed method can remove watermarks without performance loss by obtaining a response from an LLM in a pivot language and then translating it into the target language. |
Copied to clipboard
| Challenge: | Existing studies on dialogue response selection focus on post-training and fine-tuning for cross-encoders. |
| Approach: | They propose a post-training technique tailored for dense encoders in dialogue response selection . they propose 'Dialogue Contextual Masking Auto-Encoder' which compresses dialogue semantics into dense vectors . |
| Outcome: | The proposed technique achieves state-of-the-art on two commonly evaluated benchmarks. |
Copied to clipboard
| Challenge: | Existing literature focuses on integrating domain-specific knowledge into LLMs to enhance accuracy using a fixed task template. |
| Approach: | They propose a collection of supervised learning tasks augmented with labels derived from a conventional recommender model to improve LLMs’ proficiency in adhering to recommendation-specific instructions. |
| Outcome: | The proposed approach significantly improves the capability of LLMs to respond to instructions within recommender systems, reducing formatting errors while maintaining a high level of accuracy. |
Copied to clipboard
| Challenge: | Personalized news recommendation is an important technique for personalized news service. |
| Approach: | They propose to build a large-scale news recommendation dataset from Microsoft News . they demonstrate that news recommendation relies on the quality of news content understanding . |
| Outcome: | The proposed dataset contains 1 million users and more than 160k English news articles, each of which has rich textual content such as title, abstract and body. |
Copied to clipboard
| Challenge: | Existing approaches focus primarily on retrieving isolated factual knowledge entities while neglecting the critical reasoning relationships. |
| Approach: | They propose a query-centric retrieval framework that explicitly integrates structured knowledge graphs to support complex reasoning tasks. |
| Outcome: | Extensive experiments on three benchmark datasets show that HyperRAG outperforms 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 approaches to data-to-text generation require limited training examples . a data-based approach is based on a set of pre-trained language models with optional finetuning. |
| Approach: | They propose a data-to-text generation task that makes use of any given (or no) examples. |
| Outcome: | The proposed approach improves on baselines on a dataset with zero/few/full-shot settings. |
Copied to clipboard
| Challenge: | Existing approaches to textual robustness evaluation focus on slightly modifying the input data, which maintains the original meaning and results in a different prediction. |
| Approach: | They propose a multilingual robustness evaluation toolkit for NLP that integrates universal text transformations, task-specific transformations and adversarial attack. |
| Outcome: | The toolkit includes universal text transformation, task-specific transformation, adversarial attack, subpopulation, and their combinations to provide comprehensive robustness analyses. |
Copied to clipboard
| Challenge: | Existing methods to learn informative user and news representations fail to consider high-order connectivity underlying the user-news interactions. |
| Approach: | They propose a novel Graph Neural News Recommendation model with Unsupervised Preference Disentanglement which can encode high-order relationships into user and news representations by information propagation along the graph. |
| Outcome: | The proposed model can encode high-order relationships into user and news representations by information propagation along the graph and disentangle latent preference factors by a neighborhood routing algorithm. |
Copied to clipboard
| Challenge: | Existing benchmarks fail to capture scenarios in which vulnerabilities are introduced by humans . we evaluate 5 popular code agents supported by 5 LLMs on SecureVibeBench . |
| Approach: | They propose a benchmarking tool that compares 105 C/C++ secure coding tasks . they use real-world open-source vulnerabilities and a comprehensive evaluation tool . |
| Outcome: | The proposed benchmarks show that code agents struggle to produce correct and secure code . the best performing agent produces merely 23.8% correct and secured solutions . |
Copied to clipboard
| Challenge: | Existing approaches to support diverse attention variants trade performance for flexibility . expert-written kernels achieve high efficiency but are difficult to adapt . |
| Approach: | They propose a framework that adapts expert-written attention kernels to GPUs . they use a structured lift–transfer–lower workflow to make execution explicit . |
| Outcome: | The proposed framework outperforms existing frameworks and compilers on diverse variants and GPU platforms. |
Copied to clipboard
| Challenge: | Parallel thinking is a promising avenue for scaling test-time compute in Large Language Models . however, coordinating the exploration and aggregation stages remains challenging . |
| Approach: | They propose a parallel thinking framework that explicitly incentivizes coordination between components via end-to-end reinforcement learning. |
| Outcome: | The proposed framework improves accuracy by 6.0% over long chain-of-thought baselines while reducing wall-clock latency by 39.4% under matched token budgets. |