arXiv subjects

Tsung-Hui Chang

Publications and source records attributed to Tsung-Hui Chang.

At least 19 recordsLinked to original sources

arXiv2026

A Foundation Model for Large-Scale Wireless Network Planning , Operation and Optimization

Wireless cellular networks provide critical infrastructure for communication, transportation and industry, making reliable connectivity essential to modern society. Delivering this connectivity requires accurate models of the radio environment shaped jointly by network infrastructure and their surroundings. Such models underpin base-station deployment, network operation and parameter optimization, yet city-scale radio environments remain difficult to capture. Physics-based tools require detailed site descriptions and computation, whereas task-specific models need dedicated measurements and transfer poorly across deployments. Here we introduce ChaRT, a foundation model that learns transferable radio representations from measurement reports routinely generated by operational cellular networks. These reports provide abundant joint observations across multiple cells and beams without additional measurement campaigns. ChaRT incorporates beam-level angular structure, network hierarchy and propagation-regime diversity into its architecture, and is pretrained through context-aware masked beam modelling and self-distillation. We train ChaRT on more than one billion reports comprising 18.2 billion beam-level observations from 3,503 cells in one city. With a single set of weights, ChaRT reconstructs radio environments in unseen cities and transfers to new-site prediction, radio map construction and network parameter tuning. With only 1% of labelled data, it supports user localization, beam prediction, propagation scenario classification and estimation of the signal-to-interference-plus-noise ratio. The learned representation further enables beamspace clustering for reusable radio-grid construction. These results establish operational measurement reports as a scalable data foundation for transferable cellular-network intelligence.

eess.SP↗

arXiv2026

Generalized Pinching-Antenna Systems: A Radio-Stripe-Based Realization

This paper investigates radio stripes (RSs) as a practical realization of generalized pinching antennas and proposes an RS-based generalized pinching-antenna (RS-GPA) framework. Unlike dielectric-waveguide-based passive pinching antennas that rely on passive coupling from a guided wave into free space, RSs employ active antenna processing units (APUs) deployed along a shared cable for local transmission, reception, and signal processing. This cable-like active architecture offers flexible installation and broad frequency applicability, while allowing selected APUs to act as discrete and controllable radiation or reception points for location-flexible wireless access. Based on the proposed RS-GPA framework, we establish the system and channel models by accounting for the distance-dependent APU-user channels. For downlink transmission, we formulate a circuit-power-aware sparse APU activation and beamforming problem and develop a reweighted group-sparse beamforming algorithm. To reveal the activation principle, we analyze the single-user downlink case and characterize when an additional APU should be activated by balancing transmit-power saving and circuit-power cost. Inspired by this insight, a geometry-guided low-complexity multiuser algorithm is proposed. For uplink transmission, we formulate a joint APU activation and user power control problem and develop a geometry-guided sparse activation design. Numerical results show that the proposed RS-GPA framework substantially reduces the total consumed power compared with benchmark schemes, while the geometry-guided algorithm achieves near-identical consumed-power performance to the group-sparse design with significantly lower runtime.

eess.SP↗

arXiv2026

Point-Cloud-Assistant Localized Statistical Channel Prediction by Tangent Gaussian Splatting

Accurate, site-specific channel information is crucial for optimizing next-generation wireless networks. Among various approaches, localized statistical channel modeling (LSCM), which models the channel multipath angular power spectrum (APS) from the reference signal received power (RSRP) measurement, has emerged as a state-of-the-art method tailored for efficient network optimization. However, despite its effectiveness, LSCM cannot predict APS at the vast majority of locations where no measurements are available, which significantly restricts its applicability in large-scale, real-world scenarios. To address this challenge, we present point-cloud-assisted tangent Gaussian splatting (PC-TGS), the first framework to extrapolate APS to unmeasured outdoor grids by integrating sparse radio measurements with dense LiDAR-based geometry. PC-TGS represents environmental scatterers as anisotropic 3D Gaussians, initialized and refined through a relaxed-mean reparameterization of the raw point cloud. A tangent-plane projection accurately maps each Gaussian into the local angular domain, while a depth-aware electromagnetic splatting process aggregates their contributions. To ensure practical deployment, we derive a closed-form Gaussian-weighted average (GWA) for APS bin integration and provide a provable error bound. { Evaluations on a LiDAR-scanned city-scale dataset (5M points, 6,310 RSRP samples) demonstrate that PC-TGS achieves better APS and RSRP prediction performance compared to state-of-the-art baselines and faster inference time for APS extrapolation task. These results highlight the potential of PC-TGS to enable geometry-aware and data-efficient channel prediction in large-scale wireless digital twins.

eess.SP↗

arXiv2026

Eliminating Inductive Bias in Reward Models with Information-Theoretic Guidance

Reward models (RMs) are essential in reinforcement learning from human feedback (RLHF) to align large language models (LLMs) with human values. However, RM training data is commonly recognized as low-quality, containing inductive biases that can easily lead to overfitting and reward hacking. For example, more detailed and comprehensive responses are usually human-preferred but with more words, leading response length to become one of the inevitable inductive biases. A limited number of prior RM debiasing approaches either target a single specific type of bias or model the problem with only simple linear correlations, \textit{e.g.}, Pearson coefficients. To mitigate more complex and diverse inductive biases in reward modeling, we introduce a novel information-theoretic debiasing method called \textbf{D}ebiasing via \textbf{I}nformation optimization for \textbf{R}M (DIR). Inspired by the information bottleneck (IB), we maximize the mutual information (MI) between RM scores and human preference pairs, while minimizing the MI between RM outputs and biased attributes of preference inputs. With theoretical justification from information theory, DIR can handle more sophisticated types of biases with non-linear correlations, broadly extending the real-world application scenarios for RM debiasing methods. In experiments, we verify the effectiveness of DIR with three types of inductive biases: \textit{response length}, \textit{sycophancy}, and \textit{format}. We discover that DIR not only effectively mitigates target inductive biases but also enhances RLHF performance across diverse benchmarks, yielding better generalization abilities. The code and training recipes are available at https://github.com/Qwen-Applications/DIR.

cs.LG↗

arXiv2026

Power Minimization in Pinching-Antenna Systems under Probabilistic LoS Blockage

With great flexibility to adjust antenna positions, pinching antennas (PAs) are promising for alleviating large-scale attenuation in wireless networks. In this work, we investigate the antenna positioning and beamforming (AP-BF) design in a multi-PA multi-user system under probabilistic light-of-sight (LoS) blockage and formulate a power minimization problem subject to per-user signal-to-noise ratio (SNR) constraints. For a single PA, we prove the convexity of the simplified problem and obtain its global optimum. For multiple PAs, we derive closed-form BF structures and develop an efficient first-order algorithm to achieve high-quality local solutions. Moreover, the impact of link correlation on the transmit power is analyzed theoretically. Extensive numerical results validate the efficacy of our proposed designs and the substantial performance advantage of PA systems compared with conventional fixed-antenna systems in a term of power saving.

eess.SP↗

arXiv2026

QoS-Constrained Scheduling in Multi-Cell Multi-User MIMO Networks

In 5G and beyond networks, efficient scheduling is essential to exploit the gains of multi-user MIMO (MU-MIMO) equipped with carrier aggregation and joint transmission (JT). However, cross-cell and cross-carrier scheduling under QoS constraints is challenging due to the strong coupling across users, base stations, and carriers. In this work, we address this problem in multi-cell MU-MIMO networks to maximize system throughput for both JT and non-JT users under rate constraints. The optimization is highly complex as scheduling variables and beamforming (BF) vectors are intertwined. To tackle it, we propose an approximate but tractable surrogate by leveraging the eigen-based zero-forcing BF and massive MIMO asymptotics. The reformulated problem has a separable structure and is amenable to efficient solutions by a penalty-based block coordinate descent method. Simulations demonstrate that the proposed scheduler not only meets the QoS requirements well but also achieves remarkable throughput gains over existing schemes.

eess.SP↗

arXiv2026

Distributed User Scheduling in Multi-Cell MIMO O-RAN with QoS Constraints

Distributed scheduling is essential for open radio access network (O-RAN) employing advanced physical-layer techniques such as multi-user MIMO (MU-MIMO), carrier aggregation (CA), and joint transmission (JT). This work investigates the multi-component-carrier (multi-CC) resource block group (RBG) scheduling in MU-MIMO O-RAN with both JT and non-JT users. We formulate a scheduling optimization problem to maximize throughput subject to user-specific quality of service (QoS) requirements while ensuring consistent allocations across cooperating O-RAN radio units (O-RUs) required by JT transmission. The strong variable coupling, non-convexity, and combinatorial complexity make the problem highly challenging. To tackle this, we extend the eigen-based zero-forcing transceiver design to JT users and leverage massive MIMO asymptotic properties to derive a tractable, separable rate approximation. Building on this, we develop two solutions: a centralized block coordinate descent benchmark and a distributed scheduler aligned with the O-RAN architecture. The proposed distributed scheme achieves near-centralized performance with only one round of lightweight coordination among cells, significantly reducing complexity and delay. Extensive simulations validate that our distributed scheduler achieves high scalability, fast convergence, and better QoS satisfaction rate in large-scale MU-MIMO networks.

eess.SP↗

arXiv2026

Toward Distributed User Scheduling and Coordinated Beamforming in Multi-Cell mmWave Networks: A Sensing-Assisted Framework

Providing guaranteed quality of service for cell-edge users remains a longstanding challenge in wireless networks. While coordinated interference management was proposed decades ago, its potential has been limited by computational complexity and backhaul resource constraints. Distributed user scheduling and coordinated beamforming (D-USCB) offers a scalable solution but faces practical challenges in acquiring inter-cell channel state information (CSI), as base stations (BSs) are often restricted to signal strength measurements, and high-dimensional CSI exchange incurs substantial overhead. Inspired by integrated sensing and communication (ISAC), this paper proposes a sensing-assisted D-USCB (SD-USCB) framework to maximize the network throughput of multi-cell mmWave networks. Firstly, the framework leverages channel knowledge maps (CKMs) that map user locations to CSI estimates, where user locations are proactively sensed via ISAC echoes. Secondly, we employ a signal-to-average-leakage-plus-interference-plus-noise ratio (SALINR) metric for distributed ISAC beamforming optimization, in which BSs simultaneously communicate with users and sense their locations. These two components jointly enable distributed coordinated transmission with only user location information exchanged among BSs, thereby substantially reducing backhaul overhead. In addition, we devise efficient distributed user scheduling and ISAC beamforming algorithms to jointly optimize communication and sensing performance. Extensive numerical results demonstrate significant improvements in network throughput, validating the efficacy of the proposed framework.

eess.SP↗

arXiv2026

Generalized Pinching-Antenna Systems: A Tutorial on Principles, Design Strategies, and Future Directions

Pinching-antenna systems have emerged as a novel and transformative flexible-antenna architecture for next-generation wireless networks. They offer unprecedented flexibility and spatial reconfigurability by enabling dynamic positioning and activation of radiating elements along a signal-guiding medium (e.g., dielectric waveguides), which is not possible with conventional fixed antenna systems. In this paper, we introduce the concept of generalized pinching antenna systems, which retain the core principle of creating localized radiation points on demand, but can be physically realized in a variety of settings. These include implementations based on dielectric waveguides, leaky coaxial cables, surface-wave guiding structures, and other types of media, employing different feeding methods and activation mechanisms (e.g., mechanical, electronic, or hybrid). Despite differences in their physical realizations, they all share the same inherent ability to form, reposition, or deactivate radiation sites as needed, enabling user-centric and dynamic coverage. We first describe the underlying physical mechanisms of representative generalized pinching-antenna realizations and their associated wireless channel models, highlighting their unique propagation and reconfigurability characteristics compared with conventional antennas. Then, we review several representative pinching-antenna system architectures, ranging from single- to multiple-waveguide configurations, and discuss advanced design strategies tailored to these flexible deployments. Furthermore, we examine their integration with emerging wireless technologies to enable synergistic, user-centric solutions. Finally, we identify key open research challenges and outline future directions, charting a pathway toward the practical deployment of generalized pinching antennas in next-generation wireless networks.

eess.SP↗

arXiv2026

Environment-Aware Network-Level Design of Generalized Pinching-Antenna Systems--Part I: Traffic-Aware Case

Existing studies on generalized pinching-antenna systems are predominantly link-level, which optimize system parameters for a given user set with objectives defined by per-user performance metrics. Such designs do not capture network-level requirements, e.g., region-wide coverage and location fairness, and may require frequent re-optimization as users move or enter/leave, incurring control overhead and sensitivity to localization errors. Motivated by this gap, this two-part paper aims to develop an environment-aware network-level design framework for generalized pinching-antenna systems. Part I focuses on the traffic-aware case, where user presence is modeled statistically by a spatial traffic map and performance is optimized and evaluated in a traffic-aware sense; Part II addresses the geometry-aware case in obstacle-rich environments. In Part~I, we introduce traffic-weighted average SNR metrics and formulate two traffic-aware deployment problems: (i) maximizing the traffic-weighted network average SNR, and (ii) a fairness-oriented traffic-restricted max--min average-SNR design over traffic-dominant grids. To solve these nonconvex problems with low complexity, we reveal and exploit their separable structures. For the network-average objective, we establish unimodality properties of the hotspot-induced components and develop a candidate-based global maximization method that only needs to evaluate the objective at a small set of candidate antenna positions. For the traffic-restricted max--min objective, we develop a block coordinate decent framework where each coordinate update reduces to a globally solvable one-dimensional subproblem via an epigraph reformulation and bisection. Simulations show that traffic-aware pinching-antenna positioning consistently outperforms representative fixed and heuristic traffic-aware deployments in the considered setups.

eess.SP↗

arXiv2026

Environment-Aware Network-Level Design of Generalized Pinching-Antenna Systems--Part II: Geometry-Aware Case

This two-part paper aims to develop an environment-aware network-level design framework for generalized pinching-antenna systems to overcome the limitations of conventional link-level optimization, which is tightly coupled to instantaneous user geometry and thus sensitive to user mobility and localization errors. Part I investigates the traffic-aware case, where user presence is characterized statistically by a spatial traffic map and deployments are optimized using traffic-aware network-level metrics. Part II complements Part I by developing geometry-aware, blockage-aware network optimization for pinching-antenna systems in obstacle-rich environments. We introduce a grid-level average signal-to-noise (SNR) model with a deterministic LoS visibility indicator and a discrete activation architecture, where the geometry-dependent terms are computed offline in advance. Building on this model, we formulate two network-level activation problems: (i) average-SNR-threshold coverage maximization and (ii) fairness-oriented worst-grid average-SNR maximization. On the algorithmic side, we prove the coverage problem is NP-hard and derive an equivalent mix-integer linear programming reformulation through binary coverage variables and linear SNR linking constraints. To achieve scalability, we further develop a structure-exploiting coordinate-ascent method that updates one waveguide at a time using precomputed per-candidate SNR contributions. For the worst-grid objective, we adopt an epigraph reformulation and leverage the resulting monotone feasibility in the target SNR, enabling an efficient bisection-based solver with low-complexity feasibility checks over the discrete candidate set. Simulations results validate the proposed designs and quantify their gains under different environments and system parameters.

eess.SP↗

arXiv2026

PEMNet: Towards Autonomous and Enhanced Environment-Aware Mobile Networks

With 5G deployment and the evolution toward 6G, mobile networks must make decisions in highly dynamic environments under strict latency, energy, and spectrum constraints. Achieving this goal, however, depends on prior knowledge of spatial-temporal variations in wireless channels and traffic demands. This motivates a joint, site-specific representation of radio propagation and user demand that is queryable at low online overhead. In this work, we propose the perception embedding map (PEM), a localized framework that embeds fine-grained channel statistics together with grid-level spatial-temporal traffic patterns over a base station's coverage. PEM is built from standard-compliant measurements -- such as measurement report and scheduling/quality-of-service logs -- so it can be deployed and maintained at scale with low cost. Integrated into PEM, this joint knowledge supports enhanced environment-aware optimization across PHY, MAC, and network layers while substantially reducing training overhead and signaling. Compared with existing site-specific channel maps and digital-twin replicas, PEM distinctively emphasizes (i) joint channel-traffic embedding, which is essential for network optimization, and (ii) practical construction using standard measurements, enabling network autonomy while striking a favorable fidelity-cost balance.

cs.IT↗

arXiv2026

DeepFP: Deep-Unfolded Fractional Programming for MIMO Beamforming

This work proposes a mixed learning-based and optimization-based approach to the weighted-sum-rates beamforming problem in a multiple-input multiple-output (MIMO) wireless network. The conventional methods, i.e., the fractional programming (FP) method and the weighted minimum mean square error (WMMSE) algorithm, can be computationally demanding for two reasons: (i) they require inverting a sequence of matrices whose sizes are proportional to the number of antennas; (ii) they require tuning a set of Lagrange multipliers to account for the power constraints. The recently proposed method called the reduced WMMSE addresses the above two issues for a single cell. In contrast, for the multicell case, another recent method called the FastFP eliminates the large matrix inversion and the Lagrange multipliers by using an improved FP technique, but the update stepsize in the FastFP can be difficult to decide. As such, we propose integrating the deep unfolding network into the FastFP for the stepsize optimization. Numerical experiments show that the proposed method is much more efficient than the learning method based on the WMMSE algorithm.

cs.IT↗

arXiv2025

Robust Federated Learning in Unreliable Wireless Networks: A Client Selection Approach

Federated learning (FL) has emerged as a promising distributed learning paradigm for training deep neural networks (DNNs) at the wireless edge, but its performance can be severely hindered by unreliable wireless transmission and inherent data heterogeneity among clients. Existing solutions primarily address these challenges by incorporating wireless resource optimization strategies, often focusing on uplink resource allocation across clients under the assumption of homogeneous client-server network standards. However, these approaches overlooked the fact that mobile clients may connect to the server via diverse network standards (e.g., 4G, 5G, Wi-Fi) with customized configurations, limiting the flexibility of server-side modifications and restricting applicability in real-world commercial networks. This paper presents a novel theoretical analysis about how transmission failures in unreliable networks distort the effective label distributions of local samples, causing deviations from the global data distribution and introducing convergence bias in FL. Our analysis reveals that a carefully designed client selection strategy can mitigate biases induced by network unreliability and data heterogeneity. Motivated by this insight, we propose FedCote, a client selection approach that optimizes client selection probabilities without relying on wireless resource scheduling. Experimental results demonstrate the robustness of FedCote in DNN-based classification tasks under unreliable networks with frequent transmission failures.

cs.DC↗

arXiv2025

Robust Federated Fine-Tuning in Heterogeneous Networks with Unreliable Connections: An Aggregation View

Federated Fine-Tuning (FFT) has attracted growing interest as it leverages both server- and client-side data to enhance global model generalization while preserving privacy, and significantly reduces the computational burden on edge devices by avoiding training from scratch. Despite these advantages, FFT performance is often degraded by unreliable server-client connections and heterogeneous client data distributions. Most existing methods assume homogeneous network conditions or require prior knowledge of connection failures. However, these assumptions are impractical in real-world networks characterized by diverse communication standards (e.g., wired, Wi-Fi, 4G, and 5G) and heterogeneous failure patterns. To address these limitations, we propose FedAuto, a novel FFT framework that mitigates the combined effects of connection failures and data heterogeneity via adaptive aggregation. FedAuto operates without prior knowledge of network conditions or modifications to existing infrastructure, enabling seamless plug-and-play deployment. Moreover, we establish a rigorous convergence guarantee for FedAuto. By adopting a novel per-round aggregation perspective, our analysis removes the need for assumptions on connection failures probabilities or client selection strategies commonly imposed in prior work, and guarantees convergence of FedAuto for each individual realization, providing a stronger theoretical assurance. Extensive experiments demonstrate that FedAuto consistently outperforms state-of-the-art baselines under diverse connection failure scenarios for both full-parameter and partial-parameter fine-tuning (e.g., LoRA), and even surpasses strategies that rely on complex communication resource optimization.

cs.DC↗

arXiv2025

Pinching-Antenna System Design under Random LoS and NLoS Channels

Pinching antennas, realized through position-adjustable radiating elements along dielectric waveguides, have emerged as a promising flexible-antenna technology thanks to their ability to dynamically reshape large-scale channel conditions. However, most existing studies focus on idealized LoS-dominated environments, overlooking the stochastic nature of realistic wireless propagation. This paper investigates a more practical multiuser pinching-antenna system under a composite probabilistic channel model that captures distance-dependent LoS blockage and NLoS scattering. To account for both efficiency and reliability aspects of communication, two complementary design metrics are considered: an average signal-to-noise ratio (SNR) metric characterizing long-term throughput and fairness, and an outage-constrained metric ensuring a prescribed reliability level. Based on these metrics, we formulate two optimization problems: the first maximizes the max-min average SNR across users, while the second maximizes a guaranteed SNR threshold under per-user outage constraints. Although both problems are inherently nonconvex, we exploit their underlying monotonic structures and develop low-complexity, bisection-based algorithms that achieve globally optimal solutions using only simple scalar evaluations. Extensive simulations validate the effectiveness of the proposed methods and demonstrate that pinching-antenna systems significantly outperform conventional fixed-antenna designs even under random LoS and NLoS channels.

eess.SP↗

arXiv2025

Lightweight Federated Learning in Mobile Edge Computing with Statistical and Device Heterogeneity Awareness

Federated learning enables collaborative machine learning while preserving data privacy, but high communication and computation costs, exacerbated by statistical and device heterogeneity, limit its practicality in mobile edge computing. Existing compression methods like sparsification and pruning reduce per-round costs but may increase training rounds and thus the total training cost, especially under heterogeneous environments. We propose a lightweight personalized FL framework built on parameter decoupling, which separates the model into shared and private subspaces, enabling us to uniquely apply gradient sparsification to the shared component and model pruning to the private one. This structural separation confines communication compression to global knowledge exchange and computation reduction to local personalization, protecting personalization quality while adapting to heterogeneous client resources. We theoretically analyze convergence under the combined effects of sparsification and pruning, revealing a sparsity-pruning trade-off that links to the iteration complexity. Guided by this analysis, we formulate a joint optimization that selects per-client sparsity and pruning rates and wireless bandwidth to reduce end-to-end training time. Simulation results demonstrate faster convergence and substantial reductions in overall communication and computation costs with negligible accuracy loss, validating the benefits of coordinated and resource-aware personalization in resource-constrained heterogeneous environments.

eess.SY↗

arXiv2025

Adaptive Kernel Design for Bayesian Optimization Is a Piece of CAKE with LLMs

The efficiency of Bayesian optimization (BO) relies heavily on the choice of the Gaussian process (GP) kernel, which plays a central role in balancing exploration and exploitation under limited evaluation budgets. Traditional BO methods often rely on fixed or heuristic kernel selection strategies, which can result in slow convergence or suboptimal solutions when the chosen kernel is poorly suited to the underlying objective function. To address this limitation, we propose a freshly-baked Context-Aware Kernel Evolution (CAKE) to enhance BO with large language models (LLMs). Concretely, CAKE leverages LLMs as the crossover and mutation operators to adaptively generate and refine GP kernels based on the observed data throughout the optimization process. To maximize the power of CAKE, we further propose BIC-Acquisition Kernel Ranking (BAKER) to select the most effective kernel through balancing the model fit measured by the Bayesian information criterion (BIC) with the expected improvement at each iteration of BO. Extensive experiments demonstrate that our fresh CAKE-based BO method consistently outperforms established baselines across a range of real-world tasks, including hyperparameter optimization, controller tuning, and photonic chip design. Our code is publicly available at https://github.com/richardcsuwandi/cake.

cs.LG↗