Searcharxiv⌕ Search

arXiv subjects

Jie Lou

Publications and source records attributed to Jie Lou.

At least 37 records · Page 2Linked to original sources

On-Policy Self-Alignment with Fine-grained Knowledge Feedback for Hallucination Mitigation

Hallucination occurs when large language models exhibit behavior that deviates from the boundaries of their knowledge during response generation. To address this critical issue, previous learning-based methods attempt to finetune models but are limited by off-policy sampling and coarse-grained feedback. In this paper, we present \textit{\b{R}einforcement \b{L}earning \b{f}or \b{H}allucination} (RLFH), an on-policy self-alignment approach that enables LLMs to actively explore their knowledge boundaries and self-correct generation behavior through fine-grained feedback signals. RLFH introduces a self-assessment framework where the policy serves as its own judge. Through this framework, responses are automatically decomposed into atomic facts and their truthfulness and informativeness are assessed against external knowledge sources. The resulting fine-grained feedback at the statement level are then converted into token-level dense reward signals. This enables online reinforcement learning to achieve precise and timely optimization without human intervention. Comprehensive evaluations on HotpotQA, SQuADv2, and Biography benchmarks validate RLFH's effectiveness in hallucination mitigation.

cs.CL↗

Cheems: A Practical Guidance for Building and Evaluating Chinese Reward Models from Scratch

Reward models (RMs) are crucial for aligning large language models (LLMs) with human preferences. However, most RM research is centered on English and relies heavily on synthetic resources, which leads to limited and less reliable datasets and benchmarks for Chinese. To address this gap, we introduce CheemsBench, a fully human-annotated RM evaluation benchmark within Chinese contexts, and CheemsPreference, a large-scale and diverse preference dataset annotated through human-machine collaboration to support Chinese RM training. We systematically evaluate open-source discriminative and generative RMs on CheemsBench and observe significant limitations in their ability to capture human preferences in Chinese scenarios. Additionally, based on CheemsPreference, we construct an RM that achieves state-of-the-art performance on CheemsBench, demonstrating the necessity of human supervision in RM training. Our findings reveal that scaled AI-generated data struggles to fully capture human preferences, emphasizing the importance of high-quality human supervision in RM development.

cs.CL↗

Exploring Implicit Visual Misunderstandings in Multimodal Large Language Models through Attention Analysis

Recent advancements have enhanced the capability of Multimodal Large Language Models (MLLMs) to comprehend multi-image information. However, existing benchmarks primarily evaluate answer correctness, overlooking whether models genuinely comprehend the visual input. To address this, we define implicit visual misunderstanding (IVM), where MLLMs provide correct answers without fully comprehending the visual input. Through our analysis, we decouple the visual and textual modalities within the causal attention module, revealing that attention distribution increasingly converges on the image associated with the correct answer as the network layers deepen. This insight leads to the introduction of a scale-agnostic metric, \textit{attention accuracy}, and a novel benchmark for quantifying IVMs. Attention accuracy directly evaluates the model's visual understanding via internal mechanisms, remaining robust to positional biases for more reliable assessments. Furthermore, we extend our approach to finer granularities and demonstrate its effectiveness in unimodal scenarios, underscoring its versatility and generalizability.

cs.CV↗

The Devil Is in the Details: Tackling Unimodal Spurious Correlations for Generalizable Multimodal Reward Models

Multimodal Reward Models (MM-RMs) are crucial for aligning Large Language Models (LLMs) with human preferences, particularly as LLMs increasingly interact with multimodal data. However, we find that MM-RMs trained on existing datasets often struggle to generalize to out-of-distribution data due to their reliance on unimodal spurious correlations, primarily text-only shortcuts within the training distribution, which prevents them from leveraging true multimodal reward functions. To address this, we introduce a Shortcut-aware MM-RM learning algorithm that mitigates this issue by dynamically reweighting training samples, shifting the distribution toward better multimodal understanding, and reducing dependence on unimodal spurious correlations. Our experiments demonstrate significant improvements in generalization, downstream task performance, and scalability, establishing a more robust framework for multimodal reward modeling.

cs.CL↗

Ground State Phase Diagram of $\text{SU}(3)$ $t$-$J$ Chain

Distinct from the $\text{SU}(2)$ case, the fermionic systems with $\text{SU}(N)$ symmetry are expected to exhibit novel physics, such as exotic singlet formation. Using the density matrix renormalization group technique, we obtain the ground state phase diagram of the $\text{SU}(3)$ $t$-$J$ chain for density $n<1$. The ground state phase diagram includes the Luttinger liquid, the extended Luther-Emery liquid characterized by a spin gap, and the phase separation state. We quantitatively assess the characteristics of the three phases by measuring spin gap, compressibility, various correlation functions and structure factors. We further study the extended Luther-Emery liquid phase and discover molecular superfluid quasi-long-range order. The mechanism of the molecular superfluid is the combination of three $\text{SU}(3)$ fermions on sites that are not completely connected. Accordingly, we can speculate the behavior of the $\text{SU}(N)$ $t$-$J$ chain model with larger $N$ values, operating within the same filling regime.

cond-mat.str-el↗

Floquet-Engineered Hybrid Topological Orders with Majorana Edge Modes in Number-Conserving Fermionic Quantum Simulators

We develop an experimental protocol based on Floquet-engineered ultracold fermions in optical lattices, enabling the emulation of pair-hopping and competing singlet/triplet pairing interactions. Through large-scale density matrix renormalization group (DMRG) simulations, we uncover three emergent topological phases: (i) A Majorana-enabled spin-density-wave (MS) phase featuring exponentially localized edge charges, non-local fermionic edge correlations, and doubly degenerate entanglement spectra; (ii) A z-axis polarized triplet superconducting (TS) phase exhibiting fractionalized edge spins (S=1/4 per edge), two-fold ground state degeneracy and a bulk single-particle gap; (iii) A hybrid x-directional triplet superconducting (XTS) phase that uniquely combines fractional spin textures and Majorana-type edge correlations, defining a new universality class of hybrid orders in number-conserving systems. These findings establish a universal framework for engineering non-Abelian topological matter, crucially bypassing the need for external pairing fields while maintaining experimental feasibility with current cold-atom techniques.

cond-mat.quant-gas↗

MLLM-Selector: Necessity and Diversity-driven High-Value Data Selection for Enhanced Visual Instruction Tuning

Visual instruction tuning (VIT) has emerged as a crucial technique for enabling multi-modal large language models (MLLMs) to follow user instructions adeptly. Yet, a significant gap persists in understanding the attributes of high-quality instruction tuning data and frameworks for its automated selection. To address this, we introduce MLLM-Selector, an automated approach that identifies valuable data for VIT by weighing necessity and diversity. Our process starts by randomly sampling a subset from the VIT data pool to fine-tune a pretrained model, thus creating a seed model with an initial ability to follow instructions. Then, leveraging the seed model, we calculate necessity scores for each sample in the VIT data pool to identify samples pivotal for enhancing model performance. Our findings underscore the importance of mixing necessity and diversity in data choice, leading to the creation of MLLM-Selector, our methodology that fuses necessity scoring with strategic sampling for superior data refinement. Empirical results indicate that within identical experimental conditions, MLLM-Selector surpasses LLaVA-1.5 in some benchmarks with less than 1% of the data and consistently exceeds performance across all validated benchmarks when using less than 50%.

cs.CV↗

EDEA: Efficient Dual-Engine Accelerator for Depthwise Separable Convolution with Direct Data Transfer

Depthwise separable convolution (DSC) has emerged as a crucial technique, especially for resource-constrained devices. In this paper, we propose a dual-engine for the DSC hardware accelerator, which enables the full utilization of depthwise convolution (DWC) and pointwise convolution (PWC) processing elements (PEs) in all DSC layers. To determine the optimal dataflow, data reuse, and configuration of the target architecture, we conduct a design space exploration using MobileNetV1 with the CIFAR10 dataset. In the architecture, we introduce an additional non-convolutional unit, which merges the dequantization, batch normalization (BN), ReLU, and quantization between DWC and PWC into a simple fixed-point multiplication and addition operation. This also reduces the intermediate data access between the DWC and PWC, enabling streaming operation and reducing latency. The proposed DSC dual-engine accelerator is implemented using the 22nm FDSOI technology from GlobalFoundries, occupying an area of 0.58 $mm^2$. After signoff, it can operate at 1 GHz at TT corner, achieving a peak energy efficiency of 13.43 TOPS/W with a throughput of 973.55 GOPS with 8-bit precision. The average energy efficiency of all DSC layers on MobileNetV1 is 11.13 TOPS/W, demonstrating substantial hardware efficiency improvements for DSC-based applications.

cs.AR↗

Ground State of $\mathrm{SU}\left(3\right)$ spin model on the checkerboard lattice

Geometric frustration in quantum spin systems can lead to exotic ground states. In this study, we investigate the $\mathrm{SU}(3)$ spin model on the checkerboard lattice to explore the effects of frustration arising from its point-connected $(N+1)$-site local structure. We employ density matrix renormalization group (DMRG) and exact diagonalization (ED) techniques to determine the ground state properties. Our results reveal the absence of both 3-sublattice antiferromagnetic order and valence cluster solid order. Instead, we identify ground states with bond stripe patterns sensitive to boundary conditions and system size, comprising staggered singlet arrays and uniform flat stripes. Notably, these stripes are relatively decoupled, and similar patterns can be reconstructed in quasi-one-dimensional ladders. These findings suggest that geometric frustration drives the system toward a mixed phase, combining characteristics of spin-liquid and valence cluster solid states, providing new insights into the behavior of frustrated quantum spin systems.

cond-mat.str-el↗

Rethinking Reward Model Evaluation: Are We Barking up the Wrong Tree?

Reward Models (RMs) are crucial for aligning language models with human preferences. Currently, the evaluation of RMs depends on measuring accuracy against a validation set of manually annotated preference data. Although this method is straightforward and widely adopted, the relationship between RM accuracy and downstream policy performance remains under-explored. In this work, we conduct experiments in a synthetic setting to investigate how differences in RM measured by accuracy translate into gaps in optimized policy performance. Our findings reveal that while there is a weak positive correlation between accuracy and downstream performance, policies optimized towards RMs with similar accuracy can exhibit quite different performance. Moreover, we discover that the way of measuring accuracy significantly impacts its ability to predict the final policy performance. Through the lens of the Regressional Goodhart effect, we recognize that accuracy, when used for measuring RM quality, can fail to fully capture the potential RM overoptimization. This underscores the inadequacy of relying solely on accuracy to reflect their impact on policy optimization.

cs.LG↗

Accessing Excitation of Many-body Systems via Single-Mode Approximation within Quantum Monte Carlo Simulations

We extend the single-mode Approximation (SMA) into quantum Monte Carlo simulations to provides an efficient and fast method to obtain the dynamical dispersion of quantum many-body systems. Based on stochastic series expansion (SSE) and its projector algorithms, the SMA + SSE method can simply extract the dispersion of the dynamical dispersion in the long wave-length limit and the upper bound of the dispersion elsewhere, without external calculations and high technique barriers. Meanwhile, numerical analytic continuation methods require the fine data of imaginary time correlations and complex programming. Therefore, our method can approach the excitation dispersion of large systems, e.g., we take the two-dimensional Heisenberg model on a $512 \times 512$ square lattice. We demonstrate the effectiveness and efficiency of our method with high precision via additional examples. We also demonstrate that SMA combined with SSE goes beyond spin-wave theory with numerical results. We further illustrate that SMA is able to extract useful information in strongly correlated systems with competing states.

cond-mat.str-el↗

Search, Verify and Feedback: Towards Next Generation Post-training Paradigm of Foundation Models via Verifier Engineering

The evolution of machine learning has increasingly prioritized the development of powerful models and more scalable supervision signals. However, the emergence of foundation models presents significant challenges in providing effective supervision signals necessary for further enhancing their capabilities. Consequently, there is an urgent need to explore novel supervision signals and technical approaches. In this paper, we propose verifier engineering, a novel post-training paradigm specifically designed for the era of foundation models. The core of verifier engineering involves leveraging a suite of automated verifiers to perform verification tasks and deliver meaningful feedback to foundation models. We systematically categorize the verifier engineering process into three essential stages: search, verify, and feedback, and provide a comprehensive review of state-of-the-art research developments within each stage. We believe that verifier engineering constitutes a fundamental pathway toward achieving Artificial General Intelligence.

cs.AI↗

Exotic Superfluid with Emergent flux in a one-dimensional Bose-Fermi mixture

We find a novel chiral superfluid (CSF) phase in a one-dimensional Bose-Fermi Hubbard model with significant mass and density imbalance between the two species. In the CSF phase, bosons condensate at non-zero momentum $\pm 2π/L$ with chain length $L$. To capture the essential physics of this new phenomenon, we study an alternative simplified model that only features competition between single-fermion hopping and hopping of composite particles composed of a fermion and a boson. This model captures the low energy physics of the Hubbard model and hosts a robust CSF phase. Our unbiased numerical studies show that in the CSF phase, the local superfluid order parameter continuously rotates along the chain, indicating that time-reversal symmetry is spontaneously broken. This symmetry breaking generates an emergent flux in the background, effectively optimizing the system's ground-state energy. We provide a physical understanding at the mean-field level. Furthermore, we have explored the potential realization of this phase in cold-atom experiments.

cond-mat.quant-gas↗

Interacting lattice systems with quantum dissipation: a quantum Monte Carlo study

Quantum dissipation arises when a large system can be split in a quantum system and an environment where the energy of the former flows to. Understanding the effect of dissipation on quantum many-body systems is of particular importance due to its potential relations with quantum information processing. We propose a conceptually simple approach to introduce the dissipation into interacting quantum systems in a thermodynamical context, in which every site of a 1d lattice is coupled off-diagonally to its own bath. The interplay between quantum dissipation and interactions gives rise to counterintuitive interpretations such as a compressible zero-temperature state with spontaneous discrete symmetry breaking and a thermal phase transition in a one-dimensional dissipative quantum many-body system as revealed by Quantum Monte Carlo path integral simulations.

cond-mat.str-el↗

Merits of Time-Domain Computing for VMM -- A Quantitative Comparison

Vector-matrix-multiplication (VMM) accel-erators have gained a lot of traction, especially due to therise of convolutional neural networks (CNNs) and the desireto compute them on the edge. Besides the classical digitalapproach, analog computing has gone through a renais-sance to push energy efficiency further. A more recent ap-proach is called time-domain (TD) computing. In contrastto analog computing, TD computing permits easy technol-ogy as well as voltage scaling. As it has received limitedresearch attention, it is not yet clear which scenarios aremost suitable to be computed in the TD. In this work, weinvestigate these scenarios, focussing on energy efficiencyconsidering approximative computations that preserve ac-curacy. Both goals are addressed by a novel efficiency met-ric, which is used to find a baseline design. We use SPICEsimulation data which is fed into a python framework toevaluate how performance scales for VMM computation.We see that TD computing offers best energy efficiency forsmall to medium sized arrays. With throughput and sili-con footprint we investigate two additional metrics, givinga holistic comparison.

cs.AR↗

Six-component pairing instability in the SU(4) $t$-$J$ chain

We use the density matrix renormalization group (DMRG) method to study the SU(4) $t$-$J$ chain. We find that, in addition to the conventional repulsive Luttinger liquid phase and phase separation, there are two phases in the attractive Luttinger liquid region dependent on whether the flavor gap is opened or not. The first with the flavor gap is the molecular superfluid phase (the SU(4) singlet instability) which is well-known in the attractive SU(4) Hubbard model ($U<0$). The second without the flavor gap is the superconducting phase (the six-component pairing instability). Furthermore, the molecular superfluid instability cannot coexist with the superconducting instability. This is general in SU($N$) models with $N>2$ and is well demonstrated by the theoretical analysis based on the phenomenological bosonization results.

cond-mat.str-el↗

Learning In-context Learning for Named Entity Recognition

Named entity recognition in real-world applications suffers from the diversity of entity types, the emergence of new entity types, and the lack of high-quality annotations. To address the above problems, this paper proposes an in-context learning-based NER approach, which can effectively inject in-context NER ability into PLMs and recognize entities of novel types on-the-fly using only a few demonstrative instances. Specifically, we model PLMs as a meta-function $\mathcal{ λ_ {\text{instruction, demonstrations, text}}. M}$, and a new entity extractor can be implicitly constructed by applying new instruction and demonstrations to PLMs, i.e., $\mathcal{ (λ. M) }$(instruction, demonstrations) $\to$ $\mathcal{F}$ where $\mathcal{F}$ will be a new entity extractor, i.e., $\mathcal{F}$: text $\to$ entities. To inject the above in-context NER ability into PLMs, we propose a meta-function pre-training algorithm, which pre-trains PLMs by comparing the (instruction, demonstration)-initialized extractor with a surrogate golden extractor. Experimental results on 4 few-shot NER datasets show that our method can effectively inject in-context NER ability into PLMs and significantly outperforms the PLMs+fine-tuning counterparts.

cs.CL↗

Universal Information Extraction as Unified Semantic Matching

The challenge of information extraction (IE) lies in the diversity of label schemas and the heterogeneity of structures. Traditional methods require task-specific model design and rely heavily on expensive supervision, making them difficult to generalize to new schemas. In this paper, we decouple IE into two basic abilities, structuring and conceptualizing, which are shared by different tasks and schemas. Based on this paradigm, we propose to universally model various IE tasks with Unified Semantic Matching (USM) framework, which introduces three unified token linking operations to model the abilities of structuring and conceptualizing. In this way, USM can jointly encode schema and input text, uniformly extract substructures in parallel, and controllably decode target structures on demand. Empirical evaluation on 4 IE tasks shows that the proposed method achieves state-of-the-art performance under the supervised experiments and shows strong generalization ability in zero/few-shot transfer settings.

cs.CL↗