arXiv subjects

Liwei Chen

Publications and source records attributed to Liwei Chen.

At least 19 recordsLinked to original sources

arXiv2026

Neuron-Aware Active Few-Shot Learning for LLMs

Active Few-Shot Learning (AFSL) adapts LLMs to specialized domains by identifying the most valuable unlabeled samples for annotation and use as few-shot demonstrations, effectively reducing human annotation costs while promoting high performance. However, existing methods typically rely on output-level signals for sample identification, such as predictive entropy or semantic similarities with test-time data based on external embeddings, which often overlook models' internal dynamics, which could pinpoint specific knowledge gaps. To bridge this gap, we propose NeuFS, a Neuron-Aware Active Few-Shot Learning framework that shifts the selection paradigm from output-level proxies to models' internal dynamics. NeuFS utilizes neuron activation patterns to represent sample directly, and includes a dual-criteria selection strategy that: (1) ensures few-shot sample diversity with neuron patterns for broader example coverage, while (2) prioritizing on identifying informative and challenging few-shot samples LLMs tend to hallucinate by quantifying neuron consensus. Experiments on three datasets demonstrate that NeuFS excels in both reasoning and text classification tasks, outperforming existing AFSL baselines. Ablation studies further highlight that internal neuron activations provide a more principled and effective selection signal than external embeddings, validating the superiority of the proposed NeuFS.

cs.LG↗

arXiv2026

Saturation-Aware Robust Trajectory Optimization for Reusable Launch Vehicles via Differentiable Physics

The high-angle-of-attack flip maneuver of reusable launch vehicles presents significant challenges for robust trajectory optimization due to the combined effects of highly nonlinear dynamics, aerodynamic uncertainties, and actuator saturation. This paper presents a differentiable physics framework for saturation-aware robust trajectory optimization. At its core, a Differentiable Particle Tube Control (DPTC) scheme is developed to optimize uncertainty evolution through an ensemble-based distribution shaping strategy. State uncertainty is represented by a Lagrangian particle ensemble, while hard actuator projection operators are embedded directly into the computational graph, enabling the joint optimization of the nominal feedforward trajectory and a time-varying feedback policy via end-to-end backpropagation. The proposed framework is evaluated against an automatic differentiation-based Successive Convexification (AD-SCvx) baseline combined with a conventional covariance steering feedback strategy. Six-degree-of-freedom Monte Carlo simulations demonstrate that, although the baseline achieves nominal fuel-optimal solutions, its unconstrained feedback formulation becomes susceptible to actuator saturation under aerodynamic disturbances, leading to degraded closed-loop robustness. In contrast, the proposed DPTC framework proactively performs a constraint-aware performance trade-off by relaxing spatial tracking to preserve critical control authority. These results demonstrate that integrating differentiable physics with ensemble-based optimization provides an effective and practical framework for robust guidance in highly constrained aerospace flight systems.

cs.RO↗

arXiv2026

Acoustic propagation of a vortex beam in typical Arctic sound environments

This study investigates the propagation of acoustic vortex beams carrying orbital angular momentum (OAM) in the Arctic underwater environments including the half-channel and the double duct. We produce a vortex beam with a 126-element hexagonal transducer array and model the acoustic propagation based on the ray method. It is found that under the typical Arctic circumstances, vortex beams with helical phase structures exhibit two unique capabilities. First, in the near field, the divergent components of vortex beams traveling at steep grazing angles illuminate shadow zones without mechanical steering of the acoustic source, which cannot be obtained by point or coherent sources at the same configuration. Second, despite strong boundary interactions and sound-speed inhomogeneity, the phase singularities and OAM modal content remain remarkably robust and can be identified at long ranges to some extend. The ice cover induces a larger transmission loss compared to the pressure release boundary condition because of the acoustic absorption in the ice canopy modeled as an elastic layer. These results advance the understanding of structured acoustic wave propagation in complex polar environments and thus provide a theoretical basis for subglacial exploration and under-ice acoustic communication.

physics.app-ph↗

arXiv2026

REAL: A Reasoning-Enhanced Graph Framework for Long-Term Memory Management of LLMs

Large Language Models (LLMs) are increasingly expected to interact with users over long time horizons. However, due to their finite context window, LLMs cannot retain all past interactions, making long-term memory management essential for storing, updating, and retrieving historical information beyond the context limit. Although recent memory systems attempt to address this issue by storing historical information externally, existing approaches suffer from three key limitations: flat text-based memory organizations fail to capture explicit relations among memories, structured memory systems often destructively overwrite evolving facts, and current retrieval mechanisms remain query-agnostic and passive when evidence is incomplete. REAL constructs long-term conversational memory as a temporal and confidence-aware directed property graph, where each atomic fact is represented with entities, relations, valid-time intervals, confidence scores, and exploration intent labels. During memory construction, REAL adopts a non-destructive temporal update strategy that preserves parallel fact versions and their validity intervals, enabling faithful tracking of fact evolution. During retrieval, REAL anchors query-relevant root entities, decouples their exploration intents, and performs semantic evaluator-guided hybrid beam search to extract compact memory subgraphs. It further incorporates counterfactual inference to repair unreliable retrieval states and recover missing memory evidence through implicit logical relations. Comprehensive experiments demonstrate that REAL substantially improves long-term memory performance over flat-text, graph-based, and existing memory baselines, achieving an average improvement of 22.72\%.

cs.CL↗

arXiv2026

$\text{VG}^2$GT: Voxel-Gaussian Splatting Visual Geometry Grounded Transformer

Gaussian splatting has shown strong potential for 3D reconstruction and novel view synthesis. However, most existing methods require accurate camera parameters and per-scene optimization, while feed-forward methods with pixel-aligned Gaussian primitives often suffer from artifacts and non-uniform primitives. In this paper, we propose $\text{VG}^2$GT, a Voxel-Gaussian Splatting Visual Geometry-Grounded Transformer. $\text{VG}^2$GT leverages a frozen pretrained visual foundation model (VFM), incorporates a multi-scale differentiable voxel module to enhance geometric understanding, and directly splits and regresses Gaussian primitive parameters from voxel features. During training, depth maps are supervised through stochastic solid volume rendering, enabling geometrically accurate Gaussian scene reconstruction while keeping the visual foundation model fully frozen. This design enables $\text{VG}^2$GT to be seamlessly plugged into any patch-feature-based VFM, while substantially reducing the required training cost. $\text{VG}^2$GT outperforms current state-of-the-art methods on widely used DTU, Replica, TAT, and ScanNet datasets.

cs.CV↗

arXiv2026

A neural operator framework for data-driven discovery of stability and receptivity in physical systems

Understanding how complex systems respond to perturbations, such as whether they will remain stable or what their most sensitive patterns are, is a fundamental challenge across science and engineering. Traditional stability and receptivity (resolvent) analyses are powerful but rely on known equations and linearization, limiting their use in nonlinear or poorly modeled systems. Here, we introduce a data-driven framework that automatically identifies stability properties and optimal forcing responses from observation data alone, without requiring governing equations. By training a neural network as a dynamics emulator and using automatic differentiation to extract its Jacobian, we can compute eigenmodes and resolvent modes directly from data. We demonstrate the method on both canonical chaotic models and high-dimensional fluid flows, successfully identifying dominant instability modes and input-output structures even in strongly nonlinear regimes. By leveraging a neural network-based emulator, we readily obtain a nonlinear representation of system dynamics while additionally retrieving intricate dynamical patterns that were previously difficult to resolve. This equation-free methodology establishes a broadly applicable tool for analyzing complex, high-dimensional datasets, with immediate relevance to grand challenges in fields such as climate science, neuroscience, and fluid engineering.

physics.flu-dyn↗

arXiv2026

Balancing Power, Efficiency, and Constancy under Broken Time-Reversal Symmetry

We derive general trade-off relations among the power, efficiency, and constancy for two-terminal thermoelectric systems in the linear response regime. Constancy, which quantifies the steadiness of the heat engine, is measured by its fluctuations. The bounds of the efficiency, power and fluctuations are valid even when time-reversal symmetry is broken, revealing how such a symmetry breaking alters the fundamental constraints on steady-state energy conversion. Our results extend and refine previously established universal trade-offs, offering deeper insight into the performance limits in nonequilibrium thermodynamics. Guided by this bound, heat engines with broken time-reversal symmetry can be operated at near-Carnot efficiency while maintaining finite power output and fluctuations, enabling them to outperform their traditional counterparts.

cond-mat.stat-mech↗

arXiv2025

FSFSplatter: Build Surface and Novel Views with Sparse-Views within 2min

Gaussian Splatting has become a leading reconstruction technique, known for its high-quality novel view synthesis and detailed reconstruction. However, most existing methods require dense, calibrated views. Reconstructing from free sparse images often leads to poor surface due to limited overlap and overfitting. We introduce FSFSplatter, a new approach for fast surface reconstruction from free sparse images. Our method integrates end-to-end dense Gaussian initialization, camera parameter estimation, and geometry-enhanced scene optimization. Specifically, FSFSplatter employs a large Transformer to encode multi-view images and generates a dense and geometrically consistent Gaussian scene initialization via a self-splitting Gaussian head. It eliminates local floaters through contribution-based pruning and mitigates overfitting to limited views by leveraging depth and multi-view feature supervision with differentiable camera parameters during rapid optimization. FSFSplatter outperforms current state-of-the-art methods on widely used DTU, Replica, and BlendedMVS datasets.

cs.CV↗

arXiv2025

Optimization of Flip-Landing Trajectories for Starship based on a Deep Learned Simulator

We propose a differentiable optimization framework for flip-and-landing trajectory design of reusable spacecraft, exemplified by the Starship vehicle. A deep neural network surrogate, trained on high-fidelity CFD data, predicts aerodynamic forces and moments, and is tightly coupled with a differentiable rigid-body dynamics solver. This enables end-to-end gradient-based trajectory optimization without linearization or convex relaxation. The framework handles actuator limits and terminal landing constraints, producing physically consistent, optimized control sequences. Both standard automatic differentiation and Neural ODEs are applied to support long-horizon rollouts. Results demonstrate the framework's effectiveness in modeling and optimizing complex maneuvers with high nonlinearities. This work lays the groundwork for future extensions involving unsteady aerodynamics, plume interactions, and intelligent guidance design.

cs.RO↗

arXiv2025

Multispectral radiation temperature inversion based on Transformer-LSTM-SVM

The key challenge in multispectral radiation thermometry is accurately measuring emissivity. Traditional constrained optimization methods often fail to meet practical requirements in terms of precision, efficiency, and noise resistance. However, the continuous advancement of neural networks in data processing offers a potential solution to this issue. This paper presents a multispectral radiation thermometry algorithm that combines Transformer, LSTM (Long Short-Term Memory), and SVM (Support Vector Machine) to mitigate the impact of emissivity, thereby enhancing accuracy and noise resistance. In simulations, compared to the BP neural network algorithm, GIM-LSTM, and Transformer-LSTM algorithms, the Transformer-LSTM-SVM algorithm demonstrates an improvement in accuracy of 1.23%, 0.46% and 0.13%, respectively, without noise. When 5% random noise is added, the accuracy increases by 1.39%, 0.51%, and 0.38%, respectively. Finally, experiments confirmed that the maximum temperature error using this method is less than 1%, indicating that the algorithm offers high accuracy, fast processing speed, and robust noise resistance. These characteristics make it well-suited for real-time high-temperature measurements with multi-wavelength thermometry equipment.

physics.optics↗

arXiv2025

On the Diminishing Returns of Complex Robust RAG Training in the Era of Powerful LLMs

Retrieval-augmented generation (RAG) systems traditionally employ sophisticated training strategies to enhance robustness against retrieval noise. In this work, we investigate a critical question: does the benefit of these complex robust training methods diminish as language models become more powerful? Through systematic evaluation across multiple model scales and question-answering datasets, our analysis reveals a consistent trend: \emph{the marginal robustness benefit of sophisticated training strategies decreases substantially as model capacity increases.} While smaller models show significant performance improvements from complex document selection and adversarial objectives, more capable models achieve comparable or even superior performance with simpler training approaches. Further investigation demonstrates that stronger models naturally exhibit better confidence calibration, cross-dataset generalization capability, and more effective attention patterns, even under simple training regimes. These findings suggest that as foundation models evolve, the engineering effort invested in complex robust training may yield diminishing returns, indicating that simplified RAG pipelines could suffice for powerful models while maintaining competitive performance.

cs.CL↗

arXiv2025

Following the Autoregressive Nature of LLM Embeddings via Compression and Alignment

A new trend uses LLMs as dense text encoders via contrastive learning. However, since LLM embeddings predict the probability distribution of the next token, they are inherently generative and distributive, conflicting with contrastive learning, which requires embeddings to capture full-text semantics and align via cosine similarity. This discrepancy hinders the full utilization of LLMs' pre-training capabilities, resulting in inefficient learning. In response to this issue, we propose AutoRegEmbed, a new contrastive learning method built on embedding conditional probability distributions, which integrates two core tasks: information compression and conditional distribution alignment. The information compression task encodes text into the embedding space, ensuring that the embedding vectors capture global semantics. The conditional distribution alignment task focuses on aligning text embeddings with positive samples embeddings by leveraging the conditional distribution of embeddings while simultaneously reducing the likelihood of generating negative samples from text embeddings, thereby achieving embedding alignment and uniformity. Experimental results demonstrate that our method significantly outperforms traditional contrastive learning approaches and achieves performance comparable to state-of-the-art models when using the same amount of data.

cs.CL↗

arXiv2024

RectifID: Personalizing Rectified Flow with Anchored Classifier Guidance

Customizing diffusion models to generate identity-preserving images from user-provided reference images is an intriguing new problem. The prevalent approaches typically require training on extensive domain-specific images to achieve identity preservation, which lacks flexibility across different use cases. To address this issue, we exploit classifier guidance, a training-free technique that steers diffusion models using an existing classifier, for personalized image generation. Our study shows that based on a recent rectified flow framework, the major limitation of vanilla classifier guidance in requiring a special classifier can be resolved with a simple fixed-point solution, allowing flexible personalization with off-the-shelf image discriminators. Moreover, its solving procedure proves to be stable when anchored to a reference flow trajectory, with a convergence guarantee. The derived method is implemented on rectified flow with different off-the-shelf image discriminators, delivering advantageous personalization results for human faces, live subjects, and certain objects. Code is available at https://github.com/feifeiobama/RectifID.

cs.CV↗

arXiv2024

Harder Tasks Need More Experts: Dynamic Routing in MoE Models

In this paper, we introduce a novel dynamic expert selection framework for Mixture of Experts (MoE) models, aiming to enhance computational efficiency and model performance by adjusting the number of activated experts based on input difficulty. Unlike traditional MoE approaches that rely on fixed Top-K routing, which activates a predetermined number of experts regardless of the input's complexity, our method dynamically selects experts based on the confidence level in expert selection for each input. This allows for a more efficient utilization of computational resources, activating more experts for complex tasks requiring advanced reasoning and fewer for simpler tasks. Through extensive evaluations, our dynamic routing method demonstrates substantial improvements over conventional Top-2 routing across various benchmarks, achieving an average improvement of 0.7% with less than 90% activated parameters. Further analysis shows our model dispatches more experts to tasks requiring complex reasoning skills, like BBH, confirming its ability to dynamically allocate computational resources in alignment with the input's complexity. Our findings also highlight a variation in the number of experts needed across different layers of the transformer model, offering insights into the potential for designing heterogeneous MoE frameworks. The code and models are available at https://github.com/ZhenweiAn/Dynamic_MoE.

cs.LG↗

arXiv2024

Probing Multimodal Large Language Models for Global and Local Semantic Representations

The advancement of Multimodal Large Language Models (MLLMs) has greatly accelerated the development of applications in understanding integrated texts and images. Recent works leverage image-caption datasets to train MLLMs, achieving state-of-the-art performance on image-to-text tasks. However, there are few studies exploring which layers of MLLMs make the most effort to the global image information, which plays vital roles in multimodal comprehension and generation. In this study, we find that the intermediate layers of models can encode more global semantic information, whose representation vectors perform better on visual-language entailment tasks, rather than the topmost layers. We further probe models regarding local semantic representations through object recognition tasks. We find that the topmost layers may excessively focus on local information, leading to a diminished ability to encode global information. Our code and data are released via https://github.com/kobayashikanna01/probing_MLLM_rep.

cs.CL↗

arXiv2024

Video-LaVIT: Unified Video-Language Pre-training with Decoupled Visual-Motional Tokenization

In light of recent advances in multimodal Large Language Models (LLMs), there is increasing attention to scaling them from image-text data to more informative real-world videos. Compared to static images, video poses unique challenges for effective large-scale pre-training due to the modeling of its spatiotemporal dynamics. In this paper, we address such limitations in video-language pre-training with an efficient video decomposition that represents each video as keyframes and temporal motions. These are then adapted to an LLM using well-designed tokenizers that discretize visual and temporal information as a few tokens, thus enabling unified generative pre-training of videos, images, and text. At inference, the generated tokens from the LLM are carefully recovered to the original continuous pixel space to create various video content. Our proposed framework is both capable of comprehending and generating image and video content, as demonstrated by its competitive performance across 13 multimodal benchmarks in image and video understanding and generation. Our code and models are available at https://video-lavit.github.io.

cs.CV↗

arXiv2023

A Step Closer to Comprehensive Answers: Constrained Multi-Stage Question Decomposition with Large Language Models

While large language models exhibit remarkable performance in the Question Answering task, they are susceptible to hallucinations. Challenges arise when these models grapple with understanding multi-hop relations in complex questions or lack the necessary knowledge for a comprehensive response. To address this issue, we introduce the "Decompose-and-Query" framework (D&Q). This framework guides the model to think and utilize external knowledge similar to ReAct, while also restricting its thinking to reliable information, effectively mitigating the risk of hallucinations. Experiments confirm the effectiveness of D&Q: On our ChitChatQA dataset, D&Q does not lose to ChatGPT in 67% of cases; on the HotPotQA question-only setting, D&Q achieved an F1 score of 59.6%. Our code is available at https://github.com/alkaidpku/DQ-ToolQA.

cs.CL↗

arXiv2023

Hardy spaces and Szeg\H{o} projection on quotient domains

The Hardy spaces are defined on the quotient domain of a bounded complete Reinhardt domain by a finite subgroup of $U(n)$. The Szeg\H{o} projection on the quotient domain can be studied by lifting to the covering space. This setting builds on the solution of a boundary value problem for holomorphic functions. In particular, when the covering space is either the polydisc or the unit ball in $\mathbb{C}^n$, the boundary value problem can be solved. Applying this theory in $\mathbb{C}^2$, we further obtain sharp results on the $L^p$ regularity of the Szeg\H{o} projection on the symmetrized bidisc, generalized Thullen domains, and the minimal ball.

math.CV↗