arXiv subjects

Yunchuan Zhang

Publications and source records attributed to Yunchuan Zhang.

11 recordsLinked to original sources

arXiv2026

Leveraging Bayesian Optimization for Array Shape Self-Calibration in Underwater DoA Estimation

Flexible sensing arrays are commonly used in underwater acoustic networks, but suppressed by unpredictable geometric deformations. Existing array shape self-calibration methods often estimate individual element positions separately, leading to a high dimensional optimization problem over long arrays. To address this problem, this paper proposes a Bayesian Optimization-assisted Geometry Estimation (BOGE) strategy operating with a hierarchical optimization process and a physics-informed parametric model for array geometry correction. BOGE formulates array shape self-calibration as an optimization problem, where candidate geometries are evaluated by the noise subspace residual. We perform Bayesian optimization to configure the physics-informed parametric model and then refine the selected geometry through numerical optimization. Empirical results show that BOGE achieves lower mean geometric root mean square error (RMSE) than the benchmark methods across a wide range of noise levels. On the public SWellEx-96 dataset, BOGE achieves a geometric RMSE of $0.659$ meters at $166$ Hz. A lake trial further shows that BOGE provides fixed source localization and moving target tracking performance comparable to the comparison methods.

eess.SP↗

arXiv2026

Multi-Fidelity Bayesian Optimization for Nash Equilibria with Black-Box Utilities

Modern open and softwarized systems -- such as O-RAN telecom networks and cloud computing platforms -- host independently developed applications with distinct, and potentially conflicting, objectives. Coordinating the behavior of such applications to ensure stable system operation poses significant challenges, especially when each application's utility is accessible only via costly, black-box evaluations. In this paper, we consider a centralized optimization framework in which a system controller suggests joint configurations to multiple strategic players, representing different applications, with the goal of aligning their incentives toward a stable outcome. This interaction is modeled as a learned optimization with an equilibrium constraint in which the central optimizer learns the utility functions through sequential, multi-fidelity evaluations with the goal of identifying a pure Nash equilibrium (PNE). To address this challenge, we propose MF-UCB-PNE, a novel multi-fidelity Bayesian optimization strategy that leverages a budget-constrained sampling process to approximate PNE solutions. MF-UCB-PNE systematically balances exploration across low-cost approximations with high-fidelity exploitation steps, enabling efficient convergence to incentive-compatible configurations. We provide theoretical and empirical insights into the trade-offs between query cost and equilibrium accuracy, demonstrating the effectiveness of MF-UCB-PNE in identifying effective equilibrium solutions under limited cost budgets.

cs.GT↗

arXiv2026

Intelligent Distributed Optical Fiber Sensing in Transportation Infrastructures: Research Progress, Applications, and Challenges

Distributed optical fiber sensing (DOFS), along with its capabilities of long-range coverage, multi-parameter monitoring, and completely passive detection, emerges as one of the most promising non-destructive detection techniques for structural health monitoring (SHM) and operational assessment of linear transportation infrastructures. In this paper, we provide a state-of-the-art review on DOFS applications across typical linear infrastructure systems, encompassing highways, long-span bridges, rail transit networks, airport runways, and analogous linear structures. The comprehensive discussion consists of four critical research dimensions: 1) optical fiber selection for multi-parameter sensing and robust cable packaging techniques, 2) distributed sensing principles and signal processing algorithms, 3) diverse application scenarios in SHM and related fields, and 4) anomaly detection and event classification methodologies. Building upon the foundational introduction of DOFS technical principles and monitoring solutions for intelligent transportation infrastructure, this paper elaborates on system design approaches, sensing data analytics algorithms, and future research directions.

physics.optics↗

arXiv2025

Bayesian Optimization for Non-Cooperative Game-Based Radio Resource Management

Radio resource management in modern cellular networks often calls for the optimization of complex utility functions that are potentially conflicting between different base stations (BSs). Coordinating the resource allocation strategies efficiently across BSs to ensure stable network service poses significant challenges, especially when each utility is accessible only via costly, black-box evaluations. This paper considers formulating the resource allocation among spectrum sharing BSs as a non-cooperative game, with the goal of aligning their allocation incentives toward a stable outcome. To address this challenge, we propose PPR-UCB, a novel Bayesian optimization (BO) strategy that learns from sequential decision-evaluation pairs to approximate pure Nash equilibrium (PNE) solutions. PPR-UCB applies martingale techniques to Gaussian process (GP) surrogates and constructs high probability confidence bounds for utilities uncertainty quantification. Experiments on downlink transmission power allocation in a multi-cell multi-antenna system demonstrate the efficiency of PPR-UCB in identifying effective equilibrium solutions within a few data samples.

eess.SP↗

arXiv2025

DGAR: A Unified Domain Generalization Framework for RF-Based Human Activity Recognition

Radio-frequency (RF)-based human activity recognition (HAR) provides a contactless and privacy-preserving solution for monitoring human behavior in applications such as astronaut extravehicular activity monitoring, human-autonomy collaborative cockpit, and unmanned aerial vehicle surveillance. However, real-world deployments usually face the challenge of domain knowledge shifts arising from inter-subject variability, heterogeneous physical environments, and unseen activity patterns, resulting in significant performance degradation. To address this issue, we propose DGAR, a domain-generalized activity recognition framework that learns transferable representations without collecting data from the target domain. DGAR integrates instance-adaptive feature modulation with cross-domain distribution alignment to enhance both personalization and generalization. Specifically, it incorporates a squeeze-and-excitation (SE) block to extract salient spatiotemporal features and employs correlation alignment to mitigate inter-domain discrepancies. Extensive experiments on public RF-based datasets -- HUST-HAR, Lab-LFM, and Office-LFM -- demonstrate that DGAR consistently outperforms state-of-the-art baselines, achieving up to a 5.81% improvement in weighted F1-score. The empirical results substantiate the generalization capability of DGAR in real-time RF sensing across dynamic scenarios.

eess.SP↗

arXiv2025

Multi-Fidelity Bayesian Optimization With Across-Task Transferable Max-Value Entropy Search

In many applications, ranging from logistics to engineering, a designer is faced with a sequence of optimization tasks for which the objectives are in the form of black-box functions that are costly to evaluate. Furthermore, higher-fidelity evaluations of the optimization objectives often entail a larger cost. Existing multi-fidelity black-box optimization strategies select candidate solutions and fidelity levels with the goal of maximizing the information about the optimal value or the optimal solution for the current task. Assuming that successive optimization tasks are related, this paper introduces a novel information-theoretic acquisition function that balances the need to acquire information about the current task with the goal of collecting information transferable to future tasks. The proposed method transfers across tasks distributions over parameters of a Gaussian process surrogate model by implementing particle-based variational Bayesian updates. Theoretical insights based on the analysis of the expected regret substantiate the benefits of acquiring transferable knowledge across tasks. Furthermore, experimental results across synthetic and real-world examples reveal that the proposed acquisition strategy that caters to future tasks can significantly improve the optimization efficiency as soon as a sufficient number of tasks is processed.

cs.LG↗

arXiv2024

Transferable Multi-Fidelity Bayesian Optimization for Radio Resource Management

Radio resource allocation often calls for the optimization of black-box objective functions whose evaluation is expensive in real-world deployments. Conventional optimization methods apply separately to each new system configuration, causing the number of evaluations to be impractical under constraints on computational resources or timeliness. Toward a remedy for this issue, this paper introduces a multi-fidelity continual optimization framework that hinges on a novel information-theoretic acquisition function. The new strategy probes candidate solutions so as to balance the need to retrieve information about the current optimization task with the goal of acquiring information transferable to future resource allocation tasks, while satisfying a query budget constraint. Experiments on uplink power control in a multi-cell multi-antenna system demonstrate that the proposed method substantially improves the optimization efficiency after processing a sufficiently large number of tasks.

eess.SP↗

arXiv2024

Bayesian Optimization with Formal Safety Guarantees via Online Conformal Prediction

Black-box zero-th order optimization is a central primitive for applications in fields as diverse as finance, physics, and engineering. In a common formulation of this problem, a designer sequentially attempts candidate solutions, receiving noisy feedback on the value of each attempt from the system. In this paper, we study scenarios in which feedback is also provided on the safety of the attempted solution, and the optimizer is constrained to limit the number of unsafe solutions that are tried throughout the optimization process. Focusing on methods based on Bayesian optimization (BO), prior art has introduced an optimization scheme -- referred to as SAFEOPT -- that is guaranteed not to select any unsafe solution with a controllable probability over feedback noise as long as strict assumptions on the safety constraint function are met. In this paper, a novel BO-based approach is introduced that satisfies safety requirements irrespective of properties of the constraint function. This strong theoretical guarantee is obtained at the cost of allowing for an arbitrary, controllable but non-zero, rate of violation of the safety constraint. The proposed method, referred to as SAFE-BOCP, builds on online conformal prediction (CP) and is specialized to the cases in which feedback on the safety constraint is either noiseless or noisy. Experimental results on synthetic and real-world data validate the advantages and flexibility of the proposed SAFE-BOCP.

cs.LG↗

arXiv2023

Bayesian and Multi-Armed Contextual Meta-Optimization for Efficient Wireless Radio Resource Management

Optimal resource allocation in modern communication networks calls for the optimization of objective functions that are only accessible via costly separate evaluations for each candidate solution. The conventional approach carries out the optimization of resource-allocation parameters for each system configuration, characterized, e.g., by topology and traffic statistics, using global search methods such as Bayesian optimization (BO). These methods tend to require a large number of iterations, and hence a large number of key performance indicator (KPI) evaluations. In this paper, we propose the use of meta-learning to transfer knowledge from data collected from related, but distinct, configurations in order to speed up optimization on new network configurations. Specifically, we combine meta-learning with BO, as well as with multi-armed bandit (MAB) optimization, with the latter having the potential advantage of operating directly on a discrete search space. Furthermore, we introduce novel contextual meta-BO and meta-MAB algorithms, in which transfer of knowledge across configurations occurs at the level of a mapping from graph-based contextual information to resource-allocation parameters. Experiments for the problem of open loop power control (OLPC) parameter optimization for the uplink of multi-cell multi-antenna systems provide insights into the potential benefits of meta-learning and contextual optimization.

eess.SP↗

arXiv2022

Leveraging Channel Noise for Sampling and Privacy via Quantized Federated Langevin Monte Carlo

For engineering applications of artificial intelligence, Bayesian learning holds significant advantages over standard frequentist learning, including the capacity to quantify uncertainty. Langevin Monte Carlo (LMC) is an efficient gradient-based approximate Bayesian learning strategy that aims at producing samples drawn from the posterior distribution of the model parameters. Prior work focused on a distributed implementation of LMC over a multi-access wireless channel via analog modulation. In contrast, this paper proposes quantized federated LMC (FLMC), which integrates one-bit stochastic quantization of the local gradients with channel-driven sampling. Channel-driven sampling leverages channel noise for the purpose of contributing to Monte Carlo sampling, while also serving the role of privacy mechanism. Analog and digital implementations of wireless LMC are compared as a function of differential privacy (DP) requirements, revealing the advantages of the latter at sufficiently high signal-to-noise ratio.

cs.IT↗

arXiv2021

Transfer Bayesian Meta-learning via Weighted Free Energy Minimization

Meta-learning optimizes the hyperparameters of a training procedure, such as its initialization, kernel, or learning rate, based on data sampled from a number of auxiliary tasks. A key underlying assumption is that the auxiliary tasks, known as meta-training tasks, share the same generating distribution as the tasks to be encountered at deployment time, known as meta-test tasks. This may, however, not be the case when the test environment differ from the meta-training conditions. To address shifts in task generating distribution between meta-training and meta-testing phases, this paper introduces weighted free energy minimization (WFEM) for transfer meta-learning. We instantiate the proposed approach for non-parametric Bayesian regression and classification via Gaussian Processes (GPs). The method is validated on a toy sinusoidal regression problem, as well as on classification using miniImagenet and CUB data sets, through comparison with standard meta-learning of GP priors as implemented by PACOH.

cs.LG↗