Searcharxiv⌕ Search

arXiv subjects

Wei He

Publications and source records attributed to Wei He.

At least 127 records · Page 7Linked to original sources
arXiv2025

Exploring a Principled Framework for Deep Subspace Clustering

Subspace clustering is a classical unsupervised learning task, built on a basic assumption that high-dimensional data can be approximated by a union of subspaces (UoS). Nevertheless, the real-world data are often deviating from the UoS assumption. To address this challenge, state-of-the-art deep subspace clustering algorithms attempt to jointly learn UoS representations and self-expressive coefficients. However, the general framework of the existing algorithms suffers from a catastrophic feature collapse and lacks a theoretical guarantee to learn desired UoS representation. In this paper, we present a Principled fRamewOrk for Deep Subspace Clustering (PRO-DSC), which is designed to learn structured representations and self-expressive coefficients in a unified manner. Specifically, in PRO-DSC, we incorporate an effective regularization on the learned representations into the self-expressive model, prove that the regularized self-expressive model is able to prevent feature space collapse, and demonstrate that the learned optimal representations under certain condition lie on a union of orthogonal subspaces. Moreover, we provide a scalable and efficient approach to implement our PRO-DSC and conduct extensive experiments to verify our theoretical findings and demonstrate the superior performance of our proposed deep subspace clustering approach. The code is available at https://github.com/mengxianghan123/PRO-DSC.

cs.CV↗
arXiv2025

Degradation Alchemy: Self-Supervised Unknown-to-Known Transformation for Blind Hyperspectral Image Fusion

Hyperspectral image (HSI) fusion is an efficient technique that combines low-resolution HSI (LR-HSI) and high-resolution multispectral images (HR-MSI) to generate high-resolution HSI (HR-HSI). Existing supervised learning methods (SLMs) can yield promising results when test data degradation matches the training ones, but they face challenges in generalizing to unknown degradations. To unleash the potential and generalization ability of SLMs, we propose a novel self-supervised unknown-to-known degradation transformation framework (U2K) for blind HSI fusion, which adaptively transforms unknown degradation into the same type of degradation as those handled by pre-trained SLMs. Specifically, the proposed U2K framework consists of: (1) spatial and spectral Degradation Wrapping (DW) modules that map HR-HSI to unknown degraded HR-MSI and LR-HSI, and (2) Degradation Transformation (DT) modules that convert these wrapped data into predefined degradation patterns. The transformed HR-MSI and LR-HSI pairs are then processed by a pre-trained network to reconstruct the target HR-HSI. We train the U2K framework in a self-supervised manner using consistency loss and greedy alternating optimization, significantly improving the flexibility of blind HSI fusion. Extensive experiments confirm the effectiveness of our proposed U2K framework in boosting the adaptability of five existing SLMs under various degradation settings and surpassing state-of-the-art blind methods.

eess.IV↗
arXiv2025

Neural Normalized Cut: A Differential and Generalizable Approach for Spectral Clustering

Spectral clustering, as a popular tool for data clustering, requires an eigen-decomposition step on a given affinity to obtain the spectral embedding. Nevertheless, such a step suffers from the lack of generalizability and scalability. Moreover, the obtained spectral embeddings can hardly provide a good approximation to the ground-truth partition and thus a k-means step is adopted to quantize the embedding. In this paper, we propose a simple yet effective scalable and generalizable approach, called Neural Normalized Cut (NeuNcut), to learn the clustering membership for spectral clustering directly. In NeuNcut, we properly reparameterize the unknown cluster membership via a neural network, and train the neural network via stochastic gradient descent with a properly relaxed normalized cut loss. As a result, our NeuNcut enjoys a desired generalization ability to directly infer clustering membership for out-of-sample unseen data and hence brings us an efficient way to handle clustering task with ultra large-scale data. We conduct extensive experiments on both synthetic data and benchmark datasets and experimental results validate the effectiveness and the superiority of our approach. Our code is available at: https://github.com/hewei98/NeuNcut.

cs.LG↗
arXiv2025

Better Process Supervision with Bi-directional Rewarding Signals

Process supervision, i.e., evaluating each step, is critical for complex large language model (LLM) reasoning and test-time searching with increased inference compute. Existing approaches, represented by process reward models (PRMs), primarily focus on rewarding signals up to the current step, exhibiting a one-directional nature and lacking a mechanism to model the distance to the final target. To address this problem, we draw inspiration from the A* algorithm, which states that an effective supervisory signal should simultaneously consider the incurred cost and the estimated cost for reaching the target. Building on this key insight, we introduce BiRM, a novel process supervision model that not only evaluates the correctness of previous steps but also models the probability of future success. We conduct extensive experiments on mathematical reasoning tasks and demonstrate that BiRM provides more precise evaluations of LLM reasoning steps, achieving an improvement of 3.1% on Gaokao2023 over PRM under the Best-of-N sampling method. Besides, in search-based strategies, BiRM provides more comprehensive guidance and outperforms ORM by 5.0% and PRM by 3.8% respectively on MATH-500.

cs.CL↗
arXiv2025

LDGen: Enhancing Text-to-Image Synthesis via Large Language Model-Driven Language Representation

In this paper, we introduce LDGen, a novel method for integrating large language models (LLMs) into existing text-to-image diffusion models while minimizing computational demands. Traditional text encoders, such as CLIP and T5, exhibit limitations in multilingual processing, hindering image generation across diverse languages. We address these challenges by leveraging the advanced capabilities of LLMs. Our approach employs a language representation strategy that applies hierarchical caption optimization and human instruction techniques to derive precise semantic information,. Subsequently, we incorporate a lightweight adapter and a cross-modal refiner to facilitate efficient feature alignment and interaction between LLMs and image features. LDGen reduces training time and enables zero-shot multilingual image generation. Experimental results indicate that our method surpasses baseline models in both prompt adherence and image aesthetic quality, while seamlessly supporting multiple languages. Project page: https://zrealli.github.io/LDGen.

cs.CV↗
arXiv2025

Mitigating Tail Narrowing in LLM Self-Improvement via Socratic-Guided Sampling

Self-improvement methods enable large language models (LLMs) to generate solutions themselves and iteratively train on filtered, high-quality rationales. This process proves effective and reduces the reliance on human supervision in LLMs' reasoning, but the performance soon plateaus. We delve into the process and find that models tend to over-sample on easy queries and under-sample on queries they have yet to master. As iterations proceed, this imbalance in sampling is exacerbated, leading to a long-tail distribution where solutions to difficult queries almost diminish. This phenomenon limits the performance gain of self-improving models. A straightforward solution is brute-force sampling to balance the distribution, which significantly raises computational costs. In this paper, we introduce Guided Self-Improvement (GSI), a strategy aimed at improving the efficiency of sampling challenging heavy-tailed data. It leverages Socratic-style guidance signals to help LLM reasoning with complex queries, reducing the exploration effort and minimizing computational overhead. Experiments on four models across diverse mathematical tasks show that GSI strikes a balance between performance and efficiency, while also being effective on held-out tasks.

cs.CL↗
arXiv2025

Measuring Top Yukawa Coupling through $2\rightarrow 3$ VBS at Muon Collider

We study the measurement of top Yukawa coupling through $2\rightarrow 3$ VBS at future muon colliders, focusing on the lepton and semi-lepton channels of $ννtth/z$. First, analyzing the partonic amplitudes of $W_LW_L\rightarrow t\bar t h/Z_L$ and simulating the full processes of $ννtth/z$ without decaying, we find they are highly sensitive to the anomalous top Yukawa $δy_t$. This sensitivity is enhanced by selecting helicities of the final $t\bar t$ and $Z$ to be $t_L\bar t_L+t_R\bar t_R$ and $Z_L$, which serves as the default and core setting of our analysis. We then obtain the limits on $δy_t$ with this setting, giving $[-1.0\%, 1.1\%]$ for $ννtth$ only and $[-0.36\%, 0.92\%]$ for $ννtth$ and $ννttz$ combined at $30$ TeV and $1σ$. Second, we proceed to analyze the processes after decaying and with background processes. To enhance the sensitivity to $δy_t$, our settings include selecting the helicities of the final particles, as well as applying suitable cuts. However, we don't do bin-by-bin analysis. We obtain the limits on $δy_t$ for those channels at $10/30$ TeV and $1σ/2 σ$. The best limit is from the semi-lepton channel of $ννtth$. With spin tagging efficiency at $ε_s=0.9$, it gives $[-1.6\% , 1.8\%]$ at $1σ$ and $ [-2.4\%, 2.7\% ]$ at $2σ$ at $30$ TeV; $[-7.0\%, 6.7\%]$ at $1σ$ and $[-9.8\%, 9.8\%]$ at $2σ$ at $10$ TeV.

hep-ph↗
arXiv2025

MapEval: Towards Unified, Robust and Efficient SLAM Map Evaluation Framework

Evaluating massive-scale point cloud maps in Simultaneous Localization and Mapping (SLAM) remains challenging, primarily due to the absence of unified, robust and efficient evaluation frameworks. We present MapEval, an open-source framework for comprehensive quality assessment of point cloud maps, specifically addressing SLAM scenarios where ground truth map is inherently sparse compared to the mapped environment. Through systematic analysis of existing evaluation metrics in SLAM applications, we identify their fundamental limitations and establish clear guidelines for consistent map quality assessment. Building upon these insights, we propose a novel Gaussian-approximated Wasserstein distance in voxelized space, enabling two complementary metrics under the same error standard: Voxelized Average Wasserstein Distance (AWD) for global geometric accuracy and Spatial Consistency Score (SCS) for local consistency evaluation. This theoretical foundation leads to significant improvements in both robustness against noise and computational efficiency compared to conventional metrics. Extensive experiments on both simulated and real-world datasets demonstrate that MapEval achieves at least \SI{100}{}-\SI{500}{} times faster while maintaining evaluation integrity. The MapEval library\footnote{\texttt{https://github.com/JokerJohn/Cloud\_Map\_Evaluation}} will be publicly available to promote standardized map evaluation practices in the robotics community.

cs.RO↗
arXiv2025

Beyond-Hubbard pairing in a cuprate ladder

The Hubbard model is believed to capture the essential physics of cuprate superconductors. However, recent theoretical studies suggest that it fails to reproduce a robust and homogeneous superconducting ground state. Here, using resonant inelastic x-ray scattering and density matrix renormalization group calculations, we show that magnetic excitations in the prototypical cuprate ladder Sr$_{14}$Cu$_{24}$O$_{41}$ are inconsistent with those of a simple Hubbard model. The magnetic response of hole carriers, contributing to an emergent branch of spin excitations, is strongly suppressed. This effect is the consequence of d-wave-like pairing, enhanced by nearly an order of magnitude through a large nearest-neighbor attractive interaction. The similarity between cuprate ladders and the two-dimensional compounds suggests that such an enhanced hole pairing may be a universal feature of superconducting cuprates.

cond-mat.str-el↗
arXiv2024

Updated version "Robust Voltage Regulation of DC-DC Buck Converter With ZIP Load via An Energy Shaping Control Approach"

ZIP loads (the parallel combination of constant impedance loads, constant current loads and constant power loads) exist widely in power system. In order to stabilize buck converter based DC distributed system with ZIP load, an adaptive energy shaping controller (AESC) is devised in this paper. Firstly, based on the assumption that lumped disturbances are known, a full information controller is designed in the framework of the port Hamiltonian system via energy shaping technique. Besides, using mathematical deductive method, an estimation of the domain of attraction is given to ensure the strict stability. Furthermore, to eliminate the influence of parameter perturbations on the system, a disturbance observer is proposed to reconstruct the lumped disturbances and then the estimated terms are introduced to above controller to form an AESC scheme. In addition, the stability analysis of the closed-loop system is given. Lastly, the simulation and experiment results are presented for assessing the designed controller.

eess.SY↗
arXiv2024

Enhancing LLM Reasoning via Critique Models with Test-Time and Training-Time Supervision

Training large language models (LLMs) to spend more time thinking and reflection before responding is crucial for effectively solving complex reasoning tasks in fields such as science, coding, and mathematics. However, the effectiveness of mechanisms like self-reflection and self-correction depends on the model's capacity to accurately assess its own performance, which can be limited by factors such as initial accuracy, question difficulty, and the lack of external feedback. In this paper, we delve into a two-player paradigm that separates the roles of reasoning and critique models, where the critique model provides step-level feedback to supervise the reasoning (actor) model during both test-time and train-time. We first propose AutoMathCritique, an automated and scalable framework for collecting critique data, resulting in a dataset of $76,321$ responses paired with step-level feedback. Fine-tuning language models with this dataset enables them to generate natural language feedback for mathematical reasoning. We demonstrate that the critique models consistently improve the actor's performance on difficult queries at test-time, especially when scaling up inference-time computation. Motivated by these findings, we introduce the critique-based supervision to the actor's self-training process, and propose a critique-in-the-loop self-improvement method. Experiments show that the method improves the actor's exploration efficiency and solution diversity, especially on challenging queries, leading to a stronger reasoning model. Lastly, we take the preliminary step to explore training self-talk reasoning models via critique supervision and showcase its potential. Our code and datasets are at \href{https://mathcritique.github.io/}{https://mathcritique.github.io/}.

cs.CL↗
arXiv2024

Tilted stripes origin in ${\mathrm{La}}_{1.88}{\mathrm{Sr}}_{0.12}{\mathrm{CuO}}_{4}$ revealed by anisotropic next-nearest neighbor hopping

Spin- and charge- stripe order has been extensively studied in the superconducting cuprates, among which underdoped ${\mathrm{La}}_{2-x}{\mathrm{Sr}}_{x}{\mathrm{CuO}}_{4}$ (LSCO) is an archetype with static spin stripes at low temperatures. An intriguing, but not completely understood, phenomenon in LSCO is that the stripes are tilted away from the high-symmetry Cu-Cu directions. Using high-resolution neutron scattering on LSCO with $x=0.12$, we find two coexisting phases at low temperatures, one with static spin stripes and the other with fluctuating ones, both sharing the same tilt angle. Our numerical calculations using the doped Hubbard model elucidate the tilting's origin, attributing it to anisotropic next-nearest neighbor hopping $t^{\prime}$, consistent with the material's slight orthorhombicity. Our results underscore the model's success in describing specific details of the ground state of this real material and highlight the role of $t^\prime$ in the Hamiltonian, revealing the delicate interplay between stripes and superconductivity across theoretical and experimental contexts.

cond-mat.str-el↗
arXiv2024

An Exploration of Parallel Imaging System for Very-low Field (50mT) MRI Scanner

Reducing the scanning time of very-low field (VLF) magnetic resonance imaging (MRI) scanners, commonly employed for stroke diagnosis, can enhance patient comfort and operational efficiency. The conventional parallel imaging (PI) technique for high-field MRI should be tailored to apply here, considering the differences in the direction of the main magnetic field and the presence of noise. A VLF-specific PI algorithm and phased-array coil are proposed, marking the first application of PI in VLF MRI. Reconstruction quality is enhanced by denoising undersampled k-space data using a linear-prediction based Kalman filter. Subsequently, the denoised k-space data are nonlinearly mapped from the original space onto a high-dimensional feature space, utilizing a polynomial feature mapping defined nonlinear frame. Frame parameters are calculated using auto-calibration signals (ACS) from the center k-space, and missing phase-encoding lines in the original space are estimated using acquired lines in the feature space. An 8-channel phased-array coil, designed for a vertical main magnetic field, is decoupled using geometric overlap and a low input impedance (LII) preamplifier. Healthy volunteer head imaging experiments using the proposed PI technique exhibit the lowest mean-squared-error (MSE) value and the highest peak-signal-to-noise (PSNR) and structural similarity index (SSIM) values compared to two widely used PI methods. The proposed PI technique enables the VLF MRI scanner to achieve similar image quality and a 72.5% improvement in signal-to-noise ratio (SNR) compared to fully sampled images while requiring less than 50% of the scan time. We present a PI technique tailored for VLF MRI scanner for the first time, along with potential research direction to achieve greater reduction factor.

physics.med-ph↗
arXiv2024

The Framework of NAVIS: Navigating Virtual Spaces with Immersive Scooters

Virtual reality (VR) environments have greatly expanded opportunities for immersive exploration, yet physically navigating these digital spaces remains a significant challenge. In this paper, we present the conceptual framework of NAVIS (Navigating Virtual Spaces with Immersive Scooters), a novel system that utilizes a scooter-based interface to enhance both navigation and interaction within virtual environments. NAVIS combines real-time physical mobility, haptic feedback, and CAVE-like (Cave Automatic Virtual Environment) technology to create a realistic sense of travel and movement, improving both spatial awareness and the overall immersive experience. By offering a more natural and physically engaging method of exploration, NAVIS addresses key limitations found in traditional VR locomotion techniques, such as teleportation or joystick control, which can detract from immersion and realism. This approach highlights the potential of combining physical movement with virtual environments to provide a more intuitive and enjoyable experience for users, opening up new possibilities for applications in gaming, education, and beyond.

cs.HC↗
arXiv2024

Investigating Idiomaticity in Word Representations

Idiomatic expressions are an integral part of human languages, often used to express complex ideas in compressed or conventional ways (e.g. eager beaver as a keen and enthusiastic person). However, their interpretations may not be straightforwardly linked to the meanings of their individual components in isolation and this may have an impact for compositional approaches. In this paper, we investigate to what extent word representation models are able to go beyond compositional word combinations and capture multiword expression idiomaticity and some of the expected properties related to idiomatic meanings. We focus on noun compounds of varying levels of idiomaticity in two languages (English and Portuguese), presenting a dataset of minimal pairs containing human idiomaticity judgments for each noun compound at both type and token levels, their paraphrases and their occurrences in naturalistic and sense-neutral contexts, totalling 32,200 sentences. We propose this set of minimal pairs for evaluating how well a model captures idiomatic meanings, and define a set of fine-grained metrics of Affinity and Scaled Similarity, to determine how sensitive the models are to perturbations that may lead to changes in idiomaticity. The results obtained with a variety of representative and widely used models indicate that, despite superficial indications to the contrary in the form of high similarities, idiomaticity is not yet accurately represented in current models. Moreover, the performance of models with different levels of contextualisation suggests that their ability to capture context is not yet able to go beyond more superficial lexical clues provided by the words and to actually incorporate the relevant semantic clues needed for idiomaticity.

cs.CL↗
arXiv2024

Free Video-LLM: Prompt-guided Visual Perception for Efficient Training-free Video LLMs

Vision-language large models have achieved remarkable success in various multi-modal tasks, yet applying them to video understanding remains challenging due to the inherent complexity and computational demands of video data. While training-based video-LLMs deliver high performance, they often require substantial resources for training and inference. Conversely, training-free approaches offer a more efficient alternative by adapting pre-trained image-LLMs models for video tasks without additional training, but they face inference efficiency bottlenecks due to the large number of visual tokens generated from video frames. In this work, we present a novel prompt-guided visual perception framework (abbreviated as Free Video-LLM) for efficient inference of training-free video LLMs. The proposed framework decouples spatial-temporal dimension and performs temporal frame sampling and spatial RoI cropping respectively based on task-specific prompts. Our method effectively reduces the number of visual tokens while maintaining high performance across multiple video question-answering benchmarks. Extensive experiments demonstrate that our approach achieves competitive results with significantly fewer tokens, offering an optimal trade-off between accuracy and computational efficiency compared to state-of-the-art video LLMs. The code will be available at https://github.com/contrastive/FreeVideoLLM.

cs.CV↗