Searcharxiv⌕ Search

arXiv subjects

Ruifeng Yuan

Publications and source records attributed to Ruifeng Yuan.

36 records · Page 2Linked to original sources

VL-Cogito: Progressive Curriculum Reinforcement Learning for Advanced Multimodal Reasoning

Reinforcement learning has proven its effectiveness in enhancing the reasoning capabilities of large language models. Recent research efforts have progressively extended this paradigm to multimodal reasoning tasks. Due to the inherent complexity and diversity of multimodal tasks, especially in semantic content and problem formulations, existing models often exhibit unstable performance across various domains and difficulty levels. To address these limitations, we propose VL-Cogito, an advanced multimodal reasoning model trained via a novel multi-stage Progressive Curriculum Reinforcement Learning (PCuRL) framework. PCuRL systematically guides the model through tasks of gradually increasing difficulty, substantially improving its reasoning abilities across diverse multimodal contexts. The framework introduces two key innovations: (1) an online difficulty soft weighting mechanism, dynamically adjusting training difficulty across successive RL training stages; and (2) a dynamic length reward mechanism, which encourages the model to adaptively regulate its reasoning path length according to task complexity, thus balancing reasoning efficiency with correctness. Experimental evaluations demonstrate that VL-Cogito consistently matches or surpasses existing reasoning-oriented models across mainstream multimodal benchmarks spanning mathematics, science, logic, and general understanding, validating the effectiveness of our approach.

cs.CV↗

Exploring Training and Inference Scaling Laws in Generative Retrieval

Generative retrieval reformulates retrieval as an autoregressive generation task, where large language models (LLMs) generate target documents directly from a query. As a novel paradigm, the mechanisms that underpin its performance and scalability remain largely unexplored. We systematically investigate training and inference scaling laws in generative retrieval, exploring how model size, training data scale, and inference-time compute jointly influence performance. We propose a novel evaluation metric inspired by contrastive entropy and generation loss, providing a continuous performance signal that enables robust comparisons across diverse generative retrieval methods. Our experiments show that n-gram-based methods align strongly with training and inference scaling laws. We find that increasing model size, training data scale, and inference-time compute all contribute to improved performance, highlighting the complementary roles of these factors in enhancing generative retrieval. Across these settings, LLaMA models consistently outperform T5 models, suggesting a particular advantage for larger decoder-only models in generative retrieval. Our findings underscore that model sizes, data availability, and inference computation interact to unlock the full potential of generative retrieval, offering new insights for designing and optimizing future systems.

cs.IR↗

OpenCoder: The Open Cookbook for Top-Tier Code Large Language Models

Large language models (LLMs) for code have become indispensable in various domains, including code generation, reasoning tasks and agent systems. While open-access code LLMs are increasingly approaching the performance levels of proprietary models, high-quality code LLMs suitable for rigorous scientific investigation, particularly those with reproducible data processing pipelines and transparent training protocols, remain limited. The scarcity is due to various challenges, including resource constraints, ethical considerations, and the competitive advantages of keeping models advanced. To address the gap, we introduce OpenCoder, a top-tier code LLM that not only achieves performance comparable to leading models but also serves as an "open cookbook" for the research community. Unlike most prior efforts, we release not only model weights and inference code, but also the reproducible training data, complete data processing pipeline, rigorous experimental ablation results, and detailed training protocols for open scientific research. Through this comprehensive release, we identify the key ingredients for building a top-tier code LLM: (1) code optimized heuristic rules for data cleaning and methods for data deduplication, (2) recall of text corpus related to code and (3) high-quality synthetic data in both annealing and supervised fine-tuning stages. By offering this level of openness, we aim to broaden access to all aspects of a top-tier code LLM, with OpenCoder serving as both a powerful model and an open foundation to accelerate research, and enable reproducible advancements in code AI.

cs.CL↗

Adjoint shape optimization from the continuum to free-molecular gas flows

An adjoint-based shape optimization method for solid bodies subjected to both rarefied and continuum gas flows is proposed. The gas-kinetic BGK equation with the diffuse-reflection boundary condition is used to describe the multiscale gas flows. In the vicinity of the gas-solid interface, a body-fitted mesh is utilized, and the sensitivity with respect to the boundary geometry is analyzed through a combined continuous and discrete adjoint methods. The primal and adjoint governing equations are resolved using efficient multiscale numerical schemes, ensuring the precision of the sensitivity analysis in all flow regimes. The sensitivity data is subsequently integrated into a quasi-Newton optimization algorithm to facilitate rapid convergence towards the optimal solution. Numerical experiments reveal that the discretization of the molecular velocity space can induce sensitivity oscillations; however, these can be effectively eliminated by employing appropriate parameterization of the boundary geometry. In optimizing 2D airfoils for drag reduction under varying degrees of gas rarefaction, our method achieves the optimal solution in just a dozen optimization iterations and within a time frame of 5 to 20 minutes (utilizing parallel computation with 40 to 160 cores), thereby underscoring its exceptional performance and efficiency.

physics.comp-ph↗

Personalized Large Language Model Assistant with Evolving Conditional Memory

With the rapid development of large language models, AI assistants like ChatGPT have become increasingly integrated into people's works and lives but are limited in personalized services. In this paper, we present a plug-and-play framework that could facilitate personalized large language model assistants with evolving conditional memory. The personalized assistant focuses on intelligently preserving the knowledge and experience from the history dialogue with the user, which can be applied to future tailored responses that better align with the user's preferences. Generally, the assistant generates a set of records from the dialogue dialogue, stores them in a memory bank, and retrieves related memory to improve the quality of the response. For the crucial memory design, we explore different ways of constructing the memory and propose a new memorizing mechanism named conditional memory. We also investigate the retrieval and usage of memory in the generation process. We build the first benchmark to evaluate personalized assistants' ability from three aspects. The experimental results illustrate the effectiveness of our method.

cs.CL↗

The Critique of Critique

Critique, as a natural language description for assessing the quality of model-generated content, has played a vital role in the training, evaluation, and refinement of LLMs. However, a systematic method to evaluate the quality of critique is lacking. In this paper, we pioneer the critique of critique, termed MetaCritique, which builds specific quantification criteria. To achieve a reliable evaluation outcome, we propose Atomic Information Units (AIUs), which describe the critique in a more fine-grained manner. MetaCritique aggregates each AIU's judgment for the overall score. Moreover, MetaCritique delivers a natural language rationale for the intricate reasoning within each judgment. Lastly, we construct a meta-evaluation dataset covering 4 tasks across 16 public datasets involving human-written and LLM-generated critiques. Experiments demonstrate that MetaCritique can achieve near-human performance. Our study can facilitate future research in LLM critiques based on our following observations and released resources: (1) superior critiques judged by MetaCritique can lead to better refinements, indicating that it can potentially enhance the alignment of existing LLMs; (2) the leaderboard of critique models reveals that open-source critique models commonly suffer from factuality issues; (3) relevant code and data are publicly available at https://github.com/GAIR-NLP/MetaCritique to support deeper exploration; (4) an API at PyPI with the usage documentation in Appendix C allows users to assess the critique conveniently.

cs.CL↗

Prompt Chaining or Stepwise Prompt? Refinement in Text Summarization

Large language models (LLMs) have demonstrated the capacity to improve summary quality by mirroring a human-like iterative process of critique and refinement starting from the initial draft. Two strategies are designed to perform this iterative process: Prompt Chaining and Stepwise Prompt. Prompt chaining orchestrates the drafting, critiquing, and refining phases through a series of three discrete prompts, while Stepwise prompt integrates these phases within a single prompt. However, the relative effectiveness of the two methods has not been extensively studied. This paper is dedicated to examining and comparing these two methods in the context of text summarization to ascertain which method stands out as the most effective. Experimental results show that the prompt chaining method can produce a more favorable outcome. This might be because stepwise prompt might produce a simulated refinement process according to our various experiments. Since refinement is adaptable to diverse tasks, our conclusions have the potential to be extrapolated to other applications, thereby offering insights that may contribute to the broader development of LLMs.

cs.CL↗

Efficient parallel solver for rarefied gas flow using GSIS

Recently, the general synthetic iterative scheme (GSIS) has been proposed to find the steady-state solution of the Boltzmann equation in the whole range of gas rarefaction, where its fast-converging and asymptotic-preserving properties lead to the significant reduction of iteration numbers and spatial cells in the near-continuum flow regime. However, the efficiency and accuracy of GSIS has only been demonstrated in two-dimensional problems with small numbers of spatial cells and discrete velocities. Here, a large-scale parallel computing strategy is designed to extend the GSIS to three-dimensional flow problems, including the supersonic flows which are usually difficult to solve by the discrete velocity method. Since the GSIS involves the calculation of the mesoscopic kinetic equation which is defined in six-dimensional phase-space, and the macroscopic high-temperature Navier-Stokes-Fourier equations in three-dimensional physical space, the proper partition of the spatial and velocity spaces, and the allocation of CPU cores to the mesoscopic and macroscopic solvers, are the keys to improving the overall computational efficiency. These factors are systematically tested to achieve optimal performance, up to 100 billion spatial and velocity grids. For hypersonic flows around the Apollo reentry capsule, the X38-like vehicle, and the space station, our parallel solver can obtain the converged solution within one hour.

physics.flu-dyn↗

RefGPT: Dialogue Generation of GPT, by GPT, and for GPT

Large Language Models (LLMs) have attained the impressive capability to resolve a wide range of NLP tasks by fine-tuning high-quality instruction data. However, collecting human-written data of high quality, especially multi-turn dialogues, is expensive and unattainable for most people. Though previous studies have used powerful LLMs to generate the dialogues automatically, they all suffer from generating untruthful dialogues because of the model hallucination. Therefore, we propose a method called RefGPT to generate enormous truthful and customized dialogues without worrying about factual errors caused by the model hallucination. RefGPT solves the model hallucination in dialogue generation by restricting the LLMs to leverage the given reference instead of reciting their own knowledge to generate dialogues. Additionally, RefGPT adds detailed controls on every utterance to enable high customization capability, which previous studies have ignored. On the basis of RefGPT, we also propose two high-quality dialogue datasets generated by GPT-4, namely RefGPT-Fact and RefGPT-Code. RefGPT-Fact is a dataset with 100k multi-turn dialogues based on factual knowledge and RefGPT-Code has 76k multi-turn dialogues covering a wide range of coding scenarios. Our code and datasets are released in https://github.com/mutonix/RefGPT.

cs.CL↗

An efficient topology optimization method for steady gas flows in all flow regimes

An efficient topology optimization method applicable to both continuum and rarefied gas flows is proposed in the framework of gas-kinetic theory. The areas of gas and solid are marked by the material density, based on which a fictitious porosity model is used to reflect the effect of the solid on the gas and mimic the diffuse boundary condition on the gas-solid interface. The formula of this fictitious porosity model is modified to make the model work well in all flow regimes, i.e., from the continuum to free-molecular flow regimes. To find the optimized material density, a gradient-based optimizer is adopted and the design sensitivity is obtained by the continuous adjoint method. To solve the primal kinetic equation and the corresponding adjoint equation, the numerical schemes efficient and accurate in all flow regimes are constructed. Several airfoil optimization problems are solved to demonstrate the good performance and high efficiency of the present topology optimization method, covering the flow conditions from continuum to rarefied, and from subsonic to supersonic.

physics.flu-dyn↗

Improving Sentence Similarity Estimation for Unsupervised Extractive Summarization

Unsupervised extractive summarization aims to extract salient sentences from a document as the summary without labeled data. Recent literatures mostly research how to leverage sentence similarity to rank sentences in the order of salience. However, sentence similarity estimation using pre-trained language models mostly takes little account of document-level information and has a weak correlation with sentence salience ranking. In this paper, we proposed two novel strategies to improve sentence similarity estimation for unsupervised extractive summarization. We use contrastive learning to optimize a document-level objective that sentences from the same document are more similar than those from different documents. Moreover, we use mutual learning to enhance the relationship between sentence similarity estimation and sentence salience ranking, where an extra signal amplifier is used to refine the pivotal information. Experimental results demonstrate the effectiveness of our strategies.

cs.CL↗

Few-shot Query-Focused Summarization with Prefix-Merging

Query-focused summarization has been considered as an important extension for text summarization. It aims to generate a concise highlight for a given query. Different from text summarization, query-focused summarization has long been plagued by the problem of lacking high-quality large-scale datasets. In this paper, we investigate the idea that whether we can integrate and transfer the knowledge of text summarization and question answering to assist the few-shot learning in query-focused summarization. Here, we propose prefix-merging, a prefix-based pretraining strategy for few-shot learning in query-focused summarization. Drawn inspiration from prefix-tuning, we are allowed to integrate the task knowledge from text summarization and question answering into a properly designed prefix and apply the merged prefix to query-focused summarization. With only a small amount of trainable parameters, prefix-merging outperforms fine-tuning on query-focused summarization. We further discuss the influence of different prefix designs and propose a visualized explanation for how prefix-merging works.

cs.CL↗

Fact-level Extractive Summarization with Hierarchical Graph Mask on BERT

Most current extractive summarization models generate summaries by selecting salient sentences. However, one of the problems with sentence-level extractive summarization is that there exists a gap between the human-written gold summary and the oracle sentence labels. In this paper, we propose to extract fact-level semantic units for better extractive summarization. We also introduce a hierarchical structure, which incorporates the multi-level of granularities of the textual information into the model. In addition, we incorporate our model with BERT using a hierarchical graph mask. This allows us to combine BERT's ability in natural language understanding and the structural information without increasing the scale of the model. Experiments on the CNN/DaliyMail dataset show that our model achieves state-of-the-art results.

cs.CL↗

A multiscale discrete velocity method for model kinetic equations

In this paper, authors focus effort on improving the conventional discrete velocity method (DVM) into a multiscale scheme in finite volume framework for gas flow in all flow regimes. Unlike the typical multiscale kinetic methods unified gas-kinetic scheme (UGKS) and discrete unified gas-kinetic scheme (DUGKS), which concentrate on the evolution of the distribution function at the cell interface, in the present scheme the flux for macroscopic variables is split into the equilibrium part and the nonequilibrium part, and the nonequilibrium flux is calculated by integrating the discrete distribution function at the cell center, which overcomes the excess numerical dissipation of the conventional DVM in the continuum flow regime. Afterwards, the macroscopic variables are finally updated by simply integrating the discrete distribution function at the cell center, or by a blend of the increments based on the macroscopic and the microscopic systems, and the multiscale property is achieved. Several test cases, involving unsteady, steady, high speed, low speed gas flows in all flow regimes, have been performed, demonstrating the good performance of the multiscale DVM from free molecule to continuum Navier-Stokes solutions and the multiscale property of the scheme is proved.

physics.comp-ph↗

A multi-prediction implicit scheme for steady state solutions of gas flow in all flow regimes

An implicit multiscale method with multiple macroscopic prediction for steady state solutions of gas flow in all flow regimes is presented. The method is based on the finite volume discrete velocity method (DVM) framework. At the cell interface a multiscale flux with a construction similar to discrete unified gas-kinetic scheme (DUGKS) is adopted. The idea of the macroscopic variable prediction is further developed and a multiple prediction structure is formed. A prediction scheme is constructed to give a predicted macroscopic variable based on the macroscopic residual, and the convergence is accelerated greatly in the continuum flow regime. Test cases show the present method is one order of magnitude faster than the previous implicit multiscale scheme in the continuum flow regime.

physics.comp-ph↗

A conservative discrete velocity method for the ellipsoidal Fokker-Planck equation in gas-kinetic theory

A conservative discrete velocity method (DVM) is developed for the ellipsoidal Fokker-Planck (ES-FP) equation in prediction of non-equilibrium neutral gas flows in this paper. The ES-FP collision operator is solved in discrete velocity space in a concise and quick finite difference framework. The conservation problem of discrete ES-FP collision operator is solved by multiplying each term in it by extra conservative coefficients whose values are very closed to unity. Their differences to unity are in the same order of the numerical error in approximating the ES-FP operator in discrete velocity space. All the macroscopic conservative variables (mass, momentum and energy) are conserved in the present modified discrete ES-FP collision operator. Since the conservation property in discrete element of physical space is very important for numerical scheme when discontinuity and large gradient exist in flow field, a finite volume framework is adopted for the transport term of ES-FP equation. For $nD$-$3V$ ($n<3$) cases, a $nD$-quasi $nV$ reduction is specially proposed for ES-FP equation and the corresponding FP-DVM method, which can greatly reduce the computational cost. The validity and accuracy of both ES-FP equation and FP-DVM method are examined using a series of $0D$-$3V$ homogenous relaxation cases and $1D$-$3V$ shock structure cases with different $Mach$ numbers, in which $1D$-$3V$ cases are reduced to $1D$-quasi $1V$ cases. Both the predictions of $0D$-$3V$ and $1D$-$3V$ cases match well with the benchmark results such as analytical Boltzmann solution, direct full-Boltzmann numerical solution and DSMC result. Especially, the FP-DVM predictions match well with the DSMC results in the $Mach$ 8.0 shock structure case, which is in high non-equilibrium, and is a challenge case of the model Boltzmann equation and the corresponding numerical methods.

physics.comp-ph↗

A conservative implicit scheme for steady state solutions of diatomic gas flow in all flow regimes

An implicit scheme for steady state solutions of diatomic gas flow is presented. The method solves the Rykov model equation in the finite volume discrete velocity method (DVM) framework, in which the translational and rotational degrees of freedom are taken into account. At the cell interface, a difference scheme of the model equation is used to construct a multiscale flux (similar to discrete unified gas-kinetic scheme (DUGKS)), so that the cell size is not constrained by the cell Knudsen (Kn) number. The physical local time step is implemented to preserve the multiscale property in the nonuniform-mesh case. The implicit macroscopic prediction technique is adopted to find a predicted equilibrium state at each time level and the implicit macroscopic governing equation is solved along with the implicit microscopic system. Furthermore, an efficient integral error compensation technique is applied, which makes the scheme conservative and allows more flexible discretization for particle velocity space. In the test cases, the unstructured velocity-space mesh is used, the present method is proved to be efficient and accurate.

physics.comp-ph↗

An immersed-boundary method for compressible viscous flow and its application in gas-kinetic BGK scheme

An immersed-boundary (IB) method is proposed and applied in the gas-kinetic BGK scheme to simulate incompressible/compressible viscous flow with stationary/moving boundary. In present method the ghost-cell technique is adopted to fulfill the boundary condition on the immersed boundary. A novel idea "local boundary determination" is put forward to identify the ghost cells, each of which may have several different ghost-cell constructions corresponding to different boundary segments, thus eliminating the singularity of the ghost cell. Furthermore, the so-called "fresh-cell" problem when implementing the IB method in moving-boundary simulation is resolved by a simple extrapolation in time. The method is firstly applied in the gas-kinetic BGK scheme to simulate the Taylor-Couette flow, where the second-order spatial accuracy of the method is validated and the "super-convergence" of the BGK scheme is observed. Then the test cases of supersonic flow around a stationary cylinder, incompressible flow around an oscillating cylinder and compressible flow around a moving airfoil are conducted to verify the capability of the present method in simulating compressible flows and handling the moving boundary.

physics.comp-ph↗