Searcharxiv⌕ Search

arXiv subjects

Wen Chen

Publications and source records attributed to Wen Chen.

At least 163 records · Page 9Linked to original sources

Analysis and Optimization of Wireless Multimodal Federated Learning on Modal Heterogeneity

Multimodal federated learning (MFL) is a distributed framework for training multimodal models without uploading local multimodal data of clients, thereby effectively protecting client privacy. However, multimodal data is commonly heterogeneous across diverse clients, where each client possesses only a subset of all modalities, renders conventional analysis results and optimization methods in unimodal federated learning inapplicable. In addition, fixed latency demand and limited communication bandwidth pose significant challenges for deploying MFL in wireless scenarios. To optimize the wireless MFL performance on modal heterogeneity, this paper proposes a joint client scheduling and bandwidth allocation (JCSBA) algorithm based on a decision-level fusion architecture with adding a unimodal loss function. Specifically, with the decision results, the unimodal loss functions are added to both the training objective and local update loss functions to accelerate multimodal convergence and improve unimodal performance. To characterize MFL performance, we derive a closed-form upper bound related to client and modality scheduling and minimize the derived bound under the latency, energy, and bandwidth constraints through JCSBA. Experimental results on multimodal datasets demonstrate that the JCSBA algorithm improves the multimodal accuracy and the unimodal accuracy by 4.06% and 2.73%, respectively, compared to conventional algorithms.

cs.DC↗

Integrating Movable Antennas and Intelligent Reflecting Surfaces for Coverage Enhancement

This paper investigates an intelligent reflecting surface (IRS)-aided movable antenna (MA) system, where multiple IRSs cooperate with a multi-MA base station to extend wireless coverage to multiple target areas. The objective is to maximize the worst-case signal-to-noise ratio (SNR) across all locations within these areas through joint optimization of MA positions, IRS phase shifts, and transmit beamforming. To achieve this while balancing the performance-cost trade-off, we propose three coverage-enhancement schemes: the area-adaptive MA-IRS scheme, where both MA positions and IRS phase shifts are adaptively adjusted for each target area; the area-adaptive MA-staIRS scheme, where only MA positions are adjusted, while IRS phase shifts remain unchanged after initial configuration (with staIRS denoting static IRSs); and the shared MA-staIRS scheme, where a common MA placement and static IRS configuration are applied across all areas. These schemes lead to challenging non-convex optimization problems with implicit objectives, which are difficult to solve optimally. To address these problems, we propose a general algorithmic framework that can solve each problem efficiently albeit suboptimally. Simulation results demonstrate that: 1) the proposed MA-based schemes consistently outperform their fixed-position antenna (FPA)-based counterparts under both area-adaptive and static IRS configurations, with the area-adaptive MA-IRS scheme achieving the best worst-case SNR; 2) as transmit antennas are typically far fewer than IRS elements, the area-adaptive MA-staIRS scheme may underperform the baseline FPA scheme with area-adaptive IRSs in worst-case SNR, but a modest increase in antenna number can reverse this; 3) under a fixed total cost, the optimal MA-to-IRS-element ratio for worst-case SNR maximization is empirically found to be proportional to the reciprocal of their unit cost ratio.

eess.SP↗

Next-to-leading-order QCD corrections to nucleon Dirac form factors

The leading-order perturbative QCD (pQCD) predictions to nucleon electromagnetic form factors were first made in late 70s. In this Letter for the first time we accomplish the calculation of the next-to-leading-order (NLO) QCD corrections to nucleon's Dirac form factors at large momentum transfer, to the leading-twist accuracy in collinear factorization approach, specifically within the Krankl and Manashov renormalization scheme. The effect of NLO perturbative corrections turns out to be positive and substantial. Taking the nucleon leading-twist light-cone-distribution amplitudes (LCDAs) determined from the recent lattice simulations as input, we find that the state-of-the-art pQCD predictions significantly underestimate the available nucleon Dirac form factors in both space-like and time-like domains. This nuisance indicates that some additional soft nonfactorizable contribution might be called for to account for the measured nucleon electromagnetic form factor data up to $Q^2\approx 30\;{\rm GeV^2}$.

hep-ph↗

Reduction of Feynman Integrals in the Parametric Representation IV: Integrals with Irregular Integration Regions

Parametric Feynman integrals with the regions of integration defined by some polynomials are considered in this paper. It is shown that integrals with irregular integration regions can be converted to standard parametric integrals, for which a reduction method is known. An application of this method to the analytic calculation of three-point energy correlators is presented. In principle, this method applies to more general event shapes and even jet observables.

hep-ph↗

Unveiling quantum criticality of disordered Aubry-André-Harper models via typical fidelity susceptibility

In this study, we investigate the localization transition and quantum criticality {in the ground state of the} disordered Aubry-André-Harper (AAH) model, where a quasiperiodic potential is hybridized with a disordered potential. In the clean limit, the AAH model undergoes a localization transition from an extended phase to a localized phase via an intermediate critical phase as the strength of the quasiperiodic potential is varied. While the staggered potential merely shifts the critical point to a lower value, Fibonacci and Thue-Morse potentials induce immediate localization. This contrast reveals the sensitivity of localization behavior to the structural complexity of the potential, with the onset of localization correlating with the sequence's complexity. More specifically, the system follows a hierarchy defined by the complexity measures of the applied potentials. In addition, the typical fidelity susceptibility exhibits a power-law scaling behavior at the localization transition, enabling reliable extraction of the critical exponent. We focus on the AAH model with the Fibonacci potential due to its minimal finite-size effects compared to other cases. For the disordered AAH model with the Fibonacci potential, we determine critical exponents that differ from those of the AAH model without disorder and the Anderson model. Moreover, despite differences in localization behavior, we find that the disordered AAH models with the staggered potential and the Fibonacci potential share the same correlation-length critical exponent. These findings provide a unified framework for understanding localization transitions in quasiperiodic systems and are amenable to experimental validation using emerging techniques.

cond-mat.dis-nn↗

Think Before Recommend: Unleashing the Latent Reasoning Power for Sequential Recommendation

Sequential Recommendation (SeqRec) aims to predict the next item by capturing sequential patterns from users' historical interactions, playing a crucial role in many real-world recommender systems. However, existing approaches predominantly adopt a direct forward computation paradigm, where the final hidden state of the sequence encoder serves as the user representation. We argue that this inference paradigm, due to its limited computational depth, struggles to model the complex evolving nature of user preferences and lacks a nuanced understanding of long-tail items, leading to suboptimal performance. To address this issue, we propose \textbf{ReaRec}, the first inference-time computing framework for recommender systems, which enhances user representations through implicit multi-step reasoning. Specifically, ReaRec autoregressively feeds the sequence's last hidden state into the sequential recommender while incorporating special reasoning position embeddings to decouple the original item encoding space from the multi-step reasoning space. Moreover, we introduce two lightweight reasoning-based learning methods, Ensemble Reasoning Learning (ERL) and Progressive Reasoning Learning (PRL), to further effectively exploit ReaRec's reasoning potential. Extensive experiments on five public real-world datasets and different SeqRec architectures demonstrate the generality and effectiveness of our proposed ReaRec. Remarkably, post-hoc analyses reveal that ReaRec significantly elevates the performance ceiling of multiple sequential recommendation backbones by approximately 30\%-50\%. Thus, we believe this work can open a new and promising avenue for future research in inference-time computing for sequential recommendation.

cs.IR↗

RecGPT Technical Report

Recommender systems are among the most impactful applications of artificial intelligence, serving as critical infrastructure connecting users, merchants, and platforms. However, most current industrial systems remain heavily reliant on historical co-occurrence patterns and log-fitting objectives, i.e., optimizing for past user interactions without explicitly modeling user intent. This log-fitting approach often leads to overfitting to narrow historical preferences, failing to capture users' evolving and latent interests. As a result, it reinforces filter bubbles and long-tail phenomena, ultimately harming user experience and threatening the sustainability of the whole recommendation ecosystem. To address these challenges, we rethink the overall design paradigm of recommender systems and propose RecGPT, a next-generation framework that places user intent at the center of the recommendation pipeline. By integrating large language models (LLMs) into key stages of user interest mining, item retrieval, and explanation generation, RecGPT transforms log-fitting recommendation into an intent-centric process. To effectively align general-purpose LLMs to the above domain-specific recommendation tasks at scale, RecGPT incorporates a multi-stage training paradigm, which integrates reasoning-enhanced pre-alignment and self-training evolution, guided by a Human-LLM cooperative judge system. Currently, RecGPT has been fully deployed on the Taobao App. Online experiments demonstrate that RecGPT achieves consistent performance gains across stakeholders: users benefit from increased content diversity and satisfaction, merchants and the platform gain greater exposure and conversions. These comprehensive improvement results across all stakeholders validates that LLM-driven, intent-centric design can foster a more sustainable and mutually beneficial recommendation ecosystem.

cs.IR↗

Quantitative Benchmarking of Remote Excitation in Plasmonic Sensing with Enhanced Signal-to-Noise Ratio

Remote excitation using guided optical modes -- such as waveguides, fibers, or surface waves -- offers a promising alternative to direct optical excitation for surface-enhanced Raman scattering (SERS), particularly in applications requiring reduced heating, minimal invasiveness, and on-chip integration. However, despite its widespread use, systematic comparisons between remote and direct excitation remain limited. Here, we quantitatively benchmark both schemes by measuring power-dependent SERS responses from individual plasmonic nanogaps. We statistically analyze the maximum achievable SERS intensity before structural degradation, extract local temperatures, and evaluate signal-to-noise ratios (SNR). Our findings reveal that both remote and direct SERS share a common electric-field limit, despite exhibiting different levels of heating. This suggests that spectral evolution is primarily governed by the local electric field, which drives nanoscale atomic migration rather than excessive heating. Nonetheless, the lower heating associated with remote excitation enhances the Raman SNR by approximately 30%, improving measurement quality without compromising signal strength. This study establishes a quantitative framework for evaluating excitation strategies in plasmonic sensing, and challenges common assumptions about the role of heating in nanostructural stability under strong optical excitation.

physics.optics↗

Plasmonic Nanoparticle-in-nanoslit Antenna as Independently Tunable Dual-Resonant Systems for Efficient Frequency Upconversion

Dual-band plasmonic nanoantennas, exhibiting two widely separated user-defined resonances, are fundamental building blocks for the investigation and optimization of plasmon-enhanced optical phenomena, including photoluminescence, Raman scattering, and various nonlinear effects such as harmonic generation or sum-frequency generation, parametric down-conversion, etc. The nanoparticle-on-slit (NPoS) or nanoparticle-in-groove (NPiG) is a recently proposed dual-band antenna with independently tunable resonances at mid-infrared and visible wavelengths. It was used to enhance the corresponding sum- and difference-frequency generation processes from optimally located molecules by an estimated $10^{13}$-fold. However, the theoretical understanding of such structures and their eigenmodes remains poor, hindering further optimization and limiting broader applications. Here, we explore a diverse range of nanocavity-like quasi-normal modes (QNMs) supported by NPoS structures, examining the contributions of both their near-field (i.e., giant photonic density of states) and far-field (i.e., spatial radiation patterns) characteristics to frequency upconversion. We identify methods for independently tuning the visible and mid-infrared resonances while conserving a good mode overlap in the near field, which is essential for efficient nonlinear processes. Moreover, through mode analysis, we unveil an experimentally unexplored fundamental resonance with greater field enhancement and much-improved mode overlap with the mid-infrared field, which could, in principle, further boost the mid-infrared upconversion efficiency by 5-fold compared to existing results. This work helps to rationalize and optimize the enhancement of nonlinear effects across a wide spectral range using a flexible and experimentally attractive nanoplasmonic platform.

physics.optics↗

Enhanced Velocity-Adaptive Scheme: Joint Fair Access and Age of Information Optimization in Vehicular Networks

In this paper, we consider the fair access problem and the Age of Information (AoI) under 5G New Radio (NR) Vehicle-to-Infrastructure (V2I) Mode 2 in vehicular networks. Specifically, vehicles follow Mode 2 to communicate with Roadside Units (RSUs) to obtain accurate data for driving assistance.Nevertheless, vehicles often have different velocity when they are moving in adjacent lanes, leading to difference in RSU dwelltime and communication duration. This results in unfair access to network resources, potentially influencing driving safety. To ensure the freshness of received data, the AoI should be analyzed. Mode 2 introduces a novel preemption mechanism, necessitating simultaneous optimization of fair access and AoI to guarantee timely and relevant data delivery. We propose a joint optimization framework for vehicular network, defining a fairness index and employing Stochastic Hybrid Systems (SHS) to model AoI under preemption mechanism. By adaptively adjusting the selection window of Semi-Persistent Scheduling (SPS) in Mode 2, we address the optimization of fairness and AoI. We apply a large language model (LLM)-Based Multi-objective Evolutionary Algorithm Based on Decomposition (MOEA/D) to solve this problem. Simulation results demonstrate the effectiveness of our scheme in balancing fair access and minimizing AoI.

cs.NI↗

RIS Codebook Index Assignment under Imperfect Control Links Using TSP-Inspired Optimization

Reconfigurable Intelligent Surfaces (RIS) promise transformative gains in wireless communications by enabling programmable control of the propagation environment through discrete phase configurations. In practical deployments, the control of RIS phase states is typically managed using finite codebooks, with configuration indices transmitted over low latency, yet imperfect, wireless feedback channels. Even rare feedback bit errors can lead to significant mismatches between intended and applied RIS states, degrading system performance. This paper addresses the challenge of robust RIS codebook index assignment by formulating it as a combinatorial optimization problem, equivalent to the Traveling Salesman Problem (TSP), where codewords are "cities" and edge weights reflect SNR degradation under codeword confusion. A novel three-phase heuristic algorithm is proposed to solve this, consisting of a provision phase, a shotgun phase, and a fuzzy concatenation phase. Simulation results show that the method outperforms conventional indexing strategies and achieves near-optimal robustness to index errors, while also being scalable and hardwareagnostic for real time deployment. Future work includes multiple bits error correction and online adaptive mapping for time varying channels.

cs.IT↗

Exploiting Movable Antennas in NOMA Networks: Joint Beamforming, Power Allocation and Antenna Position Optimization

This paper investigates the movable antenna (MA)- assisted downlink non-orthogonal multiple access (NOMA) network to maximize system throughput. In the considered scenario, both the base station (BS) and users are equipped with MA, and a predetermined successive interference cancellation (SIC) decoding order is adopted. Based on the field-response channel model, we formulate a complex, non-convex problem to jointly optimize the BS beamforming, power allocation, and MA positions at both the transmitter and receivers. To address this, we propose an efficient algorithm based on an alternating optimization (AO) framework, which decomposes the original problem into three distinct subproblems. By employing sequential parametric convex approximation (SPCA) and successive convex approximation (SCA) techniques, the non-convex constraints within each subproblem are transformed into tractable. This methodology ensures the algorithm converges to a stable, locally optimal solution. Numerical results validate that the proposed system, which fully exploits the degrees of freedom from antenna mobility at both ends, significantly outperforms benchmarks in terms of throughput.

eess.SP↗

Max-Min Rate Optimization for Multigroup Multicast MISO Systems Via Novel Transmissive RIS Transceiver

This paper investigates a novel transmissive reconfigurable intelligent surface (RIS) transceiver architectureenabled multigroup multicast downlink communication system. Under this setup, an optimization problem is formulated to maximize the minimum rate of users across all groups, subject to the maximum available power of each RIS unit. Due to the nondifferentiable nature of the objective function, the max-min rate problem is challenging to solve. To tackle this difficult problem, we develop an iterative solution by leveraging the successive convex approximation (SCA) and the penalty function method. However, the above approach has high computational complexity and may lead to compromised performance. To overcome these drawbacks, we design an efficient second-order cone programming (SOCP)-based method using the weighted minimum mean squared error (WMMSE) framework to reduce computational complexity. Furthermore, to further reduce the computational complexity, we also propose a low-complexity and solver-free algorithm that analytically updates all variables by combining the smooth approximation theory and the majorization-minimization (MM) method. Numerical results are provided to verify the convergence and effectiveness of our proposed three algorithms. It is also demonstrated that the SOCP-based method outperforms the penalty-based algorithm in terms of both the achieved min rate and the computational complexity. In contrast, the lowcomplexity design achieves significantly lower complexity with only slightly degraded performance.

eess.SP↗

Multi-IRS Aided ISAC System: Multi-Path Exploitation Versus Reduction

This paper investigates a multi-intelligent reflecting surface (IRS) aided integrated sensing and communication (ISAC) system, where multiple IRSs are strategically deployed not only to assist the communication from a multi-antenna base station (BS) to a multi-antenna communication user (CU), but also enable the sensing service for a point target in the non-line-of-sight (NLoS) region of the BS. First, we propose a hybrid multi-IRS architecture, which consists of several passive IRSs and one semi-passive IRS equipped with both active sensors and reflecting elements. To be specific, the active sensors are exploited to receive the echo signals for estimating the target's angle information, and the multiple reflecting paths provided by multi-IRS are employed to improve the degree of freedoms (DoFs) of communication. Under the given budget on the number of total IRSs elements, we theoretically show that increasing the number of deployed IRSs is beneficial for improving DoFs of spatial multiplexing for communication while increasing the Cramer-Rao bound (CRB) of target estimation, which unveils a fundamental tradeoff between the sensing and communication performance. To characterize the rate-CRB tradeoff, we study a rate maximization problem, by optimizing the BS transmit covariance matrix, IRSs phase-shifts, and the number of deployed IRSs, subject to a maximum CRB constraint. Analytical results reveal that the communication-oriented design becomes optimal when the total number of IRSs elements exceeds a certain threshold, wherein the relationships of the rate and CRB with the number of IRS elements/sensors, transmit power, and the number of deployed IRSs are theoretically derived and demystified. Simulation results validate our theoretical findings and also demonstrate the superiority of our proposed designs over the benchmark schemes.

cs.IT↗

Movable Antennas Enabled Wireless-Powered NOMA: Continuous and Discrete Positioning Designs

This paper investigates a movable antenna (MA)-enabled wireless-powered communication network (WPCN), where multiple wireless devices (WDs) first harvest energy from the downlink (DL) signal broadcast by a hybrid access point (HAP) and then transmit information in the uplink (UL) using non-orthogonal multiple access. Unlike conventional WPCNs with fixed-position antennas (FPAs), this MA-enabled WPCN allows the MAs at the HAP and the WDs to adjust their positions twice: once before DL wireless power transfer and once before DL wireless information transmission. Our goal is to maximize the system sum throughput by jointly optimizing the MA positions, the time allocation, and the UL power allocation. Considering the characteristics of antenna movement, we explore both continuous and discrete positioning designs, which, after formulation, are found to be non-convex optimization problems. Before tackling these problems, we rigorously prove that using identical MA positions for both DL and UL is the optimal strategy in both scenarios, thereby greatly simplifying the problems and enabling easier practical implementation of the system. We then propose alternating optimization-based algorithms for the resulting simplified problems. Simulation results show that: 1) the proposed continuous MA scheme can enhance the sum throughput by up to 395.71% compared to the benchmark with FPAs, even when additional compensation transmission time is provided to the latter; 2) a step size of one-quarter wavelength for the MA motion driver is generally sufficient for the proposed discrete MA scheme to achieve over 80% of the sum throughput performance of the continuous MA scheme; 3) when each moving region is large enough to include multiple optimal positions for the continuous MA scheme, the discrete MA scheme can achieve comparable sum throughput without requiring an excessively small step size.

eess.SP↗

Semantic-Aware Spectrum Sharing in Internet of Vehicles Based on Deep Reinforcement Learning

This work aims to investigate semantic communication in high-speed mobile Internet of vehicles (IoV) environments, with a focus on the spectrum sharing between vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. We specifically address spectrum scarcity and network traffic and then propose a semantic-aware spectrum sharing algorithm (SSS) based on the deep reinforcement learning (DRL) soft actor-critic (SAC) approach. Firstly, we delve into the extraction of semantic information. Secondly, we redefine metrics for semantic information in V2V and V2I spectrum sharing in IoV environments, introducing high-speed semantic spectrum efficiency (HSSE) and semantic transmission rate (HSR). Finally, we employ the SAC algorithm for decision optimization in V2V and V2I spectrum sharing based on semantic information. This optimization encompasses the optimal link of V2V and V2I sharing strategies, the transmission power for vehicles sending semantic information and the length of transmitted semantic symbols, aiming at maximizing HSSE of V2I and enhancing success rate of effective semantic information transmission (SRS) of V2V. Experimental results demonstrate that the SSS algorithm outperforms other baseline algorithms, including other traditional-communication-based spectrum sharing algorithms and spectrum sharing algorithm using other reinforcement learning approaches. The SSS algorithm exhibits a 15% increase in HSSE and approximately a 7% increase in SRS.

cs.LG↗

Deep-Reinforcement-Learning-Based AoI-Aware Resource Allocation for RIS-Aided IoV Networks

Reconfigurable Intelligent Surface (RIS) is a pivotal technology in communication, offering an alternative path that significantly enhances the link quality in wireless communication environments. In this paper, we propose a RIS-assisted internet of vehicles (IoV) network, considering the vehicle-to-everything (V2X) communication method. In addition, in order to improve the timeliness of vehicle-to-infrastructure (V2I) links and the stability of vehicle-to-vehicle (V2V) links, we introduce the age of information (AoI) model and the payload transmission probability model. Therefore, with the objective of minimizing the AoI of V2I links and prioritizing transmission of V2V links payload, we construct this optimization problem as an Markov decision process (MDP) problem in which the BS serves as an agent to allocate resources and control phase-shift for the vehicles using the soft actor-critic (SAC) algorithm, which gradually converges and maintains a high stability. A AoI-aware joint vehicular resource allocation and RIS phase-shift control scheme based on SAC algorithm is proposed and simulation results show that its convergence speed, cumulative reward, AoI performance, and payload transmission probability outperforms those of proximal policy optimization (PPO), deep deterministic policy gradient (DDPG), twin delayed deep deterministic policy gradient (TD3) and stochastic algorithms.

cs.LG↗

Resource Allocation for Twin Maintenance and Computing Task Processing in Digital Twin Vehicular Edge Computing Network

As a promising technology, vehicular edge computing (VEC) can provide computing and caching services by deploying VEC servers near vehicles. However, VEC networks still face challenges such as high vehicle mobility. Digital twin (DT), an emerging technology, can predict, estimate, and analyze real-time states by digitally modeling objects in the physical world. By integrating DT with VEC, a virtual vehicle DT can be created in the VEC server to monitor the real-time operating status of vehicles. However, maintaining the vehicle DT model requires ongoing attention from the VEC server, which also needs to offer computing services for the vehicles. Therefore, effective allocation and scheduling of VEC server resources are crucial. This study focuses on a general VEC network with a single VEC service and multiple vehicles, examining the two types of delays caused by twin maintenance and computational processing within the network. By transforming the problem using satisfaction functions, we propose an optimization problem aimed at maximizing each vehicle's resource utility to determine the optimal resource allocation strategy. Given the non-convex nature of the issue, we employ multi-agent Markov decision processes to reformulate the problem. Subsequently, we propose the twin maintenance and computing task processing resource collaborative scheduling (MADRL-CSTC) algorithm, which leverages multi-agent deep reinforcement learning. Through experimental comparisons with alternative algorithms, it demonstrates that our proposed approach is effective in terms of resource allocation.

cs.LG↗