arXiv subjects

Shih-Kai Chou

Publications and source records attributed to Shih-Kai Chou.

7 recordsLinked to original sources

arXiv2026

SAOITHE: Sustainable Age-of-Information-Based Timely Status Updating for Hardware-constrained Edge networks

In future large-scale deployments of 6G and beyond networks, collecting timely information, as measured by the Age of Information (AoI) metric, is becoming increasingly important. At the same time, the environmental impact, often characterized by the resulting Carbon Footprint (CF), depends on both the amount of consumed energy and the Carbon Intensity (CI), i.e., the amount of CO$_2$-equivalent emissions produced per unit of consumed energy. Since CI varies over time, minimizing energy is not equivalent to minimizing CF, as a status update with the same energy demand may result in a different carbon cost depending on when it is transmitted. This makes timely status updating a nontrivial scheduling problem. To address this challenge, we formulate carbon-aware status updating as a constrained Markov Decision Process (MDP) that minimizes a quadratic AoI penalty subject to CF budget, transmission duty-cycle, and channel-capacity constraints. We then propose Sustainable Age-of-Information-Based Timely Status Updating for Hardware-constrained Edge networks (SAOITHE), a Whittle-index-based scheduling solution that enables scalable real-time scheduling. Using real-world CI traces across low-, medium-, and high-CI regions, the results show that SAOITHE remains within the allocated CF budget while achieving lower AoI than baseline policies. Moreover, the gains are around 25% and 20% in low- and medium-CI regions, respectively, and up to 75% in high-CI settings, while preserving scalability.

cs.NI↗

arXiv2026

Automated Modeling Method for Pathloss Model Discovery

Modeling propagation is the cornerstone for designing and optimizing next-generation wireless systems, with a particular emphasis on 5G and beyond era. Traditional modeling methods have long relied on statistic-based techniques to characterize propagation behavior across different environments. With the expansion of wireless communication systems, there is a growing demand for methods that guarantee the accuracy and interpretability of modeling. Artificial intelligence (AI)-based techniques, in particular, are increasingly being adopted to overcome this challenge, although the interpretability is not assured with most of these methods. Inspired by recent advancements in AI, this paper proposes a novel approach that accelerates the discovery of path loss models while maintaining interpretability. The proposed method automates the formulation, evaluation, and refinement of the model, facilitating the discovery of the model. We examine two techniques: one based on Deep Symbolic Regression, offering full interpretability, and the second based on Kolmogorov-Arnold Networks, providing two levels of interpretability. Both approaches are evaluated on two synthetic and two real-world datasets. Our results show that Kolmogorov-Arnold Networks achieve the coefficient of determination value R^2 close to 1 with minimal prediction error, while Deep Symbolic Regression generates compact models with moderate accuracy. Moreover, on the selected examples, we demonstrate that automated methods outperform traditional methods, achieving up to 75% reduction in prediction errors, offering accurate and explainable solutions with potential to increase the efficiency of discovering next-generation path loss models.

cs.LG↗

arXiv2026

Towards a Sustainable Age of Information Metric: Carbon Footprint of Real-Time Status Updates

The timeliness of collected information is essential for monitoring and control in data-driven intelligent infrastructures. It is typically quantified using the Age of Information (AoI) metric, which has been widely adopted to capture the freshness of information received in the form of status updates. While AoI-based metrics quantify how timely the collected information is, they largely overlook the environmental impact associated with frequent transmissions, specifically, the resulting Carbon Footprint (CF). To address this gap, we introduce a carbon-aware AoI framework. We first derive closed-form expressions for the average AoI under constrained CF budgets for the baseline $M/M/1$ and $M/M/1^*$ queuing models, assuming fixed Carbon Intensity (CI). We then extend the analysis by treating CI as a dynamic, time-varying parameter and solve the AoI minimization problem. Our results show that minimizing AoI does not inherently minimize CF, highlighting a clear trade-off between information freshness and environmental impact. CI variability further affects achievable AoI, indicating that sustainable operation requires joint optimization of CF budgets, Signal-to-noise Ratio (SNR), and transmission scheduling. This work lays the foundation for carbon-aware information freshness optimization in next-generation networks.

cs.IT↗

arXiv2025

The Energy Cost of Artificial Intelligence Lifecycle in Communication Networks

Artificial Intelligence (AI) is being incorporated in several optimization, scheduling, orchestration as well as in native communication network functions. This paradigm shift results in increased energy consumption, however, quantifying the end-to-end energy consumption of adding intelligence to communication systems remains an open challenge since conventional energy consumption metrics focus on either communication, computation infrastructure, or model development. To address this, we propose a new metric, the Energy Cost of AI Lifecycle (eCAL) of an AI model in a system. eCAL captures the energy consumption throughout the development, deployment and utilization of an AI-model providing intelligence in a communication network by (i) analyzing the complexity of data collection and manipulation in individual components and (ii) deriving overall and per-bit energy consumption. We show that as a trained AI model is used more frequently for inference, its energy cost per inference decreases, since the fixed training energy is amortized over a growing number of inferences. For a simple case study we show that eCAL for 100 inferences is 2.73 times higher than for 1000 inferences. Additionally, we have developed a modular and extendable open-source simulation tool to enable researchers, practitioners, and engineers to calculate the end-to-end energy cost with various configurations and across various systems, ensuring adaptability to diverse use cases.

cs.ET↗

arXiv2025

SABER: Symbolic Regression-based Angle of Arrival and Beam Pattern Estimator

Accurate Angle-of-arrival (AoA) estimation is essential for next-generation wireless communication systems to enable reliable beamforming, high-precision localization, and integrated sensing. Unfortunately, classical high-resolution techniques require multi-element arrays and extensive snapshot collection, while generic Machine Learning (ML) approaches often yield black-box models that lack physical interpretability. To address these limitations, we propose a Symbolic Regression (SR)-based ML framework. Namely, Symbolic Regression-based Angle of Arrival and Beam Pattern Estimator (SABER), a constrained symbolic-regression framework that automatically discovers closed-form beam pattern and AoA models from path loss measurements with interpretability. SABER achieves high accuracy while bridging the gap between opaque ML methods and interpretable physics-driven estimators. First, we validate our approach in a controlled free-space anechoic chamber, showing that both direct inversion of the known $\cos^n$ beam and a low-order polynomial surrogate achieve sub-0.5 degree Mean Absolute Error (MAE). A purely unconstrained SR method can further reduce the error of the predicted angles, but produces complex formulas that lack physical insight. Then, we implement the same SR-learned inversions in a real-world, Reconfigurable Intelligent Surface (RIS)-aided indoor testbed. SABER and unconstrained SR models accurately recover the true AoA with near-zero error. Finally, we benchmark SABER against the Cram\'er-Rao Lower Bounds (CRLBs). Our results demonstrate that SABER is an interpretable and accurate alternative to state-of-the-art and black-box ML-based methods for AoA estimation.

eess.SP↗

arXiv2025

Multi-agent Reinforcement Learning-based In-place Scaling Engine for Edge-cloud Systems

Modern edge-cloud systems face challenges in efficiently scaling resources to handle dynamic and unpredictable workloads. Traditional scaling approaches typically rely on static thresholds and predefined rules, which are often inadequate for optimizing resource utilization and maintaining performance in distributed and dynamic environments. This inefficiency hinders the adaptability and performance required in edge-cloud infrastructures, which can only be achieved through the newly proposed in-place scaling. To address this problem, we propose the Multi-Agent Reinforcement Learning-based In-place Scaling Engine (MARLISE) that enables seamless, dynamic, reactive control with in-place resource scaling. We develop our solution using two Deep Reinforcement Learning algorithms: Deep Q-Network (DQN), and Proximal Policy Optimization (PPO). We analyze each version of the proposed MARLISE solution using dynamic workloads, demonstrating their ability to ensure low response times of microservices and scalability. Our results show that MARLISE-based approaches outperform heuristic method in managing resource elasticity while maintaining microservice response times and achieving higher resource efficiency.

cs.DC↗

arXiv2023

Accurate harmonic vibrational frequencies for diatomic molecules via quantum computing

During the noisy intermediate-scale quantum (NISQ) era, quantum computational approaches refined to overcome the challenge of limited quantum resources are highly valuable. However, the accuracy of the molecular properties predicted by most of the quantum computations nowadays is still far off (not within chemical accuracy) compared to their corresponding experimental data. Here, we propose a promising qubit-efficient quantum computational approach to calculate the harmonic vibrational frequencies of a large set of neutral closed-shell diatomic molecules with results in great agreement with their experimental data. To this end, we construct the accurate Hamiltonian using molecular orbitals, derived from density functional theory to account for the electron correlation and expanded in the Daubechies wavelet basis set to allow an accurate representation in real space grid points, where an optimized compact active space is further selected so that only a reduced small number of qubits is sufficient to yield an accurate result. To justify the approach, we benchmark the performance of the Hamiltonians spanned by the selected molecular orbitals by first transforming the molecular Hamiltonians into qubit Hamiltonians and then using the exact diagonalization method to calculate the results, regarded as the best results achievable by quantum computation. Furthermore, we show that the variational quantum circuit with the chemistry-inspired UCCSD ansatz can achieve the same accuracy as the exact diagonalization method except for systems whose Mayer bond order indices are larger than 2. For those systems, we demonstrate that the heuristic hardware-efficient RealAmplitudes ansatz, even with a shorter circuit depth, can provide a significant improvement over the UCCSD ansatz, verifying that the harmonic vibrational frequencies could be calculated accurately by quantum computation in the NISQ era.

quant-ph↗