pwc-archive/papers-with-abstracts huggingface dataset:
Energy Efficiency Optimization of Finite Block Length STAR-RIS-aided MU-MIMO Broadcast Channels
Authors: Mohammad Soleymani, Ignacio Santamaria, Eduard Jorswieck, Robert Schober, Lajos Hanzo
Date: 2025-06-13 00:00:00

Energy-efficient designs are proposed for multi-user (MU) multiple-input multiple-output (MIMO) broadcast channels (BC), assisted by simultaneously transmitting and reflecting (STAR) reconfigurable intelligent surfaces (RIS) operating at finite block length (FBL). In particular, we maximize the sum energy efficiency (EE), showing that STAR-RIS can substantially enhance it. Our findings demonstrate that the gains of employing STAR-RIS increase when the codeword length and the maximum tolerable bit error rate decrease, meaning that a STAR-RIS is more energy efficient in a system with more stringent latency and reliability requirements.
MMWiLoc: A Multi-Sensor Dataset and Robust Device-Free Localization Method Using Commercial Off-The-Shelf Millimeter Wave Wi-Fi Devices
Authors: Wenbo Ding, Yang Li, Dongsheng Wang, Bin Zhao, Yunrong Zhu, Yibo Zhang, Yumeng Miao
Date: 2025-06-13 00:00:00
Tasks: Indoor Localization

Device-free Wi-Fi sensing has numerous benefits in practical settings, as it eliminates the requirement for dedicated sensing devices and can be accomplished using current low-cost Wi-Fi devices. With the development of Wi-Fi standards, millimeter wave Wi-Fi devices with 60GHz operating frequency and up to 4GHz bandwidth have become commercially available. Although millimeter wave Wi-Fi presents great promise for Device-Free Wi-Fi sensing with increased bandwidth and beam-forming ability, there still lacks a method for localization using millimeter wave Wi-Fi. Here, we present two major contributions: First, we provide a comprehensive multi-sensor dataset that synchronously captures human movement data from millimeter wave Wi-Fi, 2.4GHz Wi-Fi, and millimeter wave radar sensors. This dataset enables direct performance comparisons across different sensing modalities and facilitates reproducible researches in indoor localization. Second, we introduce MMWiLoc, a novel localization method that achieves centimeter-level precision with low computational cost. MMWiLoc incorporates two components: beam pattern calibration using Expectation Maximization and target localization through Multi-Scale Compression Sensing. The system processes beam Signal-to-Noise Ratio (beamSNR) information from the beam-forming process to determine target Angle of Arrival (AoA), which is then fused across devices for localization. Our extensive evaluation demonstrates that MMWiLoc achieves centimeter-level precision, outperforming 2.4GHz Wi-Fi systems while maintaining competitive performance with high-precision radar systems. The dataset and examples processing code will be released after this paper is accepted at https://github.com/wowoyoho/MMWiLoc.
Robust Filtering -- Novel Statistical Learning and Inference Algorithms with Applications
Authors: Aamir Hussain Chughtai
Date: 2025-06-13 00:00:00
Tasks: Autonomous Vehicles, Bayesian Inference, Indoor Localization, Point Cloud Registration, State Estimation, Variational Inference

State estimation or filtering serves as a fundamental task to enable intelligent decision-making in applications such as autonomous vehicles, robotics, healthcare monitoring, smart grids, intelligent transportation, and predictive maintenance. Standard filtering assumes prior knowledge of noise statistics to extract latent system states from noisy sensor data. However, real-world scenarios involve abnormalities like outliers, biases, drifts, and missing observations with unknown or partially known statistics, limiting conventional approaches. This thesis presents novel robust nonlinear filtering methods to mitigate these challenges. Based on insights from our filtering proposals, we extend the formulations to offline estimation/learning setups and propose smoothing extensions. Our methods leverage Bayesian inference frameworks, employing both deterministic and stochastic approximation techniques including Variational Inference (VI) and Particle Filters/Sequential Monte Carlo (SMC). We also study theoretical estimation limits using Bayesian Cram\'er-Rao bounds (BCRBs) in the context of measurement abnormalities. To validate the performance gains of the proposed methods, we perform simulations and experiments in scenarios including target tracking, indoor localization, 3D point cloud registration, mesh registration, and pose graph optimization. The fundamental nature of the work makes it useful in diverse applications, with possible future extensions toward developing outlier-robust machine learning pipelines, learning system dynamics from anomalous data, and addressing challenges in generative AI where standard diffusion models struggle with outliers, imbalanced datasets, and mode collapse.
Joint Angle and Velocity-Estimation for Target Localization in Bistatic mmWave MIMO Radar in the Presence of Clutter
Authors: Priyanka Maity, Suraj Srivastava, Aditya K. Jagannatham, Lajos Hanzo
Date: 2025-06-13 00:00:00
Tasks: parameter estimation, Super-Resolution

Sparse Bayesian learning (SBL)-aided target localization is conceived for a bistatic mmWave MIMO radar system in the presence of unknown clutter, followed by the development of an angle-Doppler (AD)-domain representation of the target-plus-clutter echo model for accurate target parameter estimation. The proposed algorithm exploits the three-dimensional (3D) sparsity arising in the AD domain of the scattering scene and employs the powerful SBL framework for the estimation of target parameters, such as the angle-of-departure (AoD), angle-of-arrival (AoA) and velocity. To handle a practical scenario where the actual target parameters typically deviate from their finite-resolution grid, a super-resolution-based improved off-grid SBL framework is developed for recursively updating the parameter grid, thereby progressively refining the estimates. We also determine the Cram\'er-Rao bound (CRB) and Bayesian CRB for target parameter estimation in order to benchmark the estimation performance. Our simulation results corroborate the superior performance of the proposed approach in comparison to the existing algorithms, and also their ability to approach the bounds derived.
Movable-Antenna Array Enhanced Downlink NOMA
Authors: Nianzu Li, Peiran Wu, Lipeng Zhu, Derrick Wing Kwan Ng
Date: 2025-06-13 00:00:00

Movable antenna (MA) has gained increasing attention in the field of wireless communications due to its exceptional capability to proactively reconfigure wireless channels via localized antenna movements. In this paper, we investigate the resource allocation design for an MA array-enabled base station serving multiple single-antenna users in a downlink non-orthogonal multiple access (NOMA) system. We aim to maximize the sum rate of all users by jointly optimizing the transmit beamforming and the positions of all MAs at the BS, subject to the constraints of transmit power budget, finite antenna moving region, and the conditions for successive interference cancellation decoding rate. The formulated problem, inherently highly non-convex, is addressed by successive convex approximation (SCA) and alternating optimization methods to obtain a high-quality suboptimal solution. Simulation results unveil that the proposed MA-enhanced downlink NOMA system can significantly improve the sum rate performance compared to both the fixed-position antenna (FPA) system and the traditional orthogonal multiple access (OMA) system.
A Compact Dynamic Omnidirectional Antenna
Authors: Sheng Huang, Jacob R. Randall, Cory Hilton, Jeffrey A. Nanzer
Date: 2025-06-12 00:00:00

We propose a novel omnidirectional antenna design incorporating directional modulation for secure narrow planar information transmission. The proposed antenna features a compact size and stable omnidirectional radiation performance by employing two tightly spaced, printed meander line monopole antennas, acting as a single radiating element. To achieve a narrow information secure region, the proposed antenna is fed by differential power excitation of two ports with real-time dynamic switching. This leads to phase pattern modulation only along the electrical polarization, resulting in directionally confined information recoverable region in the E-plane, while maintaining highly constant or static omnidirectional H-plane pattern, inducing a $360^\circ$ information recoverable region. The dynamic antenna is designed and fabricated on a single layer of Rogers RO4350B which provides a miniaturized planar size of $0.36 \times 0.5 , \lambda_0^2$ at 2.7 GHz and easy integration. To validate the wireless communication performance, the fabricated antenna is directly fed with a 10 dB power ratio by a radio frequency (RF) switching system and evaluated for 16-QAM and 256-QAM transmission in a high signal-to-noise ratio (SNR) environment. Experimental results demonstrate that for 16-QAM transmission, a narrow E-plane information beam (IB) of approximately $34^\circ$ and omnidirectional H-plane IB are obtained, and a narrower E-plane IB is achieved around $15^\circ$ for 256-QAM. These results confirm that the proposed antenna offers a simple yet effective approach to enhance planar physical information security with a compact dynamic antenna system.
Design of 3D Beamforming and Deployment Strategies for ISAC-based HAPS Systems
Authors: Xue Zhang, Bang Huang, Mohamed-Slim Alouini
Date: 2025-06-12 00:00:00
Tasks: Integrated sensing and communication, ISAC

This paper explores high-altitude platform station (HAPS) systems enabled by integrated sensing and communication (ISAC), in which a HAPS simultaneously transmits communication signals and synthetic aperture radar (SAR) imaging signals to support multi-user communication while performing ground target sensing. Taking into account the operational characteristics of SAR imaging, we consider two HAPS deployment strategies: (i) a quasi-stationary HAPS that remains fixed at an optimized location during SAR operation, following the stop-and-go scanning model; and (ii) a dynamic HAPS that continuously adjusts its flight trajectory along a circular path. For each strategy, we aim at maximizing the weighted sum-rate throughput for communication users while ensuring that SAR imaging requirements, such as beampattern gain and signal-to-noise ratio (SNR), are satisfied. This is achieved by jointly optimizing the HAPS deployment strategy, i.e., its placement or trajectory, along with three-dimensional (3D) transmit beamforming, under practical constraints including transmit power limits, energy consumption, and flight dynamics. Nevertheless, the formulated optimization problems corresponding to the two deployment strategies are inherently non-convex. To address the issue, we propose efficient algorithms that leverage both convex and non-convex optimization techniques to obtain high-quality suboptimal solutions. Numerical results demonstrate the effectiveness and advantages of the proposed approaches over benchmark schemes.
uPVC-Net: A Universal Premature Ventricular Contraction Detection Deep Learning Algorithm
Authors: Hagai Hamami, Yosef Solewicz, Daniel Zur, Yonatan Kleerekoper, Joachim A. Behar
Date: 2025-06-12 00:00:00

Introduction: Premature Ventricular Contractions (PVCs) are common cardiac arrhythmias originating from the ventricles. Accurate detection remains challenging due to variability in electrocardiogram (ECG) waveforms caused by differences in lead placement, recording conditions, and population demographics. Methods: We developed uPVC-Net, a universal deep learning model to detect PVCs from any single-lead ECG recordings. The model is developed on four independent ECG datasets comprising a total of 8.3 million beats collected from Holter monitors and a modern wearable ECG patch. uPVC-Net employs a custom architecture and a multi-source, multi-lead training strategy. For each experiment, one dataset is held out to evaluate out-of-distribution (OOD) generalization. Results: uPVC-Net achieved an AUC between 97.8% and 99.1% on the held-out datasets. Notably, performance on wearable single-lead ECG data reached an AUC of 99.1%. Conclusion: uPVC-Net exhibits strong generalization across diverse lead configurations and populations, highlighting its potential for robust, real-world clinical deployment.
Identifiability of Deep Polynomial Neural Networks
Authors: Konstantin Usevich, Clara Dérand, Ricardo Borsoi, Marianne Clausel
Date: 2025-06-20 00:00:00
Tasks: Decoder, Polynomial Neural Networks

Polynomial Neural Networks (PNNs) possess a rich algebraic and geometric structure. However, their identifiability -- a key property for ensuring interpretability -- remains poorly understood. In this work, we present a comprehensive analysis of the identifiability of deep PNNs, including architectures with and without bias terms. Our results reveal an intricate interplay between activation degrees and layer widths in achieving identifiability. As special cases, we show that architectures with non-increasing layer widths are generically identifiable under mild conditions, while encoder-decoder networks are identifiable when the decoder widths do not grow too rapidly. Our proofs are constructive and center on a connection between deep PNNs and low-rank tensor decompositions, and Kruskal-type uniqueness theorems. This yields both generic conditions determined by the architecture, and effective conditions that depend on the network's parameters. We also settle an open conjecture on the expected dimension of PNN's neurovarieties, and provide new bounds on the activation degrees required for it to reach its maximum.
Data analysis using discrete cubical homology
Authors: Chris Kapulkin, Nathan Kershaw
Date: 2025-06-17 00:00:00

We present a new tool for data analysis: persistence discrete homology, which is well-suited to analyze filtrations of graphs. In particular, we provide a novel way of representing high-dimensional data as a filtration of graphs using pairwise correlations. We discuss several applications of these tools, e.g., in weather and financial data, comparing them to the standard methods used in the respective fields.
An nth-cousin mating model and the n-anacci numbers
Authors: Elisa Heinrich Mora, Noah A. Rosenberg
Date: 2025-06-19 00:00:00

In seeking to understand the size of inbred pedigrees, J. Lachance (J. Theor. Biol. 261, 238-247, 2009) studied a population model in which, for a fixed value of $n$, each mating occurs between $n$th cousins. We explain a connection between the second-cousin case of the model ($n=2$) and the Fibonacci sequence, and more generally, between the $n$th-cousin case and the $n$-anacci sequence $(n \geq 2)$. For a model with $n$th-cousin mating $(n \geq 1)$, we obtain the generating function describing the size of the pedigree $t$ generations back from the present, and we use it to evaluate the asymptotic growth of the pedigree size. In particular, we show that the growth of the pedigree asymptotically follows the growth rate of the $n$-anacci sequence -- the golden ratio $\phi = (1 + \sqrt{5})/2 \approx 1.6180$ in the second-cousin case $n=2$ -- and approaches 2 as $n$ increases. The computations explain the appearance of familiar numerical sequences and constants in a pedigree model. They also recall similar appearances of such sequences and constants in studies of population biology more generally.
Covariance Decomposition for Distance Based Species Tree Estimation
Authors: Georgios Aliatimis, Ruriko Yoshida, Burak Boyak, James Grant
Date: 2025-06-19 00:00:00
Tasks: Imputation

In phylogenomics, species-tree methods must contend with two major sources of noise; stochastic gene-tree variation under the multispecies coalescent model (MSC) and finite-sequence substitutional noise. Fast agglomerative methods such as GLASS, STEAC, and METAL combine multi-locus information via distance-based clustering. We derive the exact covariance matrix of these pairwise distance estimates under a joint MSC-plus-substitution model and leverage it for reliable confidence estimation, and we algebraically decompose it into components attributable to coalescent variation versus sequence-level stochasticity. Our theory identifies parameter regimes where one source of variance greatly exceeds the other. For both very low and very high mutation rates, substitutional noise dominates, while coalescent variance is the primary contributor at intermediate mutation rates. Moreover, the interval over which coalescent variance dominates becomes narrower as the species-tree height increases. These results imply that in some settings one may legitimately ignore the weaker noise source when designing methods or collecting data. In particular, when gene-tree variance is dominant, adding more loci is most beneficial, while when substitution noise dominates, longer sequences or imputation are needed. Finally, leveraging the derived covariance matrix, we implement a Gaussian-sampling procedure to generate split support values for METAL trees and demonstrate empirically that this approach yields more reliable confidence estimates than traditional bootstrapping.
Universal kernels via harmonic analysis on Riemannian symmetric spaces
Authors: Franziskus Steinert, Salem Said, Cyrus Mostajeran
Date: 2025-06-24 00:00:00

The universality properties of kernels characterize the class of functions that can be approximated in the associated reproducing kernel Hilbert space and are of fundamental importance in the theoretical underpinning of kernel methods in machine learning. In this work, we establish fundamental tools for investigating universality properties of kernels in Riemannian symmetric spaces, thereby extending the study of this important topic to kernels in non-Euclidean domains. Moreover, we use the developed tools to prove the universality of several recent examples from the literature on positive definite kernels defined on Riemannian symmetric spaces, thus providing theoretical justification for their use in applications involving manifold-valued data.
Invasive species control via a discrete model for the Trojan Y-chromosome strategy
Authors: Don K. Mallawa Arachchi, Rana D. Parshad, Claus Kadelka
Date: 2025-06-16 00:00:00

Invasive species are a growing threat to ecosystems, particularly in aquatic environments. The Trojan Y Chromosome (TYC) strategy is a promising biological method for reducing invasive populations by introducing genetically modified males (supermales) that produce only male offspring, leading to population decline due to a shortage of females. In this study, we develop a novel discrete--time, age--structured mathematical model to simulate the effects of this strategy. Our model divides the life cycle of species into two stages--egg and maturity--and tracks different sub--populations, including supermales. We analyze the equilibria of the system and prove the existence and stability of extinction and positive equilibrium points. Numerical simulations show that extinction depends on factors such as fecundity, the number of supermales released, and initial population sizes. The model also reveals complex behaviors, such as bistability and thresholds for population collapse. This discrete approach offers a useful framework for understanding and optimizing the TYC strategy and can help guide future field applications of invasive species control.
Impact of Hill coefficient and time delay on a perceptual decision-making model
Authors: Bartłomiej Morawski, Anna Czartoszewska
Date: 2025-06-04 00:00:00
Tasks: Decision Making

In this paper, a neural mass perceptual decision making model introduced by Piska{\l}a et al. is analyzed. The model describes activity of two neuron populations influenced by each other and external inputs. The groups' activities correspond to the process of making a perceptual binary decision. Existing results are generalized by investigating the impact of both a delay in self-inhibition and a generic Hill coefficient on solutions to the system of differential equations. Several versions of the model with various assumptions are compared using analytical and numerical methods.
Faster Fixed-Point Methods for Multichain MDPs
Authors: Matthew Zurek, Yudong Chen
Date: 2025-06-26 00:00:00

We study value-iteration (VI) algorithms for solving general (a.k.a. multichain) Markov decision processes (MDPs) under the average-reward criterion, a fundamental but theoretically challenging setting. Beyond the difficulties inherent to all average-reward problems posed by the lack of contractivity and non-uniqueness of solutions to the Bellman operator, in the multichain setting an optimal policy must solve the navigation subproblem of steering towards the best connected component, in addition to optimizing long-run performance within each component. We develop algorithms which better solve this navigational subproblem in order to achieve faster convergence for multichain MDPs, obtaining improved rates of convergence and sharper measures of complexity relative to prior work. Many key components of our results are of potential independent interest, including novel connections between average-reward and discounted problems, optimal fixed-point methods for discounted VI which extend to general Banach spaces, new sublinear convergence rates for the discounted value error, and refined suboptimality decompositions for multichain MDPs. Overall our results yield faster convergence rates for discounted and average-reward problems and expand the theoretical foundations of VI approaches.
Control and optimization for Neural Partial Differential Equations in Supervised Learning
Authors: Alain Bensoussan, Minh-Binh Tran, Bangjie Wang
Date: 2025-06-25 00:00:00

Although there is a substantial body of literature on control and optimization problems for parabolic and hyperbolic systems, the specific problem of controlling and optimizing the coefficients of the associated operators within such systems has not yet been thoroughly explored. In this work, we aim to initiate a line of research in control theory focused on optimizing and controlling the coefficients of these operators-a problem that naturally arises in the context of neural networks and supervised learning. In supervised learning, the primary objective is to transport initial data toward target data through the layers of a neural network. We propose a novel perspective: neural networks can be interpreted as partial differential equations (PDEs). From this viewpoint, the control problem traditionally studied in the context of ordinary differential equations (ODEs) is reformulated as a control problem for PDEs, specifically targeting the optimization and control of coefficients in parabolic and hyperbolic operators. To the best of our knowledge, this specific problem has not yet been systematically addressed in the control theory of PDEs. To this end, we propose a dual system formulation for the control and optimization problem associated with parabolic PDEs, laying the groundwork for the development of efficient numerical schemes in future research. We also provide a theoretical proof showing that the control and optimization problem for parabolic PDEs admits minimizers. Finally, we investigate the control problem associated with hyperbolic PDEs and prove the existence of solutions for a corresponding approximated control problem.