Searcharxiv⌕ Search

arXiv subjects

Wei Guo

Publications and source records attributed to Wei Guo.

At least 73 records · Page 4Linked to original sources
arXiv2026

Can Recommender Systems Teach Themselves? A Recursive Self-Improving Framework with Fidelity Control

The scarcity of high-quality training data presents a fundamental bottleneck to scaling machine learning models. This challenge is particularly acute in recommendation systems, where extreme sparsity in user interactions leads to rugged optimization landscapes and poor generalization. We propose the Recursive Self-Improving Recommendation (RSIR) framework, a paradigm in which a model bootstraps its own performance without reliance on external data or teacher models. RSIR operates in a closed loop: the current model generates plausible user interaction sequences, a fidelity-based quality control mechanism filters them for consistency with user's approximate preference manifold, and a successor model is augmented on the enriched dataset. Our theoretical analysis shows that RSIR acts as a data-driven implicit regularizer, smoothing the optimization landscape and guiding models toward more robust solutions. Empirically, RSIR yields consistent, cumulative gains across multiple benchmarks and architectures. Notably, even smaller models benefit, and weak models can generate effective training curricula for stronger ones. These results demonstrate that recursive self-improvement is a general, model-agnostic approach to overcoming data sparsity, suggesting a scalable path forward for recommender systems and beyond. Our anonymized code is available at https://github.com/USTC-StarTeam/RSIR.

cs.IR↗
arXiv2026

SatSurfGS: Generalizable 2D Gaussian Splatting for Sparse-View Satellite Surface Reconstruction

Sparse-view satellite image surface reconstruction remains highly challenging, fundamentally because the reliability of multi-view matching under satellite imaging conditions is strongly spatially heterogeneous. Affected by large photometric differences, weak textures, and repetitive textures, multi-view geometric constraints are often sparse, unevenly distributed, and locally unreliable. Although 2D Gaussian Splatting (2DGS) is more suitable than 3D Gaussian Splatting (3DGS) for the explicit representation of continuous surfaces, research on generalizable feed-forward 2DGS frameworks for sparse-view satellite surface reconstruction is still lacking. To address this issue, we propose SatSurfGS, a generalizable sparse-view surface reconstruction method for satellite imagery based on 2DGS. The proposed method builds a coarse-to-fine Gaussian attribute prediction framework and explicitly models local geometric reliability at three levels: feature learning, Gaussian parameter estimation, and training optimization. Specifically, we propose a confidence-aware monocular multi-view feature fusion module to adaptively integrate monocular priors and multi-view matching features according to local confidence; a cross-stage self-consistency residual guidance module to stabilize stage-wise Gaussian parameter refinement using the residual between the rendered height map from the previous stage and the current-stage MVS height map, together with confidence information; and a confidence bidirectional routing loss to achieve differentiated allocation of geometric and appearance supervision. Experiments on satellite datasets show that the proposed method achieves improved rendering quality, surface reconstruction accuracy, cross-dataset generalization, and inference efficiency compared with representative generalizable baselines and competitive per-scene optimization methods.

cs.CV↗
arXiv2026

Rethinking Mutual Coupling in Movable Antenna MIMO Systems: Modeling and Optimization

Movable antennas (MAs) have attracted growing interest for their ability to improve channel conditions via adaptive antenna movement. Nevertheless, such movement inevitably introduces mutual coupling (MC), whose impact has been largely overlooked in existing MA literature. In this paper, we show that MC is not merely an unavoidable electromagnetic effect, but also a new source of capacity gains in MA-enabled multiple-input multiple-output (MIMO) systems. To leverage MC effects, we develop an optimization framework for both narrowband and wideband systems based on a rigorous circuit-theoretic model. For narrowband systems, capacity maximization is formulated as a non-convex optimization problem, which is solved via a block coordinate ascent (BCA) framework. Because optimizing MA positions is challenging due to analytically intractable MC matrices, we develop a trust region method (TRM)-based algorithm that utilizes Sylvester equations to compute the derivatives of the inverse square roots of the MC matrices. We further consider wideband systems and formulate a sum-rate maximization problem. To find a unified set of MA positions that balances varying subcarrier conditions, the BCA framework and the TRM-based MA position optimization algorithm are extended to wideband systems. Simulation results demonstrate that exploiting MC effects in MA-MIMO systems yields significant performance gains in both narrowband and wideband systems under various channel conditions. These gains highlight the benefits of MC-induced superdirectivity and designable MC matrices.

cs.IT↗
arXiv2026

CPI-C: Cool Planet Imaging Coronagraph on Chinese Space Station Survey Telescope

Cool Planet Imaging Coronagraph (CPI-C) on Chinese Space Station Survey Telescope (CSST) is proposed to direct image the cool planets around nearby solar-type stars (within 40 pc). The core scientific objective of CPI-C is to conduct high-contrast directly imaging surveys of exoplanets ranging in size from Neptune-like to Jupiter-like, located at separations of 0.5 to 5 AU from their host stars, and to perform systematic spectroscopic analysis of the detected planets through high-precision multi-band photometry. CPI-C employs a step-transmission apodization technique to suppress the diffraction noises from the telescope pupil and a precise phase correction technique to eliminate the speckle noises due to imperfections of the optical surfaces. The contrast requirement is better than $10^{-8}$ at an inner working angle (IWA) of $3-4λ/D$, in the visible wavelength from 600 nm to 900 nm. CPI-C will be the first space-based instrument capable of directly imaging the reflection light from the cool exoplanets in the visible wavelength enabling the measurement of key physical parameters such as the effective temperature, surface gravity, radius, mass, and other key parameters. The potential observation results will significantly contribute to further understand the formation and evolution mechanisms of planets, which will also lay a solid foundation for future confirmation of the Earth-twins in the next generation space flagship missions.

astro-ph.EP↗
arXiv2026

Prototype-Guided Robust Learning against Backdoor Attacks

Backdoor attacks poison the training data, causing the model to behave normally on clean inputs but predict attacker-chosen labels when trigger patterns are embedded into the input samples. Defending against such attacks is highly challenging, especially when the defender has limited access to clean data. Existing defense methods often rely on restrictive assumptions-such as high poisoning ratios or poisoning strategies-limiting their practicality and generalization. To overcome these limitations, we propose Prototype-Guided Robust Learning (PGRL), a defense that only requires a small set of verified benign samples, and integrates two complementary components during fine-tuning: Label Consistency Verification (LCV), which detects and removes suspicious samples from the potentially poisoned dataset; and Feature Distance Estimation (FDE), which enforces the unlearning of backdoor-related representations. Extensive experiments against eight existing defenses show that PGRL achieves superior robustness across diverse architectures, datasets, and advanced attack scenarios, establishing a new standard for practical and generalizable backdoor defense.

cs.CR↗
arXiv2026

ReCast: Recasting Learning Signals for Reinforcement Learning in Generative Recommendation

Generic group-based RL assumes that sampled rollout groups are already usable learning signals. We show that this assumption breaks down in sparse-hit generative recommendation, where many sampled groups never become learnable at all. We propose ReCast, a repair-then-contrast learning-signal framework that first restores minimal learnability for all-zero groups and then replaces full-group reward normalization with a boundary-focused contrastive update on the strongest positive and the hardest negative. ReCast leaves the outer RL framework unchanged, modifies only within-group signal construction, and partially decouples rollout search width from actor-side update width. Across multiple generative recommendation tasks, ReCast consistently outperforms OpenOneRec-RL, achieving up to 36.6% relative improvement in Pass@1. Its matched-budget advantage is substantially larger: ReCast reaches the baseline's target performance with only 4.1% of the rollout budget, and this advantage widens with model scale. The same design also yields direct system-level gains, reducing actor-side update time by 16.60x, lowering peak allocated memory by 16.5%, and improving actor MFU by 14.2%. Mechanism analysis shows that ReCast mitigates the persistent all-zero / single-hit regime, restores learnability when natural positives are scarce, and converts otherwise wasted rollout budget into more stable policy updates. These results suggest that, for generative recommendation, the decisive RL problem is not only how to assign rewards, but how to construct learnable optimization events from sparse, structured supervision.

cs.LG↗
arXiv2026

Towards Precise Channel Knowledge Map: Exploiting Environmental Information from 2D Visuals to 3D Point Clouds

The substantial communication resources consumed by conventional pilot-based channel sounding impose an unsustainable overhead, presenting a critical scalability challenge for the future 6G networks characterized by massive channel dimensions, ultra-wide bandwidth, and dense user deployments. As a generalization of radio map, channel knowledge map (CKM) offers a paradigm shift, enabling access to location-tagged channel information without exhaustive measurements. To fully utilize the power of CKM, this work highlights the necessity of leveraging three-dimensional (3D) environmental information, beyond conventional two-dimensional (2D) visual representations, to construct high-precision CKMs. Specifically, we present a novel framework that integrates 3D point clouds into CKM construction through a hybrid model- and data-driven approach, with extensive case studies in real-world scenarios. The experimental results demonstrate the potential for constructing precise CKMs based on 3D environments enhanced with semantic understanding, together with their applications in the next-generation wireless communications. We also release a real-world dataset of measured channel paired with high-resolution 3D environmental data to support future research and validation.

eess.SP↗
arXiv2026

Building Low-Altitude Communication Networks: A Digital Twin-Based Optimization Framework

Low-altitude communication networks (LACNs) serve as the critical infrastructure of the emerging low-altitude economy (LAE), supporting services such as drone delivery and infrastructure inspection. However, LACNs operate in highly dynamic three-dimensional (3D) environments characterized by high mobility and predominantly line-of-sight (LoS) propagation, creating strong coupling among key performance objectives including coverage, interference mitigation, handover management, and sensing capability. Isolated tuning of individual objectives cannot capture these cross-objective interactions, rendering conventional approaches based on experience-driven tuning and repeated field trials inefficient and costly. To address these challenges, we propose DT-MOO, a Digital Twin-based Multi-Objective Optimization framework for LACNs. By constructing a high-fidelity virtual replica that integrates realistic environmental models, electromagnetic (EM) propagation, and traffic dynamics within a unified environment, DT-MOO enables joint evaluation and systematic optimization of interdependent network parameters, scoring candidate configurations by their combined effect on multiple objectives. As the foundational validation of the framework, we report real-world experiments in a 5G-enabled LACN focusing on coverage-interference co-optimization, where DT-MOO increases the high-quality coverage rate from 14.0% to 52.9% across all evaluated altitudes compared to an operator-provisioned, experience-based baseline, while achieving a net SINR gain under stringent criteria despite local spatial trade-offs, confirming its ability to handle coupled objectives in practical LACN deployment.

eess.SP↗
arXiv2026

IE as Cache: Information Extraction Enhanced Agentic Reasoning

Information Extraction aims to distill structured, decision-relevant information from unstructured text, serving as a foundation for downstream understanding and reasoning. However, it is traditionally treated merely as a terminal objective: once extracted, the resulting structure is often consumed in isolation rather than maintained and reused during multi-step inference. Moving beyond this, we propose \textit{IE-as-Cache}, a framework that repurposes IE as a cognitive cache to enhance agentic reasoning. Drawing inspiration from hierarchical computer memory, our approach combines query-driven extraction with cache-aware reasoning to dynamically maintain compact intermediate information and filter noise. Experiments on challenging benchmarks across diverse LLMs demonstrate significant improvements in reasoning accuracy, indicating that IE can be effectively repurposed as a reusable cognitive resource and offering a promising direction for future research on downstream uses of IE.

cs.CL↗
arXiv2026

Black hole thermodynamics is around the corner

We propose to work on the Euclidean black hole solution with a corner rather than with the prevalent conical singularity. As a result, we find that the Wald formula for black hole entropy can be readily obtained for generic $F(R_{abcd})$ gravity by using both the action without the corner term and the action with the corner term due to their equivalence to the first order variation. With such an equivalence, we further make use of a special diffeomorphism to accomplish a direct derivation of the ADM Hamiltonian conjugate to the Killing vector field normal to the horizon in the Lorentz signature as a conjugate variable of the inverse temperature in the grand canonical ensemble.

hep-th↗
arXiv2026

Unlearning Noise in PINNs: A Selective Pruning Framework for PDE Inverse Problems

Physics-informed neural networks (PINNs) provide a promising framework for solving inverse problems governed by partial differential equations (PDEs) by integrating observational data and physical constraints in a unified optimization objective. However, the ill-posed nature of PDE inverse problems makes them highly sensitive to noise. Even a small fraction of corrupted observations can distort internal neural representations, severely impairing accuracy and destabilizing training. Motivated by recent advances in machine unlearning and structured network pruning, we propose P-PINN, a selective pruning framework designed to unlearn the influence of corrupted data in a pretrained PINN. Specifically, starting from a PINN trained on the full dataset, P-PINN evaluates a joint residual--data fidelity indicator, a weighted combination of data misfit and PDE residuals, to partition the training set into reliable and corrupted subsets. Next, we introduce a bias-based neuron importance measure that quantifies directional activation discrepancies between the two subsets, identifying neurons whose representations are predominantly driven by corrupted samples. Building on this, an iterative pruning strategy then removes noise-sensitive neurons layer by layer. The resulting pruned network is fine-tuned on the reliable data subject to the original PDE constraints, acting as a lightweight post-processing stage rather than a complete retraining. Numerical experiments on extensive PDE inverse-problem benchmarks demonstrate that P-PINN substantially improves robustness, accuracy, and training stability under noisy conditions, achieving up to a 96.6% reduction in relative error compared with baseline PINNs. These results indicate that activation-level post hoc pruning is a promising mechanism for enhancing the reliability of physics-informed learning in noise-contaminated settings.

cs.LG↗
arXiv2026

Solid neon as a noise-resilient host for electron qubits above 100 mK

Solid neon can be used as a solid host for single-electron qubits, and at temperatures of around 10 mK, electron-on-solid-neon charge qubits exhibit long coherence times and high operation fidelities. However, systematic characterization of the noise features of such systems is needed for the development of scalable quantum information architectures. Here, we show that solid neon can be used as a noise-resilient host for electron qubits above 100 mK. We examine the resilience of solid neon against charge and thermal noise when electron-on-solid-neon charge qubits are operated away from the charge-insensitive sweet spot and at elevated temperatures. We show that the extracted high-frequency charge noise density of electron-on-solid-neon qubits, projected as voltage fluctuations on nearby electrodes, is between $10^{-4}$ and $10^{-6}~\mathrm{μV^2/Hz}$ at 0.01 to 1 MHz, which is comparable with common semiconductor hosts. We also show that the electron-on-solid-neon charge qubits operating around 5 GHz frequencies can maintain echo coherence times of over 1 $μ$s at temperatures up to 400 mK.

quant-ph↗
arXiv2026

Generative Data Transformation: From Mixed to Unified Data

Recommendation model performance is intrinsically tied to the quality, volume, and relevance of their training data. To address common challenges like data sparsity and cold start, recent researchs have leveraged data from multiple auxiliary domains to enrich information within the target domain. However, inherent domain gaps can degrade the quality of mixed-domain data, leading to negative transfer and diminished model performance. Existing prevailing \emph{model-centric} paradigm -- which relies on complex, customized architectures -- struggles to capture the subtle, non-structural sequence dependencies across domains, leading to poor generalization and high demands on computational resources. To address these shortcomings, we propose \textsc{Taesar}, a \emph{data-centric} framework for \textbf{t}arget-\textbf{a}lign\textbf{e}d \textbf{s}equenti\textbf{a}l \textbf{r}egeneration, which employs a contrastive decoding mechanism to adaptively encode cross-domain context into target-domain sequences. It employs contrastive decoding to encode cross-domain context into target sequences, enabling standard models to learn intricate dependencies without complex fusion architectures. Experiments show \textsc{Taesar} outperforms model-centric solutions and generalizes to various sequential models. By generating enriched datasets, \textsc{Taesar} effectively combines the strengths of data- and model-centric paradigms. The code accompanying this paper is available at~ \textcolor{blue}{https://github.com/USTC-StarTeam/Taesar}.

cs.AI↗
arXiv2026

A limiter-based approach to construct high-order fully-discrete entropy stable explicit DG schemes for hyperbolic conservation laws

This paper presents a class of novel high-order fully-discrete entropy stable (ES) discontinuous Galerkin (DG) schemes with explicit time discretization. The proposed methodology exploits a critical observation from [4] that the cell averages of classical DG solutions with forward Euler time stepping satisfy an ``entropy-stable-like'' property. Building on this result, fully-discrete entropy stability is rigorously enforced through a simple Zhang--Shu-type scaling limiter [45] applied as a post-processing step, without modifying the underlying spatial discretization. Furthermore, the proposed methodology can simultaneously enforce multiple cell entropy inequalities, a capability unavailable in existing ES DG schemes. High-order accuracy in time is achieved by using strong-stability-preserving (SSP) multistep methods. Theoretically, we prove that the proposed scheme indeed maintains high-order accuracy and establish a Lax--Wendroff-type theorem guaranteeing that the limit of the numerical solutions, if it exists, satisfies the desired entropy inequality. Extensive numerical tests for scalar equations and systems, including the nonconvex Buckley--Leverett problem and extreme examples of Euler equations, demonstrate optimal accuracy, enforcement of multiple entropy conditions, and strong robustness.

math.NA↗
arXiv2026

Terahertz Beam Squint Mitigation via Six-Dimensional Movable Antennas

Analog beamforming holds great potential for future terahertz (THz) communications due to its ability to generate high-gain directional beams with low-cost phase shifters. However, conventional analog beamforming may suffer substantial performance degradation in wideband systems due to the beam squint effect. Instead of relying on high-cost true-time delayers, we propose an efficient six-dimensional movable antenna (6DMA) architecture to mitigate the beam-squint effect. In particular, we study a wideband wide-beam coverage problem in this paper, aiming to maximize the minimum beamforming gain over a given range of azimuth/elevation angles and frequencies by jointly optimizing the analog beamforming vector, the MA positions within a two-dimensional (2D) region, and the three-dimensional (3D) rotation angles of the antenna array. However, this problem is non-convex and intractable to solve optimally due to the coupling of the spatial and frequency domains and that of the antenna weights, positions and rotation. To tackle this problem, we first derive an optimal solution to it in a special case with azimuth or elevation angle coverage only. It is shown that rotating a uniform linear array (ULA) is sufficient to achieve global optimality and eliminate beam-squint effects. While for other general cases, an alternating optimization (AO) algorithm is proposed to obtain a high-quality suboptimal solution, where the antennas' beamforming weights, positions, and rotation angles are alternately optimized by combining successive convex approximation (SCA), sequential update with Gibbs sampling (GS), and hybrid coarse- and fine-grained search. Simulation results demonstrate that our proposed scheme can significantly outperform conventional antenna arrays without antenna movement or rotation, thus offering a cost-effective solution for wideband transmission over THz bands.

eess.SP↗
arXiv2026

E-CARE: An Efficient LLM-based Commonsense-Augmented Framework for E-Commerce

Finding relevant products given a user query is pivotal to an e-commerce platform, as it can drive shopping behavior and generate revenue. The challenge lies in accurately predicting the correlation between queries and products. Recently, mining commonsense knowledge between queries and products using Large Language Models (LLMs) has shown promising results in boosting recommendation performance. However, such methods incur high costs due to intensive real-time LLM decoding during inference, as well as human annotation and potential Supervised Fine-Tuning (SFT) during training. To boost efficiency while leveraging LLMs' commonsense reasoning for various e-commerce tasks, we propose the Efficient Commonsense-Augmented Recommendation Enhancer (E-CARE), which requires neither SFT nor human annotation. The recommendation models augmented with E-CARE can access commonsense reasoning by leveraging a reasoning factor graph that encodes most of the reasoning schema from powerful LLMs, without requiring real-time LLM decoding. The experiments on 2 downstream tasks show improvements of up to 12.1% in precision@5.

cs.IR↗
arXiv2026

LLM Nepotism in Organizational Governance

Large language models are increasingly used to support organizational decisions from hiring to governance, raising fairness concerns in AI-assisted evaluation. Prior work has focused mainly on demographic bias and broader preference effects, rather than on whether evaluators reward expressed trust in AI itself. We study this phenomenon as LLM Nepotism, an attitude-driven bias channel in which favorable signals toward AI are rewarded even when they are not relevant to role-related merit. We introduce a two-phase simulation pipeline that first isolates AI-trust preference in qualification-matched resume screening and then examines its downstream effects in board-level decision making. Across several popular LLMs, we find that resume screeners tend to favor candidates with positive or non-critical attitudes toward AI, discriminating skeptical, human-centered counterparts. These biases suggest a loophole: LLM-based hiring can produce more homogeneous AI-trusting organizations, whose decision-makers exhibit greater scrutiny failure and delegation to AI agents, approving flawed proposals more readily while favoring AI-delegation initiatives. To mitigate this behavior, we additionally study prompt-based mitigation and propose Merit-Attitude Factorization, which separates non-merit AI attitude from merit-based evaluation and attenuates this bias across experiments.

cs.CY↗
arXiv2026

Soft cutoffs in the covariant phase space of dynamical reference frames

We construct covariant theories incorporating fluctuating boundaries and soft cutoffs by introducing dynamical reference frames (DRFs). This framework generalizes the covariant action from a hard-cutoff to a soft-cutoff formulation, utilizing smearing functions and their corresponding operator expansions. This generalization initially leads to a loss of diffeomorphism covariance, which is recovered solely by restricting the DRFs, along with both their associated and linear MCFs, to specific forms, and by imposing suitable boundary conditions on the smearing functions. Satisfying these conditions restores covariance in relational spacetime, thereby enabling the consistent definition of subsystems. Within the covariant phase space formalism, we derive the charges of the soft-cutoff theory while explicitly addressing the inherent ambiguities arising from the boundary Lagrangian. We demonstrate that introducing an additional pointwise dependence is essential to resolve these ambiguities and ensure the integrability of the charges, even under fluctuating boundary conditions. Finally, in the context of General Relativity (GR), we establish the conditions under which holographic renormalization results at the asymptotic boundary coincide with the Noether charges derived from our soft-cutoff procedure.

hep-th↗