Searcharxiv⌕ Search

arXiv subjects

Hua Wu

Publications and source records attributed to Hua Wu.

At least 73 records · Page 4Linked to original sources

MA-RLHF: Reinforcement Learning from Human Feedback with Macro Actions

Reinforcement learning from human feedback (RLHF) has demonstrated effectiveness in aligning large language models (LLMs) with human preferences. However, token-level RLHF suffers from the credit assignment problem over long sequences, where delayed rewards make it challenging for the model to discern which actions contributed to preferred outcomes. This hinders learning efficiency and slows convergence.In this paper, we propose MA-RLHF, a simple yet effective RLHF framework that incorporates macro actions -- sequences of tokens or higher-level language constructs -- into the learning process. By operating at higher level of abstraction, our approach reduces the temporal distance between actions and rewards, facilitating faster and more accurate credit assignment. This results in more stable policy gradient estimates and enhances learning efficiency within each episode, all without increasing computational complexity during training or inference. We validate our approach through extensive experiments across various model sizes and tasks, including text summarization, dialogue generation, question answering, and program synthesis. Our method achieves substantial performance improvements over standard RLHF, with performance gains of up to 30% in text summarization and code generation, 18% in dialogue, and 8% in question answering tasks. Notably, our approach reaches parity with vanilla RLHF 1.7 ~ 2 times faster in terms of training time and continues to outperform it with further training. We make our code and data publicly available at https://github.com/ernie-research/MA-RLHF.

cs.CL↗

Mixture of Hidden-Dimensions Transformer

Transformer models encounter challenges in scaling hidden dimensions efficiently, as uniformly increasing them inflates computational and memory costs while failing to emphasize the most relevant features for each token. For further understanding, we study hidden dimension sparsity and observe that trained Transformers utilize only a small fraction of token dimensions, revealing an "activation flow" pattern. Notably, there are shared sub-dimensions with sustained activation across multiple consecutive tokens and specialized sub-dimensions uniquely activated for each token. To better model token-relevant sub-dimensions, we propose MoHD (Mixture of Hidden Dimensions), a sparse conditional activation architecture. Particularly, MoHD employs shared sub-dimensions for common token features and a routing mechanism to dynamically activate specialized sub-dimensions. To mitigate potential information loss from sparsity, we design activation scaling and group fusion mechanisms to preserve activation flow. In this way, MoHD expands hidden dimensions with negligible increases in computation or parameters, efficient training and inference while maintaining performance. Evaluations across 10 NLP tasks show that MoHD surpasses Vanilla Transformers in parameter efficiency and task performance. It achieves 1.7% higher performance with 50% fewer activation parameters and 3.7% higher performance with a 3x parameter expansion at constant activation cost. MOHD offers a new perspective for scaling the model, showcasing the potential of hidden dimension sparsity to boost efficiency

cs.CL↗

Investigating the Factual Knowledge Boundary of Large Language Models with Retrieval Augmentation

Large language models (LLMs) have shown impressive prowess in solving a wide range of tasks with world knowledge. However, it remains unclear how well LLMs are able to perceive their factual knowledge boundaries, particularly under retrieval augmentation settings. In this study, we present the first analysis on the factual knowledge boundaries of LLMs and how retrieval augmentation affects LLMs on open-domain question answering (QA), with a bunch of important findings. Specifically, we focus on three research questions and analyze them by examining QA, priori judgement and posteriori judgement capabilities of LLMs. We show evidence that LLMs possess unwavering confidence in their knowledge and cannot handle the conflict between internal and external knowledge well. Furthermore, retrieval augmentation proves to be an effective approach in enhancing LLMs' awareness of knowledge boundaries. We further conduct thorough experiments to examine how different factors affect LLMs and propose a simple method to dynamically utilize supporting documents with our judgement strategy. Additionally, we find that the relevance between the supporting documents and the questions significantly impacts LLMs' QA and judgemental capabilities. The code to reproduce this work is available at https://github.com/RUCAIBox/LLM-Knowledge-Boundary.

cs.CL↗

Bright dipolar excitons in twisted black phosphorus homostructures

Bright dipolar excitons, which contain electrical dipoles and have high oscillator strength, are an ideal platform for studying correlated quantum phenomena. They usually rely on carrier tunneling between two quantum wells or two layers to hybridize with nondipolar excitons to gain oscillator strength. In this work, we uncovered a new type of bright infrared dipolar exciton by stacking 90°-twisted black phosphorus (BP) structures. These excitons, inherent to the reconstructed band structure, exhibit high oscillator strength. Most importantly, they inherit the linear polarization from BP, which allows light polarization to be used to select the dipole direction. Moreover, the dipole moment and resonance energy can be widely tuned by the thickness of the BP. Our results demonstrate a useful platform for exploring tunable correlated dipolar excitons.

cond-mat.mes-hall↗

Quantum spin Hall effect protected by spin U(1) quasisymmetry

Quantum spin Hall (QSH) effect, where electrons with opposite spin channels are deflected to opposite sides of a two-dimensional system with a quantized conductance, was believed to be characterized by a nontrivial topological index $Z_{2}$. However, spin mixing effects in realistic materials often lead to deviation of the spin Hall conductance from exact quantization. In this Letter, we present a universal symmetry indicator for diagnosing QSH effect in realistic materials, termed spin U(1) quasisymmetry. Such a symmetry eliminates the first-order spin-mixing perturbation and thus protects the near-quantization of SHC, applicable to time-reversal-preserved cases with either $Z_{2}=1$ or $Z_{2}=0$, as well as time-reversal-broken scenarios. We propose that spin U(1) quasisymmetry is hidden in the subspace spanned by the doublets with unquenched orbital momentum and emerges when SOC is present, which can be realized in 19 crystallographic point groups. Particularly, we identify a previous overlooked even spin Chern phase with a trivial $Z_{2}$ index as an ideal platform for achieving a near-double-quantized SHC, as exemplified by twisted bilayer transition metal dichalcogenides and monolayer RuBr$_{3}$. Our work offers a new perspective for understanding QSH effect and significantly expands the material pool for the screening of exemplary material candidates.

cond-mat.mtrl-sci↗

On Training Data Influence of GPT Models

Amidst the rapid advancements in generative language models, the investigation of how training data shapes the performance of GPT models is still emerging. This paper presents GPTfluence, a novel approach that leverages a featurized simulation to assess the impact of training examples on the training dynamics of GPT models. Our approach not only traces the influence of individual training instances on performance trajectories, such as loss and other key metrics, on targeted test points but also enables a comprehensive comparison with existing methods across various training scenarios in GPT models, ranging from 14 million to 2.8 billion parameters, across a range of downstream tasks. Contrary to earlier methods that struggle with generalization to new data, GPTfluence introduces a parameterized simulation of training dynamics, demonstrating robust generalization capabilities to unseen training data. This adaptability is evident across both fine-tuning and instruction-tuning scenarios, spanning tasks in natural language understanding and generation. We make our code and data publicly available at https://github.com/ernie-research/gptfluence.

cs.CL↗

Autoregressive Pre-Training on Pixels and Texts

The integration of visual and textual information represents a promising direction in the advancement of language models. In this paper, we explore the dual modality of language--both visual and textual--within an autoregressive framework, pre-trained on both document images and texts. Our method employs a multimodal training strategy, utilizing visual data through next patch prediction with a regression head and/or textual data through next token prediction with a classification head. We focus on understanding the interaction between these two modalities and their combined impact on model performance. Our extensive evaluation across a wide range of benchmarks shows that incorporating both visual and textual data significantly improves the performance of pixel-based language models. Remarkably, we find that a unidirectional pixel-based model trained solely on visual data can achieve comparable results to state-of-the-art bidirectional models on several language understanding tasks. This work uncovers the untapped potential of integrating visual and textual modalities for more effective language modeling. We release our code, data, and model checkpoints at \url{https://github.com/ernie-research/pixelgpt}.

cs.CL↗

Upcycling Instruction Tuning from Dense to Mixture-of-Experts via Parameter Merging

Mixture-of-Experts (MoE) shines brightly in large language models (LLMs) and demonstrates outstanding performance in plentiful natural language processing tasks. However, existing methods transforming LLMs from dense to MoE face significant data requirements and typically rely on large-scale post-training. In this paper, we propose Upcycling Instruction Tuning (UpIT), a data-efficient approach for tuning a dense pre-trained model into a MoE instruction model. Specifically, we first point out that intermediate checkpoints during instruction tuning of the dense model are naturally suitable for specialized experts, and then propose an expert expansion stage to flexibly achieve models with flexible numbers of experts, where genetic algorithm and parameter merging are introduced to ensure sufficient diversity of new extended experts. To ensure that each specialized expert in the MoE model works as expected, we select a small amount of seed data that each expert excels to pre-optimize the router. Extensive experiments with various data scales and upcycling settings demonstrate the outstanding performance and data efficiency of UpIT, as well as stable improvement in expert or data scaling. Further analysis reveals the importance of ensuring expert diversity in upcycling.

cs.CL↗

NACL: A General and Effective KV Cache Eviction Framework for LLMs at Inference Time

Large Language Models (LLMs) have ignited an innovative surge of AI applications, marking a new era of exciting possibilities equipped with extended context windows. However, hosting these models is cost-prohibitive mainly due to the extensive memory consumption of KV Cache involving long-context modeling. Despite several works proposing to evict unnecessary tokens from the KV Cache, most of them rely on the biased local statistics of accumulated attention scores and report performance using unconvincing metric like perplexity on inadequate short-text evaluation. In this paper, we propose NACL, a general framework for long-context KV cache eviction that achieves more optimal and efficient eviction in a single operation during the encoding phase. Due to NACL's efficiency, we combine more accurate attention score statistics in PROXY TOKENS EVICTION with the diversified random eviction strategy of RANDOM EVICTION, aiming to alleviate the issue of attention bias and enhance the robustness in maintaining pivotal tokens for long-context modeling tasks. Notably, our method significantly improves the performance on short- and long-text tasks by 80% and 76% respectively, reducing KV Cache by up to 50% with over 95% performance maintenance. The code is available at https://github.com/PaddlePaddle/Research/tree/master/NLP/ACL2024-NACL.

cs.CL↗

Orbital doublet driven even-spin Chern insulators

Quantum spin Hall insulators hosting edge spin currents hold great potential for low-power spintronic devices. In this paper, we present a universal approach to achieve a high and near-quantized spin Hall conductance plateau within a sizable bulk gap. Using a nonmagnetic four-band model Hamiltonian, we demonstrate that an even-spin Chern (ESC) insulator can be accessed by tuning the sign of spin-orbit coupling (SOC) within a crystal symmetry-enforced orbital doublet. With the assistance of a high spin Chern number of $C_{S}=-2$ and spin $U$(1) quasisymmetry, this orbital-doublet-driven ESC phase is endowed with the near-double-quantized spin Hall conductance. We identify 12 crystallographic point groups supporting such a sign-tunable SOC. Furthermore, we apply our theory to realistic examples, and show the phase transition from a trivial insulator governed by positive SOC in the RuI$_{3}$ monolayer to an ESC insulator dominated by negative SOC in the RuBr$_{3}$ monolayer. This orbital-doublet-driven ESC insulator, RuBr$_{3}$, showcases nontrivial characteristics including helical edge states, near-double-quantized spin Hall conductance, and robust corner states. Our work provides different pathways in the pursuit of the long-sought quantum spin Hall insulators.

cond-mat.mtrl-sci↗

Understanding the Ising zigzag antiferromagnetism of FePS3 and FePSe3 monolayers

This study investigates the spin-orbital states of FePS3 and FePSe3 monolayers and the origin of their Ising zigzag AFM, using DFT, crystal field level diagrams, superexchange analyses, and parallel tempering MC simulations. Our calculations show that under the trigonal elongation of the FeS6 (FeSe6) octahedra, the $e_g^π$ doublet of the Fe 3d crystal field levels lies lower than the $a_{1g}$ singlet by about 108 meV (123 meV), which is much larger than the strength of Fe 3d SOC. Then, the half-filled minority-spin $e_g^π$ doublet of the high-spin Fe$^{2+}$ ions ($d^{5\uparrow,1\downarrow}$) splits by the SOC into the lower $L_{z+}$ and higher $L_{z-}$ states. The spin-orbital ground state $d^{5\uparrow}$$L_{z+}^{1\downarrow}$ formally with $S_z$ = 2 and $L_z$ = 1 gives the large z-axis spin/orbital moments of 3.51/0.76 $μ_{B}$ (3.41/0.67 $μ_{B}$) for FePS$_3$ (FePSe$_3$) monolayer, and both the moments are reduced by the strong (stronger) Fe 3d hybridizations with S 3p (Se 4p) states. As a result, FePS3 (FePSe3) monolayer has a huge perpendicular single-ion anisotropy energy of 19.4 meV (14.9 meV), giving an Ising-type magnetism. Moreover, via the maximally localized Wannier functions, we find that the first nearest neighboring (1NN) Fe-Fe pair has large hopping parameters in between some specific orbitals, and so does the 3NN Fe-Fe pair. In contrast, the 2NN Fe-Fe pair has much smaller hopping parameters and the 4NN Fe-Fe pair has negligibly small ones. Then, a combination of those hopping parameters and the superexchange picture can readily explain the computed strong 1NN ferromagnetic coupling and the strong 3NN antiferromagnetic one but the relatively much smaller 2NN antiferromagnetic coupling. Furthermore, our PTMC simulations give TN of 119 K for FePS3 monolayer and also predict for FePSe3 monolayer the same magnetic structure with a close or even higher TN.

cond-mat.mtrl-sci↗

Exploring the Causality of End-to-End Autonomous Driving

Deep learning-based models are widely deployed in autonomous driving areas, especially the increasingly noticed end-to-end solutions. However, the black-box property of these models raises concerns about their trustworthiness and safety for autonomous driving, and how to debug the causality has become a pressing concern. Despite some existing research on the explainability of autonomous driving, there is currently no systematic solution to help researchers debug and identify the key factors that lead to the final predicted action of end-to-end autonomous driving. In this work, we propose a comprehensive approach to explore and analyze the causality of end-to-end autonomous driving. First, we validate the essential information that the final planning depends on by using controlled variables and counterfactual interventions for qualitative analysis. Then, we quantitatively assess the factors influencing model decisions by visualizing and statistically analyzing the response of key model inputs. Finally, based on the comprehensive study of the multi-factorial end-to-end autonomous driving system, we have developed a strong baseline and a tool for exploring causality in the close-loop simulator CARLA. It leverages the essential input sources to obtain a well-designed model, resulting in highly competitive capabilities. As far as we know, our work is the first to unveil the mystery of end-to-end autonomous driving and turn the black box into a white one. Thorough close-loop experiments demonstrate that our method can be applied to end-to-end autonomous driving solutions for causality debugging. Code will be available at https://github.com/bdvisl/DriveInsight.

cs.CV↗

HFT: Half Fine-Tuning for Large Language Models

Large language models (LLMs) with one or more fine-tuning phases have become a necessary step to unlock various capabilities, enabling LLMs to follow natural language instructions or align with human preferences. However, it carries the risk of catastrophic forgetting during sequential training, the parametric knowledge or the ability learned in previous stages may be overwhelmed by incoming training data. In this paper, we find that by regularly resetting partial parameters, LLMs can restore some of the original knowledge. Inspired by this, we introduce Half Fine-Tuning (HFT) for LLMs, as a substitute for full fine-tuning (FFT), to mitigate the forgetting issues, where half of the parameters are selected to learn new tasks while the other half are frozen to remain previous knowledge. We provide a feasibility analysis from the perspective of optimization and interpret the parameter selection operation as a regularization term. Without changing the model architecture, HFT could be seamlessly integrated into existing fine-tuning frameworks. Extensive experiments and analysis on supervised fine-tuning, direct preference optimization, and continual learning consistently demonstrate the effectiveness, robustness, and efficiency of HFT. Compared with FFT, HFT not only significantly alleviates the forgetting problem, but also achieves the best performance in a series of downstream benchmarks, with an approximately 30% reduction in training time.

cs.CL↗

BASES: Large-scale Web Search User Simulation with Large Language Model based Agents

Due to the excellent capacities of large language models (LLMs), it becomes feasible to develop LLM-based agents for reliable user simulation. Considering the scarcity and limit (e.g., privacy issues) of real user data, in this paper, we conduct large-scale user simulation for web search, to improve the analysis and modeling of user search behavior. Specially, we propose BASES, a novel user simulation framework with LLM-based agents, designed to facilitate comprehensive simulations of web search user behaviors. Our simulation framework can generate unique user profiles at scale, which subsequently leads to diverse search behaviors. To demonstrate the effectiveness of BASES, we conduct evaluation experiments based on two human benchmarks in both Chinese and English, demonstrating that BASES can effectively simulate large-scale human-like search behaviors. To further accommodate the research on web search, we develop WARRIORS, a new large-scale dataset encompassing web search user behaviors, including both Chinese and English versions, which can greatly bolster research in the field of information retrieval. Our code and data will be publicly released soon.

cs.IR↗

Tool-Augmented Reward Modeling

Reward modeling (a.k.a., preference modeling) is instrumental for aligning large language models with human preferences, particularly within the context of reinforcement learning from human feedback (RLHF). While conventional reward models (RMs) have exhibited remarkable scalability, they oft struggle with fundamental functionality such as arithmetic computation, code execution, and factual lookup. In this paper, we propose a tool-augmented preference modeling approach, named Themis, to address these limitations by empowering RMs with access to external environments, including calculators and search engines. This approach not only fosters synergy between tool utilization and reward grading but also enhances interpretive capacity and scoring reliability. Our study delves into the integration of external tools into RMs, enabling them to interact with diverse external sources and construct task-specific tool engagement and reasoning traces in an autoregressive manner. We validate our approach across a wide range of domains, incorporating seven distinct external tools. Our experimental results demonstrate a noteworthy overall improvement of 17.7% across eight tasks in preference ranking. Furthermore, our approach outperforms Gopher 280B by 7.3% on TruthfulQA task in zero-shot evaluation. In human evaluations, RLHF trained with Themis attains an average win rate of 32% when compared to baselines across four distinct tasks. Additionally, we provide a comprehensive collection of tool-related RM datasets, incorporating data from seven distinct tool APIs, totaling 15,000 instances. We have made the code, data, and model checkpoints publicly available to facilitate and inspire further research advancements\footnote{\url{https://github.com/ernie-research/Tool-Augmented-Reward-Model}}.

cs.CL↗

Towards Boosting Many-to-Many Multilingual Machine Translation with Large Language Models

The training paradigm for machine translation has gradually shifted, from learning neural machine translation (NMT) models with extensive parallel corpora to instruction finetuning on multilingual large language models (LLMs) with high-quality translation pairs. In this paper, we focus on boosting many-to-many multilingual translation of LLMs with an emphasis on zero-shot translation directions. We demonstrate that prompt strategies adopted during finetuning are crucial to zero-shot translation and introduce a cross-lingual consistency regularization, XConST, to bridge the representation gap among different languages and improve zero-shot translation performance. XConST is not a new method, but a version of CrossConST (Gao et al., 2023a) adapted for translation instruction finetuning with LLMs. Experimental results on ALMA (Xu et al., 2023), Tower (Team, 2024), and LLaMA-2 (Touvron et al., 2023) show that our approach consistently improves translation performance. Our implementations are available at https://github.com/gpengzhi/CrossConST-LLM.

cs.CL↗

Superexchange interactions and magnetic anisotropy in MnPSe$_3$ monolayer

Two-dimensional van der Waals magnetic materials are of great current interest for their promising applications in spintronics. In this work, using density functional theory calculations in combination with the maximally localized Wannier functions method and the magnetic anisotropy analyses, we study the electronic and magnetic properties of MnPSe$_3$ monolayer. Our results show that it is a charge transfer antiferromagnetic (AF) insulator. For this Mn$^{2+}$ $3d^5$ system, although it seems straightforward to explain the AF ground state using the direct exchange, we find that the near 90$^\circ$ Mn-Se-Mn charge transfer type superexchange plays a dominant role in stabilizing the AF ground state. Moreover, our results indicate that although the shape anisotropy favors an out-of-plane spin orientation, the spin-orbit coupling (SOC) leads to the experimentally observed in-plane spin orientation. We prove that the actual dominant contribution to the magnetic anisotropy comes from the second-order perturbation of the SOC, by analyzing its distribution over the reciprocal space. Using the AF exchange and anisotropy parameters obtained from our calculations, our Monte Carlo simulations give the Néel temperature $T_{\rm N}=47$ K for MnPSe$_3$ monolayer, which agrees with the experimental 40 K. Furthermore, our calculations show that under a uniaxial tensile (compressive) strain, Néel vector would be parallel (perpendicular) to the strain direction, which well reproduces the recent experiments. We also predict that $T_{\rm N}$ would be increased by a compressive strain.

cond-mat.mtrl-sci↗

DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing

Graph Neural Networks (GNNs) have shown great power for learning and mining on graphs, and Graph Structure Learning (GSL) plays an important role in boosting GNNs with a refined graph. In the literature, most GSL solutions either primarily focus on structure refinement with task-specific supervision (i.e., node classification), or overlook the inherent weakness of GNNs themselves (e.g., over-squashing), resulting in suboptimal performance despite sophisticated designs. In light of these limitations, we propose to study self-supervised graph structure-feature co-refinement for effectively alleviating the issue of over-squashing in typical GNNs. In this paper, we take a fundamentally different perspective of the Ricci curvature in Riemannian geometry, in which we encounter the challenges of modeling, utilizing and computing Ricci curvature. To tackle these challenges, we present a self-supervised Riemannian model, DeepRicci. Specifically, we introduce a latent Riemannian space of heterogeneous curvatures to model various Ricci curvatures, and propose a gyrovector feature mapping to utilize Ricci curvature for typical GNNs. Thereafter, we refine node features by geometric contrastive learning among different geometric views, and simultaneously refine graph structure by backward Ricci flow based on a novel formulation of differentiable Ricci curvature. Finally, extensive experiments on public datasets show the superiority of DeepRicci, and the connection between backward Ricci flow and over-squashing. Codes of our work are given in https://github.com/RiemanGraph/.

cs.LG↗