pwc-archive/papers-with-abstracts huggingface dataset:
Spatiotemporal Synchronization of Distributed Arrays using Particle-Based Loopy Belief Propagation
Authors: Benjamin J. B. Deutschmann, Peter Vouras
Date: 2025-04-01 00:00:00

Sensing and imaging with distributed radio infrastructures (e.g., distributed MIMO, wireless sensor networks, multistatic radar) rely on knowledge of the positions, orientations, and clock parameters of distributed apertures. We extend a particle-based loopy belief propagation (BP) algorithm to cooperatively synchronize distributed agents to anchors in space and time. Substituting marginalization over nuisance parameters with approximate but closed-form concentration, we derive an efficient estimator that bypasses the need for preliminary channel estimation and operates directly on noisy channel observations. Our algorithm demonstrates scalable, accurate spatiotemporal synchronization on simulated data.
Near Field Localization via AI-Aided Subspace Methods
Authors: Arad Gast, Luc Le Magoarou, Nir Shlezinger
Date: 2025-04-01 00:00:00
Tasks: subspace methods

The increasing demands for high-throughput and energy-efficient wireless communications are driving the adoption of extremely large antennas operating at high-frequency bands. In these regimes, multiple users will reside in the radiative near-field, and accurate localization becomes essential. Unlike conventional far-field systems that rely solely on DOA estimation, near-field localization exploits spherical wavefront propagation to recover both DOA and range information. While subspace-based methods, such as MUSIC and its extensions, offer high resolution and interpretability for near-field localization, their performance is significantly impacted by model assumptions, including non-coherent sources, well-calibrated arrays, and a sufficient number of snapshots. To address these limitations, this work proposes AI-aided subspace methods for near-field localization that enhance robustness to real-world challenges. Specifically, we introduce NF-SubspaceNet, a deep learning-augmented 2D MUSIC algorithm that learns a surrogate covariance matrix to improve localization under challenging conditions, and DCD-MUSIC, a cascaded AI-aided approach that decouples angle and range estimation to reduce computational complexity. We further develop a novel model-order-aware training method to accurately estimate the number of sources, that is combined with casting of near field subspace methods as AI models for learning. Extensive simulations demonstrate that the proposed methods outperform classical and existing deep-learning-based localization techniques, providing robust near-field localization even under coherent sources, miscalibrations, and few snapshots.
Deep Learning-Based Extended Target Tracking in ISAC Systems
Authors: Yiqiu Wang, Meixia Tao, Shu Sun
Date: 2025-04-01 00:00:00
Tasks: Deep Learning, Denoising, Integrated sensing and communication, ISAC, State Estimation

In this paper, we explore the feasibility of using communication signals for extended target (ET) tracking in an integrated sensing and communication (ISAC) system. The ET is characterized by its center range, azimuth, orientation, and contour shape, for which conventional scatterer-based tracking algorithms are hardly feasible due to the limited scatterer resolution in ISAC. To address this challenge, we propose ISACTrackNet, a deep learning-based tracking model that directly estimates ET kinematic and contour parameters from noisy received echoes. The model consists of three modules: Denoising module for clutter and self-interference suppression, Encoder module for instantaneous state estimation, and KalmanNet module for prediction refinement within a constant-velocity state-space model. Simulation results show that ISACTrackNet achieves near-optimal accuracy in position and angle estimation compared to radar-based tracking methods, even under limited measurement resolution and partial occlusions, but orientation and contour shape estimation remains slightly suboptimal. These results clearly demonstrate the feasibility of using communication-only signals for reliable ET tracking.
Hierarchical Attention Networks for Lossless Point Cloud Attribute Compression
Authors: Yueru Chen, Wei zhang, Dingquan Li, Jing Wang, Ge Li
Date: 2025-04-01 00:00:00
Tasks: Attribute

In this paper, we propose a deep hierarchical attention context model for lossless attribute compression of point clouds, leveraging a multi-resolution spatial structure and residual learning. A simple and effective Level of Detail (LoD) structure is introduced to yield a coarse-to-fine representation. To enhance efficiency, points within the same refinement level are encoded in parallel, sharing a common context point group. By hierarchically aggregating information from neighboring points, our attention model learns contextual dependencies across varying scales and densities, enabling comprehensive feature extraction. We also adopt normalization for position coordinates and attributes to achieve scale-invariant compression. Additionally, we segment the point cloud into multiple slices to facilitate parallel processing, further optimizing time complexity. Experimental results demonstrate that the proposed method offers better coding performance than the latest G-PCC for color and reflectance attributes while maintaining more efficient encoding and decoding runtimes.
Efficient and Sustainable Task Offloading in UAV-Assisted MEC Systems via Meta Deep Reinforcement Learning
Authors: Maryam Farajzadeh Dehkordi, Bijan Jabbari
Date: 2025-04-01 00:00:00
Tasks: Deep Reinforcement Learning, Edge-computing

Integrated into existing Mobile Edge Computing (MEC) systems, Unmanned Aerial Vehicles (UAVs) serve as a cornerstone in meeting the stringent requirements of future Internet of Things (IoT) networks. The current endeavor studies an MEC system, in which a computationally-empowered UAV, wirelessly linked to a cloud server, is destined for task offloading in uplink transmission of IoT devices. The performance of this system is studied by formulating a resource allocation problem, which aims to maximize the long-term computed task efficiency, while ensuring the stability of task buffers at the IoT devices, UAV and cloud. The problem jointly optimizes the uplink transmit power of IoT devices and their offloading decisions, the trajectory of the UAV and computing power at all transceivers. Regarding the non-convex and stochastic nature of the problem, we devise a multi-step solution approach. Initially, by invoking the fractional programming and Lyapunov theory, we transform the long-term optimization problem into an equivalent per-time-slot form. Subsequently, we recast the reformulated problem as a Markov Decision Process (MDP), which reflects the network dynamics. The MDP model, eventually, serves for training a Meta Twin Delayed Deep Deterministic Policy Gradient (MTD3) agent, in charge of adaptive resource allocation with respect to the MEC system variations derived from the mobility of the UAV and IoT devices. Simulations reveal the dominance of our proposed resource allocation approach over its Deep Reinforcement Learning (DRL)-powered counterparts, increasing computed task efficiency and reducing task buffer lengths.
Adaptive Radar Detection in joint Range and Azimuth based on the Hierarchical Latent Variable Model
Authors: Linjie Yan, Chengpeng Hao, Sudan Han, Giuseppe Ricci, Zhanhao Hu, Danilo Orlando
Date: 2025-04-01 00:00:00

This paper focuses on the design of a robust decision scheme capable of operating in target-rich scenarios with unknown signal signatures (including their range positions, angles of arrival, and number) in a background of Gaussian disturbance. To solve the problem at hand, a novel estimation procedure is conceived resorting to the expectation-maximization algorithm in conjunction with the hierarchical latent variable model that are exploited to come up with a maximum \textit{a posteriori} rule for reliable signal classification and angle of arrival estimation. The estimates returned by the procedure are then used to build up an adaptive detection architecture in range and azimuth based on the likelihood ratio test with enhanced detection performance. Remarkably, it is shown that the new decision scheme can maintain constant the false alarm rate when the interference parameters vary in the considered range of values. The performance assessment, conducted by means of Monte Carlo simulation, highlights that the proposed detector exhibits superior detection performance in comparison with the existing GLRT-based competitors.
Methodology for Detecting Energy Anomalies due to Multi-Replay Attacks on Electric Vehicle Charging Infrastructure
Authors: Sagar Babu Mitikiri, Vedantham Lakshmi Srinivas, Mayukha Pal
Date: 2025-04-01 00:00:00
Tasks: Time Series

The increasing deployment of Electric Vehicle Charging Infrastructures (EVCIs) introduces cybersecurity challenges, particularly due to inherent vulnerabilities, making them susceptible to cyberattacks. The vulnerable points in EVCI are charging ports, which serve as the links between the EVs and the EVCI as they transfer the data along with the power. Data spoofing attacks targeting these ports can compromise security, reliability, and overall system performance by introducing anomalies in operational data. An efficient method for identifying the charging port current magnitude variations is presented in this research. The MATLAB/SIMULINK environment simulates an EVCI system for various data generating scenarios. A Temporal Convolution Network - Autoencoder (TCN-AE) model is used in training the multivariate time series data of EVCI and reconstructing it. The abnormalities in data are that various charging port current magnitudes are replaced with their respective data of different durations, thus enabling the replay attack scenarios. To detect anomalies, the error between the original and reconstructed data is computed, and these error values are used for detecting the anomalies. With the help of the mean vector and covariance matrices of the errors, the anomaly score is computed in the form of Mahalanobis distance. The threshold is obtained from the short sub-sequence of the errors and optimized for the whole time series data. The obtained optimal threshold is compared with the anomaly score to detect the anomaly. The model demonstrates robust performance in data reconstruction by identifying anomalies with an accuracy of 99.64%, to enhance the reliability and security in operations of EVCI.
Deep Generative Models: Complexity, Dimensionality, and Approximation
Authors: Kevin Wang, Hongqian Niu, Yixin Wang, Didong Li
Date: 2025-04-01 00:00:00

Generative networks have shown remarkable success in learning complex data distributions, particularly in generating high-dimensional data from lower-dimensional inputs. While this capability is well-documented empirically, its theoretical underpinning remains unclear. One common theoretical explanation appeals to the widely accepted manifold hypothesis, which suggests that many real-world datasets, such as images and signals, often possess intrinsic low-dimensional geometric structures. Under this manifold hypothesis, it is widely believed that to approximate a distribution on a $d$-dimensional Riemannian manifold, the latent dimension needs to be at least $d$ or $d+1$. In this work, we show that this requirement on the latent dimension is not necessary by demonstrating that generative networks can approximate distributions on $d$-dimensional Riemannian manifolds from inputs of any arbitrary dimension, even lower than $d$, taking inspiration from the concept of space-filling curves. This approach, in turn, leads to a super-exponential complexity bound of the deep neural networks through expanded neurons. Our findings thus challenge the conventional belief on the relationship between input dimensionality and the ability of generative networks to model data distributions. This novel insight not only corroborates the practical effectiveness of generative networks in handling complex data structures, but also underscores a critical trade-off between approximation error, dimensionality, and model complexity.
Orientation Scores should be a Piece of Cake
Authors: Finn M. Sherry, Chase van de Geijn, Erik J. Bekkers, Remco Duits
Date: 2025-04-01 00:00:00
Tasks: Position

We axiomatically derive a family of wavelets for an orientation score, lifting from position space $\mathbb{R}^2$ to position and orientation space $\mathbb{R}^2\times S^1$, with fast reconstruction property, that minimise position-orientation uncertainty. We subsequently show that these minimum uncertainty states are well-approximated by cake wavelets: for standard parameters, the uncertainty gap of cake wavelets is less than 1.1, and in the limit, we prove the uncertainty gap tends to the minimum of 1. Next, we complete a previous theoretical argument that one does not have to train the lifting layer in (PDE-)G-CNNs, but can instead use cake wavelets. Finally, we show experimentally that in this way we can reduce the network complexity and improve the interpretability of (PDE-)G-CNNs, with only a slight impact on the model's performance.
Threshold-based impulsive biocontrol for coffee leaf rust
Authors: Clotilde Djuikem, Julien Arino
Date: 2025-04-01 00:00:00

Coffee leaf rust (CLR) severely affects coffee production worldwide, leading to reduced yields and economic losses. To reduce the cost of control, small-scale farmers often only apply control measures once a noticeable level of infection is reached. In this work, we develop mathematical models to better understand CLR dynamics and impulsive biocontrol with threshold-based interventions. We first use ordinary and impulsive differential equations to describe disease spread and the application of control measures once a certain infection level is detected. These models help determine when and how often interventions should occur. To capture the early stages of the disease and the chance that it might die out by itself, we then use a continuous-time Markov chain approach. This stochastic model allows us to estimate the probability that the pathogen fails to establish, thereby avoiding serious outbreaks.
ParallelFlow: Parallelizing Linear Transformers via Flow Discretization
Authors: Nicola Muca Cirone, Cristopher Salvi
Date: 2025-04-01 00:00:00
Tasks: Chunking, State Space Models

We present a theoretical framework for analyzing linear attention models through matrix-valued state space models (SSMs). Our approach, Parallel Flows, provides a perspective that systematically decouples temporal dynamics from implementation constraints, enabling independent analysis of critical algorithmic components: chunking, parallelization, and information aggregation. Central to this framework is the reinterpretation of chunking procedures as computations of the flows governing system dynamics. This connection establishes a bridge to mathematical tools from rough path theory, opening the door to new insights into sequence modeling architectures. As a concrete application, we analyze DeltaNet in a generalized low-rank setting motivated by recent theoretical advances. Our methods allow us to design simple, streamlined generalizations of hardware-efficient algorithms present in the literature, and to provide completely different ones, inspired by rough paths techniques, with provably lower complexity. This dual contribution demonstrates how principled theoretical analysis can both explain existing practical methods and inspire fundamentally new computational approaches.
Topological Properties of the Effective Reproduction Number in an Heterogeneous SIS Model
Authors: Jean-François Delmas, Dylan Dronnier, Pierre-André Zitt
Date: 2025-03-31 00:00:00
Tasks: Epidemiology

This present results lay the foundations for the study of the optimal allocation of vaccine in the simple epidemiological SIS model where one consider a very general heterogeneous population. In the present setting each individual has a type x belonging to a general space, and a vaccination strategy is a function $\eta$ where $\eta$(x) $\in$ [0, 1] represents the proportion of non-vaccinated among individuals of type x. We shall consider two loss functions associated to a vaccination strategy $\eta$: either the effective reproduction number, a classical quantity appearing in many models in epidemiology, and which is given here by the spectral radius of a compact operator that depends on $\eta$; or the overall proportion of infected individuals after vaccination in the maximal endemic state.By considering the weak-* topology on the set $\Delta$ of vaccination strategies, so that it is a compact set, we can prove that those two loss functions are continuous using the notion of collective compactness for a family of operators. We also prove their stability with respect to the parameters of the SIS model. Eventually, we consider their monotonicity and related properties in particular when the model is ``almost'' irreducible.
Robust No-Arbitrage under Projective Determinacy
Authors: Alexandre Boistard, Laurence Carassus, Safae Issaoui
Date: 2025-03-31 00:00:00

Drawing from set theory, this article contributes to a deeper understanding of the no-arbitrage principle in multiple-priors settings and its application in mathematical finance. In the quasi-sure discrete-time frictionless market framework of Bouchard and Nutz, the equivalence between the quasi-sure no-arbitrage condition and the existence of a probability measure for which the local one-prior no-arbitrage condition holds and the affine hull of the support is equal to the quasi-sure support, all of this in a quasi-sure sense, was established by Blanchard and Carassus. We aim to extend this result to the projective setup introduced by Carassus and Ferhoune. This setup allows for standardised measurability assumptions, in contrast to the framework of Bouchard and Nutz, where prices are assumed to be Borel measurable, strategies and stochastic kernels universally measurable, and the graphs of one-step priors analytic sets. To achieve this, we assume the classical axioms of Zermelo-Fraenkel set theory, including the axiom of choice (ZFC), supplemented by the Projective Determinacy (PD) axiom. In ZFC+PD the existence of such probability measures was assumed by Carassus and Ferhoune to prove the existence of solutions in a quasi-sure nonconcave utility maximisation problem. The equivalence with the quasi-sure no-arbitrage was only conjectured.
The Axiom-Based Atlas: A Structural Mapping of Theorems via Foundational Proof Vectors
Authors: Harim Yoo
Date: 2025-03-31 00:00:00
Tasks: Mathematical Reasoning

The Axiom-Based Atlas is a novel framework that structurally represents mathematical theorems as proof vectors over foundational axiom systems. By mapping the logical dependencies of theorems onto vectors indexed by axioms - such as those from Hilbert geometry, Peano arithmetic, or ZFC - we offer a new way to visualize, compare, and analyze mathematical knowledge. This vector-based formalism not only captures the logical foundation of theorems but also enables quantitative similarity metrics - such as cosine distance - between mathematical results, offering a new analytic layer for structural comparison. Using heatmaps, vector clustering, and AI-assisted modeling, this atlas enables the grouping of theorems by logical structure, not just by mathematical domain. We also introduce a prototype assistant (Atlas-GPT) that interprets natural language theorems and suggests likely proof vectors, supporting future applications in automated reasoning, mathematical education, and formal verification. This direction is partially inspired by Terence Tao's recent reflections on the convergence of symbolic and structural mathematics. The Axiom-Based Atlas aims to provide a scalable, interpretable model of mathematical reasoning that is both human-readable and AI-compatible, contributing to the future landscape of formal mathematical systems.
A Randomized Zeroth-Order Hierarchical Framework for Heterogeneous Federated Learning
Authors: Yuyang Qiu, Kibaek Kim, Farzad Yousefian
Date: 2025-04-02 00:00:00
Tasks: Federated Learning, image-classification, Image Classification

Heterogeneity in federated learning (FL) is a critical and challenging aspect that significantly impacts model performance and convergence. In this paper, we propose a novel framework by formulating heterogeneous FL as a hierarchical optimization problem. This new framework captures both local and global training process through a bilevel formulation and is capable of the following: (i) addressing client heterogeneity through a personalized learning framework; (ii) capturing pre-training process on server's side; (iii) updating global model through nonstandard aggregation; (iv) allowing for nonidentical local steps; and (v) capturing clients' local constraints. We design and analyze an implicit zeroth-order FL method (ZO-HFL), provided with nonasymptotic convergence guarantees for both the server-agent and the individual client-agents, and asymptotic guarantees for both the server-agent and client-agents in an almost sure sense. Notably, our method does not rely on standard assumptions in heterogeneous FL, such as the bounded gradient dissimilarity condition. We implement our method on image classification tasks and compare with other methods under different heterogeneous settings.
The effect of latency on optimal order execution policy
Authors: Chutian Ma, Giacinto Paolo Saggese, Paul Smith
Date: 2025-04-01 00:00:00

Market participants regularly send bid and ask quotes to exchange-operated limit order books. This creates an optimization challenge where their potential profit is determined by their quoted price and how often their orders are successfully executed. The expected profit from successful execution at a favorable limit price needs to be balanced against two key risks: (1) the possibility that orders will remain unfilled, which hinders the trading agenda and leads to greater price uncertainty, and (2) the danger that limit orders will be executed as market orders, particularly in the presence of order submission latency, which in turn results in higher transaction costs. In this paper, we consider a stochastic optimal control problem where a risk-averse trader attempts to maximize profit while balancing risk. The market is modeled using Brownian motion to represent the price uncertainty. We analyze the relationship between fill probability, limit price, and order submission latency. We derive closed-form approximations of these quantities that perform well in the practical regime of interest. Then, we utilize a mean-variance method where our total reward function features a risk-tolerance parameter to quantify the combined risk and profit.
Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity
Authors: Brecht Evens, Puya Latafat, Panagiotis Patrinos
Date: 2025-04-01 00:00:00

Spingarn's method of partial inverses and the progressive decoupling algorithm address inclusion problems involving the sum of an operator and the normal cone of a linear subspace, known as linkage problems. Despite their success, existing convergence results are limited to the so-called elicitable monotone setting, where nonmonotonicity is allowed only on the orthogonal complement of the linkage subspace. In this paper, we introduce progressive decoupling+, a generalized version of standard progressive decoupling that incorporates separate relaxation parameters for the linkage subspace and its orthogonal complement. We prove convergence under conditions that link the relaxation parameters to the nonmonotonicity of their respective subspaces and show that the special cases of Spingarn's method and standard progressive decoupling also extend beyond the elicitable monotone setting. Our analysis hinges upon an equivalence between progressive decoupling+ and the preconditioned proximal point algorithm, for which we develop a general local convergence analysis in a certain nonmonotone setting.