Papers by Bowen Zhou
Copied to clipboard
| Challenge: | Recent studies show that AI-assisted research methods can improve research efficiency . a closed-loop framework is used to enhance the automation level of scientific research . |
| Approach: | They propose a closed-loop LLM-driven framework to enhance the automation level of scientific research. |
| Outcome: | The proposed framework improves the efficiency of scientific research by improving data analysis, accelerating computation, and fostering novel idea generation. |
Copied to clipboard
| Challenge: | Existing datasets for human-like dialogue tasks are deficient due to the complexity of human conversations. |
| Approach: | They construct a large-scale Chinese E-commerce conversation corpus with 1 million dialogues, 20 million utterances, and 150 million words. |
| Outcome: | The proposed dataset includes 1 million multi-turn dialogues, 20 million utterances, and 150 million words. |
Copied to clipboard
| Challenge: | Existing top-k attention methods struggle to strike a balance between efficiency and accuracy. |
| Approach: | They propose a top-k attention approach that integrates low-overhead techniques into the Top-k Attention process to achieve 7.2 speedup compared to vanilla full attention. |
| Outcome: | The proposed approach achieves 7.2 speedup compared to current top-k attention methods while maintaining model accuracy. |
Copied to clipboard
| Challenge: | Existing Relation extraction models require extensive annotated training data, which is costly and labor-intensive to collect. |
| Approach: | They propose a new zero-shot RE task where only relation definitions are provided instead of seen-unseen relation instances. |
| Outcome: | The proposed task significantly improves cost-effective zero-shot performance by large margins. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained large language models in a parameter-efficient manner are gaining traction within the research community. |
| Approach: | They propose a method of low-rank adaptation that enables dynamic adjustments to the intrinsic rank during the adaptation process. |
| Outcome: | The proposed approach outperforms the current method with a fixed and unalterable intrinsic rank and a low-rank adaptation process. |
Copied to clipboard
| Challenge: | Existing approaches to reinforcement learning are decoupled from structured search due to limited trajectory diversity. |
| Approach: | They propose a unified RL framework that integrates multiple agents within a shared tree-structured search environment. |
| Outcome: | Experiments show that MARS2 improves performance across diverse model combinations and training settings. |
Copied to clipboard
| Challenge: | Existing models to tackle multi-hop reading comprehension (RC) are focusing on a single document or paragraph, but they lack the ability to do reasoning across multiple documents. |
| Approach: | They propose a heterogeneous document-entity graph with different types of nodes and edges to solve multi-hop RC problem. |
| Outcome: | The proposed model can do reasoning over the proposed graph with nodes representation initialized with co-attention and self-attention based context encoders. |
Copied to clipboard
| Challenge: | Existing automated review systems struggle with factual accuracy, rating consistency, and analytical depth. |
| Approach: | They propose a framework for generating comprehensive and factually grounded scientific paper reviews using supervised fine-tuning and reinforcement learning. |
| Outcome: | The proposed framework outperforms existing methods on ICLR 2025 papers. |
Copied to clipboard
| Challenge: | Existing keyphrase generation approaches synchronously generate present and absent keyphrases without explicitly distinguishing these two categories. |
| Approach: | They propose to deal with present and absent keyphrases separately with different mechanisms by using a hierarchical neural network with a pointing-based selector and a selection-guided generator. |
| Outcome: | The proposed model outperforms baselines on four keyphrase generation tasks and shows extensibility in natural language generation tasks. |
Copied to clipboard
| Challenge: | Existing text-guided image editing methods rely on end-to-end pixel-level inpainting paradigm . existing models lack such intermediate representations and Reasoning-then-action process . |
| Approach: | They propose a "Decompose-then-Action" paradigm that revisits image editing as an actionable interaction process within a structured environment. |
| Outcome: | The proposed paradigm outperforms existing methods in compositional editing tasks. |
Copied to clipboard
| Challenge: | Large-scale language models (LLMs) are increasingly exposed to private data and are becoming more and more prevalent. |
| Approach: | They propose a collaborative generation framework that integrates large and small language models to address privacy concerns logically. |
| Outcome: | The proposed framework combines large and small models to address privacy concerns logically. |
Copied to clipboard
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Copied to clipboard
| Challenge: | Traditional mixture-of-experts (MoE) networks impose an expert capacity constraint to ensure GPU-friendly computation. |
| Approach: | They propose a routing paradigm that dynamically allocates input tokens to top-k experts through differentiable sparse transformations, enabling scalable model capacity while preserving computational efficiency. |
| Outcome: | The proposed model achieves lower training losses and higher evaluation scores at equivalent FLOPs compared to constrained and unconstrained baselines. |
Copied to clipboard
| Challenge: | Existing algorithms for achieving optimal alignment are mostly unidirectional . a recent study suggests that large language models can be ground with evident preferences . |
| Approach: | They propose to ground large language models with evident preferences . they propose to use controllable preference optimization to specify different objectives . |
| Outcome: | The proposed models can provide responses that match various preferences among the ”3H” desiderata. |
Copied to clipboard
| Challenge: | Large language models excel in various tasks, but their huge size and inaccessibility of parameters present challenges for practical deployment. |
| Approach: | They propose to use CoT data to distill task-specific ability from large language models to smaller models . they use reasoning programs to suppress errors in distilled data and improve distillation quality . |
| Outcome: | The proposed model outperforms LLMs on arithmetic reasoning, symbolic reasoning, and general ability. |
Copied to clipboard
| Challenge: | Existing models fail to generalize to more challenging math problems, authors say . existing benchmarks related to assessing language models' reasoning process are limited . |
| Approach: | They propose a tool to measure language models' ability to identify erroneous steps in reasoning . they use two types of models: process reward models and critic models . |
| Outcome: | The proposed model outperforms existing models in evaluating language models' reasoning process . the best open-source model has demonstrated the critique capability competitive with the proprietary model . |
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: | Recent advances in large language models have improved their capacity to handle long text inputs, but current models still exhibit unsatisfactory performance in long-form generation. |
| Approach: | They propose a method to enhance long-form text generation through step-level supervision by leveraging Monte Carlo Tree Search to collect stepwise preference pairs and employ a global memory pool to maintain factual accuracy. |
| Outcome: | The proposed method improves performance on long-form generation benchmarks while maintaining lossless performance on several general benchmarks. |
Copied to clipboard
| Challenge: | Existing approaches to integrate the recommendation function and dialog generation function smoothly are lacking. |
| Approach: | They propose to integrate dialog context for recommendation and dialog generation better using a pre-trained language model and an item metadata encoder to integrate the recommendation and dialogue generation. |
| Outcome: | The proposed architecture improves the integration of recommendation and dialog generation functions. |
Copied to clipboard
| Challenge: | Existing pre-trained language models are not explicitly aware of domain-specific knowledge, which is essential for downstream tasks in many domains, such as tasks in e-commerce scenarios. |
| Approach: | They propose a knowledge-injected pre-trained language model that can be transferred to both natural language understanding and generation tasks. |
| Outcome: | The proposed model significantly outperforms baselines across the board in e-commerce scenarios. |
Copied to clipboard
| Challenge: | Existing models that focus on language, programming code, and mathematical symbols are not able to achieve mastery of all three domains simultaneously. |
| Approach: | They propose to fuse highly-specialized models that are already sufficiently trained on different domains to achieve a highly-specific model. |
| Outcome: | The proposed model could achieve mastery of the three crucial domains simultaneously. |
Copied to clipboard
| Challenge: | Recent AI methods have shown promise in tasks such as hypothesis generation and experimental design, but they fail to replicate the collaborative nature of real-world scientific practices. |
| Approach: | They propose a virtual scientific system that mimics the collaborative nature of scientific research by organizing a team of agents to generate, evaluate, and refine research ideas. |
| Outcome: | The proposed system outperforms the state-of-the-art method in producing new scientific ideas and offers valuable insights to guide future research. |
Copied to clipboard
| Challenge: | Existing generative approaches struggle with the knowledge gap between visual entity information and the intrinsic parametric knowledge of LLMs. |
| Approach: | They propose a knowledge retrieval method that leverages external sources to enhance visual entity information and a prioritization scheme that handles noisy retrieval results. |
| Outcome: | The proposed method shows improvements of 3.0% to 6.5% across all evaluation metrics compared to baselines. |
Copied to clipboard
| Challenge: | Large language models are successful in answering factoid questions but are also prone to hallucination. |
| Approach: | They propose self-reporting to the model when faced with such limitations. |
| Outcome: | The proposed classifier can detect hallucinations with an 88% success rate and can be used to answer factoid questions with correct answer knowledge. |
Copied to clipboard
| Challenge: | Existing few-shot relation classifiers struggle to distinguish them with few annotated instances due to high co-occurrence of some relations . |
| Approach: | They propose a few-shot relation classification model with two mechanisms to decouple easily-confused relations. |
| Outcome: | The proposed model achieves comparable and even better results to strong baselines in terms of accuracy. |
Copied to clipboard
| Challenge: | Supervised Fine-Tuning (SFT) and Preference Optimization (PO) are key processes for aligning Language Models with human preferences post pre-training. |
| Approach: | They propose to combine Supervised Fine-Tuning and Preference Optimization (PO) with two sub-processes defined at token level within the Markov Decision Process (MDP) |
| Outcome: | The proposed process performs comparably or even superiorly to SFT and some typical PO methods across several tasks, particularly those requires generation, reasoning, and fact-following abilities. |
Copied to clipboard
| Challenge: | Recent work on aspect-level sentiment classification has shown that syntactic information is effective in capturing long-range syntaktic relations that are obscure from the surface form. |
| Approach: | They propose a graph ensemble technique that integrates syntactic structures with GNNs to better leverage syntaktic information in the face of parsing errors. |
| Outcome: | The proposed model outperforms models with single dependency tree and beats other models without adding model parameters. |
Copied to clipboard
| Challenge: | Existing benchmark-based evaluations cannot accurately reflect the performance of real-world applications. |
| Approach: | They propose a reliable strategy for domains to choose more robust LLMs for real-world applications. |
| Outcome: | The proposed strategy addresses the challenges faced by domains to choose more robust LLMs for real-world applications. |
Copied to clipboard
| Challenge: | Existing methods of text detoxification fail to achieve a decent balance between effectiveness and generation quality. |
| Approach: | They propose a text detoxification framework that pays attention to both context and detoxification process. |
| Outcome: | Experiments on various LLMs show that the proposed framework can yield the best performance compared to baselines. |
Copied to clipboard
| Challenge: | Autoregressive (AR) language models are a dominant paradigm in the field of parallelism and non-causal modeling. |
| Approach: | They propose a blockwise discrete diffusion model that preserves AR-compatible serving while enabling parallel intra-block generation. |
| Outcome: | The proposed model achieves theoretical speedups over 5 and wall-clock speedup of 2.3 on H200 GPUs in latency-critical regimes. |
Copied to clipboard
| Challenge: | Abstractive summarization models have been widely used to extract words from source into summary, but how to ensure that important words in source are copied remains a challenge. |
| Approach: | They propose a Transformer-based model to enhance copy mechanism by identifying the importance of each source word based on the degree centrality. |
| Outcome: | The proposed model outperforms baseline methods on CNN/Daily Mail and Gigaword datasets. |
Copied to clipboard
| Challenge: | Existing studies have found that low-rank pre-training often compromises effectiveness. |
| Approach: | They propose to apply low-dimensional module only to the attention layer to improve both effectiveness and efficiency. |
| Outcome: | The proposed model saves 12.4% time while improving test perplexity and on downstream tasks compared with vanilla Transformer. |
Copied to clipboard
| Challenge: | Recent advances in large language models showcase varied multilingual capabilities across tasks . previous assessments focused on fundamental natural language processing (NLP) or isolated capability-specific tasks. |
| Approach: | They propose a multilingual multitask benchmark to assess multilingual capabilities . they use a large-scale benchmark covering fundamental and capability-specialized datasets . |
| Outcome: | The proposed benchmark compares models and tasks across languages and tasks and examines knowledge transfer from English to other languages. |
Copied to clipboard
| Challenge: | a recent study shows that process reward models can make mistakes, leading to wrong conclusions. |
| Approach: | They propose a consensus filtering mechanism that integrates MC estimation with LLM-as-a-judge to improve model performance and data efficiency. |
| Outcome: | The proposed model outperforms existing open-source alternatives and provides practical guidelines for future research. |
Copied to clipboard
| Challenge: | Existing code-related benchmarks focus on single modality rather than visual game development. |
| Approach: | They propose a multimodal benchmark for evaluating code large language models in visual game generation that integrates a clustering-based curation methodology and a pipeline for visual code synthesis. |
| Outcome: | The proposed framework assesses code generation and visual game generation using a sandbox environment. |
Copied to clipboard
| Challenge: | Existing benchmarks for long-form generation assess real-world queries with hard-to-verify metrics or use synthetic setups that overlook real-life intricacies. |
| Approach: | They propose a new approach that balances verifiable and real-world assessment with Target-Anchored Evaluation. |
| Outcome: | The proposed model balances real-world and verifiable assessment with Target-Anchored Evaluation (TAE) it generates queries, textual materials, and anchors based on verifier targets within real-life scenarios . |
Copied to clipboard
| Challenge: | LongInsightBench is the first benchmark designed to assess models’ ability to understand long videos, with a focus on human language, viewpoints, actions, and other contextual elements. |
| Approach: | They propose a benchmark to assess models’ ability to understand long videos with a focus on human language, viewpoints, actions, and other contextual elements. |
| Outcome: | The proposed model excels in three key areas: a) long-duration, human-centric videos; b) diversifying and challenging task scenarios; c) quality assurance pipeline; and d) reliability. |
Copied to clipboard
| Challenge: | Current temporal reasoning datasets are limited to questions about single or isolated events, falling short in mirroring the realistic temporal characteristics involving concurrent nature and intricate temporal interconnections. |
| Approach: | They propose a co-temporal Question Answering benchmark that contains four co-time scenarios with 4,748 samples for evaluating the co-timing abilities of large language models. |
| Outcome: | The proposed benchmarks show that current LLMs struggle on CoTempQA tasks even when enhanced with Chain of Thought methodologies. |
Copied to clipboard
| Challenge: | Existing block-wise discrete diffusion models lack robust autoregressive (AR) decoders. |
| Approach: | They propose a block-wise discrete diffusion framework for large-scale vision-language understanding with a progressive beta noise curriculum. |
| Outcome: | The proposed framework improves training efficiency, convergence stability, and task performance over conventional block diffusion. |
Copied to clipboard
| Challenge: | Prior research focused on developing data generation methods, while insufficient attention has been paid to quality control mechanisms and often produces inaccurate and unhelpful data. |
| Approach: | They propose an algorithm that automatically generates high-quality preference data, eliminating manual annotation requirements. |
| Outcome: | The proposed algorithm outperforms baselines in human preference alignment and reward optimization. |
Copied to clipboard
| Challenge: | Existing work on extending the context length of language models based on Rotary position embedding (RoPE) has shown promising results in capturing longer-range contextual information. |
| Approach: | They propose to use a hidden dimension of an attention head to investigate its contribution to capturing long-distance dependencies. |
| Outcome: | The proposed model can capture long-distance dependencies by extending the attention of a particular dimension of an attention head. |
Copied to clipboard
| Challenge: | Insight is a form of long-term memory for an agent but lack of general insight can undermine its effectiveness. |
| Approach: | They propose an embodied agent that summarises and utilizes insight effectively across different scales and generates task-specific and high-level insight, stores it in a database, and then uses relevant insight from it. |
| Outcome: | The proposed agent outperforms a similar agent when planning by GPT3.5 and is more robust when faced with domain-shifting scenarios. |
Copied to clipboard
| Challenge: | e-commerce product summarization requires consistency between product attributes and summary . inconsistent product summaries can mislead users and decrease public credibility . |
| Approach: | They propose a model to generate e-commerce product summaries with product attributes . they encode product attribute table and constrain attribute words to be presented only through copying . |
| Outcome: | The proposed model significantly improves the faithfulness of e-commerce product summarization tasks. |
Copied to clipboard
| Challenge: | Existing approaches to fine tune LLMs produce unsafe responses and unreliable reasoning, but this solution introduces substantial time and space overhead due to the separate models required. |
| Approach: | They propose to insert extra parameters into transformer architecture to predict calibration signals along with original LLM output. |
| Outcome: | The proposed model reduces time and space costs while enabling seamless online deployment. |
Copied to clipboard
| Challenge: | Existing work cheaply emulates LLMs, allowing users to create profiles for their preferred characters. |
| Approach: | They propose a self-alignment method that encourages an instruction-following LLM to simulate role-play dialogues as a variant of reading comprehension. |
| Outcome: | The proposed model outperforms open-source role-play benchmarks and the roleplay subset of MT-Bench in multiple parameters. |
Copied to clipboard
| Challenge: | Existing knowledge graph embeddings have improved the knowledge graph link prediction task, but complex relations such as N-to-1, 1-to-N and N- to-N remain challenging to predict. |
| Approach: | They propose to extend RotatE from 2D complex domain to high dimensional space with orthogonal transforms to model relations. |
| Outcome: | The proposed method improves on N-to-1, 1-to-N and N- to-N cases while maintaining the capability for modeling symmetric/anti-symmetric, inverse and compositional relations. |
Copied to clipboard
| Challenge: | Existing evaluation frameworks focus on superficial text differences and fail to align with human judgment. |
| Approach: | They propose a new method to evaluate the performance of Large Language Models (LLMs) by calculating probability discrepancies between original response generation and revised versions of LLMs. |
| Outcome: | The proposed method eliminates the need for training an additional evaluation model or relying on external proprietary models such as GPT-4 as a judger. |
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 approaches to scaling test-time compute rely on static compute allocation or sample from fixed generation distributions. |
| Approach: | They propose a test-time compute allocation framework that jointly adapts where computation is spent and how generation is performed. |
| Outcome: | The proposed approach outperforms baselines while consuming less inference-time compute. |
Copied to clipboard
| Challenge: | Existing models for machine reading comprehension are limited to individual chunks due to encoding length constraint. |
| Approach: | They propose a read-over-read method that expands the reading field from chunk to document by predicting regional answers for each chunk. |
| Outcome: | Extensive experiments on QuAC and TriviaQA show that the proposed model performs well for long document reading. |
Copied to clipboard
| Challenge: | In the real world, product attribute values are incomplete and vary over time, which hinders practical applications. |
| Approach: | They propose a multimodal method to jointly predict product attributes and extract values from product images using multimodal product information. |
| Outcome: | The proposed method can predict product attributes and extract values from product images with the help of product images. |
Copied to clipboard
| Challenge: | Existing methods for abstractive summarization use encoder-decoder attention, but this leads to incomplete copying. |
| Approach: | They propose a copying scheme that takes advantage of prior copying distributions and explicitly encourages the model to copy the input word that is relevant to the previously copied one. |
| Outcome: | The proposed scheme achieves state-of-the-art on summarization benchmarks . it takes advantage of prior copying distributions and explicitly encourages copying . |
Copied to clipboard
| Challenge: | Existing state space models (SSMs) address non-uniform sampling, but their recursive structures impede efficient SSM computation via convolution. |
| Approach: | They propose a plug-and-play mechanism to solve the Non-Stable State problem by adjusting input sequences with early memories. |
| Outcome: | The proposed method overcomes the non-uniform sample processing problem . it can achieve Sampling Step Adaptation (SSA) by adjusting input sequences with early memories. |
Copied to clipboard
| Challenge: | a recent study validates the effectiveness of chat language models by fine-tuning instruction data. |
| Approach: | They propose to use a large-scale dataset of instructional conversations to fine-tune a conversational model on instruction data. |
| Outcome: | The proposed model outperforms open-source models in key metrics including scale, average length, diversity, coherence, etc. |
Copied to clipboard
| Challenge: | a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented. |
| Approach: | They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs). |
| Outcome: | The proposed library is based on extensive experiments in a variety of evaluation settings. |
Copied to clipboard
| Challenge: | Instruction tuning is an effective way of aligning large language models with private instruction data. |
| Approach: | They propose a training-free strategy to derive improved emulators from LLMs by using Offsite-Tuning (OFT) they propose CRaSh, which transfers transformer blocks between centralized LLM and downstream emulators . |
| Outcome: | The proposed technique boosts performance of large language models with billions of parameters. |
Copied to clipboard
| Challenge: | Existing models lack task-guided specialized memory mechanisms . specialized generalist models excel at general language tasks but struggle in specialized domains. |
| Approach: | They propose a specialized generalist model with specialized memory and updater that can optimize for specialized domains. |
| Outcome: | The proposed model matches or surpasses baselines on general benchmarks and achieves lowest perplexity across specialized domains. |
Copied to clipboard
| Challenge: | Existing methods for few-shot learning are insufficient to capture task variations in natural language domains. |
| Approach: | They propose an adaptive metric learning approach that automatically determines the best weighted combination from a set of metrics obtained from meta-training tasks for a newly seen few-shot task. |
| Outcome: | The proposed method performs favorably against state-of-the-art few shot learning algorithms on real-world sentiment analysis and dialog intent classification datasets. |