Searcharxiv⌕ Search

arXiv subjects

Yonina C. Eldar

Publications and source records attributed to Yonina C. Eldar.

At least 19 recordsLinked to original sources

Over-the-Air Federated Learning in Heterogeneous Mobile Wireless Networks

Over-the-air computation has emerged as a scalable and efficient solution for deploying federated learning algorithms in wireless networks by exploiting waveform superposition for simultaneous model aggregation. Most existing work struggles with heterogeneous fading channels. These approaches either enforce unbiased updates from all devices or allow partial device contributions, requiring careful tuning of the convergence bound to mitigate bias under specific fading models. However, the former significantly amplifies receiver noise due to the weakest channel, whereas the latter is sensitive to fading model mismatch and converges only to a biased objective. To tackle these challenges, we propose FedOAG, which employs algorithmic components to automatically satisfy energy constraints via gradient normalization and evenly mix devices' updates through implicit gossiping. Importantly, FedOAG does not require transmission from all devices, nor does it rely on a specific fading model or knowledge of time-varying statistical channel distributions. We show that FedOAG converges to a stationary point of an unbiased non-convex objective at the best possible rate $O(1/\sqrt{T})$ for any stochastic first-order method. We corroborate our analysis with numerical experiments over dynamic wireless conditions on real-world datasets.

cs.LG↗

Learning to Replace MCMC in Split-Gibbs Diffusion Posterior Sampling via Deep Unfolding

Split Gibbs sampling enables diffusion posterior inference for general nonlinear inverse problems by decoupling prior and likelihood computations, allowing a pretrained diffusion prior to be reused across measurement models. However, its likelihood update often relies on iterative MCMC, which can hinder parallelization, require algorithm-specific tuning, and incur substantial computational cost. In this work, we propose a learning-based framework to replace this MCMC step by reformulating both Gibbs updates as Gaussian denoising problems and implementing them through ODE diffusion. The prior step reuses a pretrained denoiser, while the likelihood denoiser exploits known likelihood structure through a lightweight deep-unfolded network. Experiments on nonlinear phase retrieval demonstrate the effectiveness of the proposed method as an alternative to MCMC-based split Gibbs at lower likelihood-update cost.

eess.SP↗

Neural Kalman Filtering for Unknown Dynamics: Task-Aware Learning with a Koopman Backbone

Recent years have witnessed a growing interest in AI-aided Kalman filters. While emerging methodologies, such as KalmanNet, were shown to facilitate tracking in partially known state-space models, they are not directly applicable when the underlying dynamics is unknown. To overcome this limitation, we extend the KalmanNet philosophy to the unknown-dynamics regime by developing blind Kalman filtering frameworks that learn both the predictor and the correction gain from data, assuming that the state-evolution function and the noise statistics are both unavailable. To this end, we first introduce a task-aware neural Kalman filtering framework, Blind-KalmanNet, which carries the learning principle of the Kalman gain into the prediction step through a two-head neural architecture that jointly learns a state-dependent linear surrogate and the Kalman gain from data. Building on this formulation, we then develop our main framework, Koopman-aided Blind-KalmanNet, which incorporates Koopman operator theory to lift the unknown dynamics into a latent space where the state evolves linearly. The lifted linear predictor integrates seamlessly into the Blind-KalmanNet structure: the pre-trained deep Koopman network serves as a globally structured predictor, augmented by the task-aware residual surrogate and the learned Kalman gain inherited from Blind-KalmanNet. Extensive experiments demonstrate that the proposed frameworks achieve competitive performance against baselines, with Koopman-aided Blind-KalmanNet attaining the best accuracy across all considered settings.

eess.SP↗

Rotatable Antenna Aided Mixed Near-Field and Far-Field Communications in the Upper Mid-Band: Interference Analysis and Joint Optimization

In this paper, we propose to leverage rotatable antennas (RAs) for improving the communication performance in mixed near-field and far-field communication systems by exploiting a new spatial degree-of-freedom (DoF) offered by antenna rotation to mitigate complex near-field interference and mixed-field interference. Specifically, we investigate a modular RA-enabled mixed-field downlink communication system, where a base station (BS) consisting of multiple RA subarrays communicates with multiple near-field users in the presence of several legacy far-field users. We formulate an optimization problem to maximize the sum-rate of the near-field users by jointly optimizing the power allocation and rotation angles of all subarrays at the BS. To gain useful insights into the effect of RAs on mixed-field communications, we first analyze a special case where all subarrays share the same rotation angle and obtain closed-form expressions for the rotation-aware normalized near-field interference and the rotation-aware normalized mixed-field interference using the Fresnel integrals. We then analytically reveal that array rotation effectively suppresses both interference types, thereby significantly enhancing mixed-field communication performance. For the general case involving subarray-wise rotation, we propose an efficient double-layer algorithm to obtain a high-quality solution, where the inner layer optimizes power allocation using the successive convex approximation (SCA) technique, while the outer layer determines the rotation angles of all subarrays via particle swarm optimization (PSO). Finally, numerical results highlight the significant performance gains achieved by RAs over conventional fixed-antenna systems and demonstrate the effectiveness of our developed joint design compared to benchmark schemes.

eess.SP↗

Sparse Principal Component Analysis with Energy Profile Dependent Sample Complexity

We study sparse principal component analysis in the high-dimensional, sample-limited regime, aiming to recover a leading component supported on a few coordinates. Despite extensive progress, most methods and analyses are tailored to the flat-spike case, offering little guidance when spike energy is unevenly distributed across the support. Motivated by this, we propose Spectral Energy Pursuit (SEP), an effective iterative scheme that repeatedly screens and reselects coordinates, with a sample complexity that adapts to the energy profile. We develop our framework around a structure function \(s(p)\) that quantifies how spike energy accumulates over its top \(p\) entries. To our knowledge, SEP is the first polynomial-time SPCA method with a sample-complexity guarantee governed by the full energy profile: it succeeds with \(m\gtrsim \max_{1\le p\le k} p\,s^2(p)\,\log n\) samples, recovering the classical \(k^2\log n\) rate for flat spikes and improving to \(k\log n\) for sufficiently concentrated profiles. As a lightweight post-processing, a single truncated power iteration is proven to enable the final estimator to attain a uniform statistical error bound. Empirical simulations using a flat profile and offset-regularized decaying profiles validate that SEP adapts to profile structure without profile-specific tuning and outperforms existing algorithms.

cs.IT↗

Toward Intelligent Skies: Signal Processing and AI Foundations of Low-Altitude Wireless Networks

The rapid growth of low-altitude aerial services and applications, driven by uncrewed aerial vehicles (UAVs), calls for a new class of digital infrastructure beyond conventional terrestrial networks. The low-altitude wireless network (LAWN) has been proposed as dynamically reconfigurable three-dimensional architectures that integrate aerial and ground nodes to provide connectivity, sensing, and control in open, safety-critical airspace. This tutorial presents a comprehensive treatment of LAWNs from the joint perspectives of artificial intelligence (AI) and signal processing. We first review the historical evolution and architectural foundations of LAWNs, introducing altitude-based layers and functional planes, and summarizing the regulatory and standardization landscape. Building on this system view, we then discuss signal processing fundamentals for LAWNs, including 3D channel and system models, performance metrics, waveform and receiver design, localization and tracking, and multi-functionality co-design. Next, we survey AI techniques for LAWNs, covering discriminative and generative models for perception, control, resource management, and security, as well as emerging paradigms such as foundation models, large language models, and digital twins for mission planning and closed-loop optimization. To illustrate AI-signal processing integration in practice, we provide a case study of an AI-driven multi-tier LAWN with hybrid satellite, high-altitude, and ground nodes. The tutorial concludes by outlining key research challenges in architecture design, signal processing-AI co-design, safety and security, experimentation, and standardization, and by highlighting opportunities for LAWNs to evolve into dependable, AI-native infrastructure for the intelligent skies.

eess.SP↗

SpiRadar: Radar-Based Non-Contact Spirometry via Sparse Polynomial Framework

Chronic respiratory diseases affect hundreds of millions of people worldwide, with spirometry serving as the gold standard for pulmonary function assessment. However, conventional spirometry's reliance on mouthpieces and nose clips creates discomfort and technical challenges that can compromise test quality, particularly in pediatric populations where cooperation difficulties are amplified. This study presents SpiRadar, a comprehensive radar-based framework for non-contact spirometry that eliminates physical contact requirements while enabling accurate curve reconstruction, clinical parameter estimation, and bronchodilator response (BDR) assessment. Our key contributions include: (1) a methodological framework integrating physiologically-motivated preprocessing for robust signal extraction, a feature-dependent polynomial transformation linking radar-measured thoracic displacement to spirometric volume curves, and sparse optimization enabling generalization to unseen subjects without individual calibration; (2) a rigorous validation on a pediatric cohort of 39 subjects (ages 6-18 years) undergoing 58 spirometry trials, including healthy children and asthma patients tested pre- and post-bronchodilator, using subject-level leave-one-out cross-validation; (3) clinical-grade performance outperforming alternative non-contact methods, achieving accurate curve reconstruction (mean RMSE: 0.23 +- 0.12 L) and strong correlations (above 0.84) for key spirometric parameters. BDR classification achieved 89.5% accuracy with balanced sensitivity (90.9%) and specificity (87.5%). These results establish clinical feasibility for our non-contact spirometry approach, with particular promise for pediatric asthma monitoring and remote patient care.

eess.SP↗

Bayesian Signal Component Decomposition via Diffusion-within-Gibbs Sampling

In signal processing, the data collected from sensing devices is often a noisy linear superposition of multiple components, and the estimation of components of interest constitutes a crucial pre-processing step. In this work, we develop a Bayesian framework for signal component decomposition, which combines Gibbs sampling with plug-and-play (PnP) diffusion priors to draw component samples from the posterior distribution. Unlike many existing methods, our framework supports incorporating component-wise model-driven and data-driven priors into diffusion models in a unified manner. Moreover, the proposed posterior sampler allows component priors to be learned separately and flexibly combined for different decomposition tasks at inference time. Under suitable assumptions, the proposed Diffusion-within-Gibbs (DiG) sampler provably produces samples from the posterior distribution. We also show that DiG can be interpreted as an extension of a class of recently proposed diffusion-based samplers, and that, for suitable classes of sensing operators, DiG better exploits the structure of the measurement model. Numerical experiments demonstrate the superior performance of our method over existing approaches.

eess.SP↗

Simple Domain Generalization for Strong Pixel-Level Image Tampering Detection in Modern VLMs

Modern vision-language models (VLMs) have significantly improved image generation and editing capabilities, making pixel-level image tampering detection increasingly important yet challenging under cross-model and out-of-distribution shifts. This work studies domain generalization for pixel-level image tampering detection in modern VLMs like ChatGPT, Gemini, Qwen-Image, etc., aiming to learn tampering localization models that remain robust across diverse VLM-generated manipulation distributions. We propose a simple yet effective domain-generalized training framework built on two practical strategies. First, we introduce a balanced minibatch sampling scheme that strategically samples tampered and real images in each minibatch, preventing biased optimization toward either manipulated artifacts or clean-image priors and avoiding training collapse, ensuring that each optimization step receives proper sampled gradient signals. Second, we adopt a simple late-injection strategy, where the detector is first trained on large-scale base data until stable convergence, and then exposed to a small amount of newly selected supporting data from emerging VLM distributions, improving adaptability without overfitting to limited new domains. Together, these components provide a simple yet strong recipe for improving pixel-level tampering localization and OOD robustness across modern VLMs. Despite the conceptual simplicity, our framework outperforms the prior state-of-the-art PIXAR by a large margin of 26.1% and 26.8% relative improvement in average gIoU and cIoU, respectively, across OOD VLMs of GPT-Images-2.0, Gemini-3.1, FLUX.2, and Seedream 4.5. Our code is available at https://github.com/VILA-Lab/PIXAR-DG

cs.CV↗

An Enhanced MNOMP for Line Spectrum Estimation and Detection

Multisnapshot Newtonized orthogonal matching pursuit (MNOMP) incorporates Newton's method into OMP to avoid the off-grid issues, achieve high accuracy, high resolution and fast line spectrum estimation with multiple measurement vectors. It employs the generalized likelihood ratio test (GLRT) with a constant false alarm rate (CFAR) criterion to determine the number of sinusoids. In this paper, we develop an enhanced MNOMP (EMNOMP) by analyzing the statistical distribution of the exact GLRT statistic. In contrast to MNOMP, which approximates the GLRT by restricting the search to discrete Fourier transform (DFT) grid frequencies, EMNOMP instead solves the GLRT over the continuous frequency domain. The key technical novelty is the derivation of the false alarm probability for this continuous-domain GLRT using chi-squared random field theory and the resulting closed-form threshold via the Lambert W function. The signal-to-noise ratio (SNR) gain of EMNOMP relative to MNOMP is derived and analyzed in depth. Numerical simulations validate the theoretical analysis and the effectiveness of EMNOMP compared to MNOMP.

eess.SP↗

SGD-Based Knowledge Distillation with Bayesian Teachers: Theory and Guidelines

Knowledge Distillation (KD) is a central paradigm for transferring knowledge from a large teacher network to a typically smaller student model, often by leveraging soft probabilistic outputs. While KD has shown strong empirical success in numerous applications, its theoretical underpinnings remain only partially understood. In this work, we adopt a Bayesian perspective on KD to rigorously analyze the convergence behavior of students trained with Stochastic Gradient Descent (SGD). We study two regimes: $(i)$ when the teacher provides the exact Bayes Class Probabilities (BCPs); and $(ii)$ supervision with noisy approximations of the BCPs. Our analysis shows that learning from BCPs yields variance reduction and removes neighborhood terms in the convergence bounds compared to one-hot supervision. We further characterize how the level of noise affects generalization and accuracy. Motivated by these insights, we advocate the use of Bayesian deep learning models, which typically provide improved estimates of the BCPs, as teachers in KD. Consistent with our analysis, we experimentally demonstrate that students distilled from Bayesian teachers not only achieve higher accuracies (up to +4.27%), but also exhibit more stable convergence (up to 30% less noise), compared to students distilled from deterministic teachers.

cs.LG↗

NeuPAN: Direct Point Robot Navigation with End-to-End Model-based Learning

Navigating a nonholonomic robot in a cluttered, unknown environment requires accurate perception and precise motion control for real-time collision avoidance. This paper presents NeuPAN: a real-time, highly accurate, map-free, easy-to-deploy, and environment-invariant robot motion planner. Leveraging a tightly coupled perception-to-control framework, NeuPAN has two key innovations compared to existing approaches: 1) it directly maps raw point cloud data to a latent distance feature space for collision-free motion generation, avoiding error propagation from the perception to control pipeline; 2) it is interpretable from an end-to-end model-based learning perspective. The crux of NeuPAN is solving an end-to-end mathematical model with numerous point-level constraints using a plug-and-play (PnP) proximal alternating-minimization network (PAN), incorporating neurons in the loop. This allows NeuPAN to generate real-time, physically interpretable motions. It seamlessly integrates data and knowledge engines, and its network parameters can be fine-tuned via backpropagation. We evaluate NeuPAN on a ground mobile robot, a wheel-legged robot, and an autonomous vehicle, in extensive simulated and real-world environments. Results demonstrate that NeuPAN outperforms existing baselines in terms of accuracy, efficiency, robustness, and generalization capabilities across various environments, including the cluttered sandbox, office, corridor, and parking lot. We show that NeuPAN works well in unknown and unstructured environments with arbitrarily shaped objects, transforming impassable paths into passable ones.

cs.RO↗

Deflection-Optimal Spectral Design for Diagonal Screening in Sparse Phase Retrieval Initialization

Spectral initialization is a critical yet challenging step in sparse phase retrieval. Existing spectral design theory is largely tailored to dense phase retrieval, where the objective is eigenvector estimation. In contrast, sparse initialization first requires a statistically distinct support screening step whose design remains much less understood. This paper develops a stage-specific design theory for diagonal support screening. We formulate each coordinate score as a scalar statistic for distinguishing support from non-support coordinates and adopt the deflection criterion as a tractable measure of screening quality. Within a Hilbert-space formulation, we characterize the optimal spectral preprocessors that maximize this criterion. In the Gaussian model, the unique optimum is the centered linear preprocessor. To obtain a bounded implementation, we introduce a spherical normalization and characterize its exact optimal preprocessor. Since the exact spherical optimum exhibits a boundary singularity, we construct a bounded surrogate preprocessor and establish its unique optimality under a surrogate deflection criterion. The surrogate optimum is shown to be the direction-only projection of the Gaussian rule, removing the unbounded radial factor while preserving the same first-order screening structure. We further establish a general finite-sample diagonal bridge that connects the exact and surrogate deflection quotients to the initialization sample complexity, and that replacing the unknown signal energy by its empirical estimate introduces only a lower-order perturbation. Numerical experiments are consistent with the ordering predicted by the design quotients and show that the Gaussian centered rule and its spherical counterpart behave nearly identically at both the screening and initialization levels.

eess.SP↗

Lattice Modulo Sampling

We propose a lattice-theoretic framework for modulo sampling of multidimensional bandlimited signals. Standard modulo analog-to-digital converters (ADCs) fold the signal component-wise into a square domain, reducing the recovery problem to independent one-dimensional problems. We extend the recovery guarantees to any lattice, requiring the same sampling rate as in the standard component-wise modulo setting. We also extend existing recovery algorithms to the general highdimensional lattice setting. Selecting a lattice with a smaller normalized second moment reduces the reconstruction mean squared error (MSE) through two complementary mechanisms: it lowers the folded signal power, which reduces the absolute noise energy at a fixed signal-to-noise ratio (SNR), and it reduces the quantization error when a matched lattice quantizer is applied. Higher-dimensional lattices offer better second moment compared to the hypercube lattice, with gains that grow substantially with dimension. Instantiating the framework in two dimensions with the hexagonal lattice reduces the MSE relative to the square at the same inradius by 16.7%. Furthermore, simulations on 8-dimensional signals using the E8 lattice to achive 57% in both additive and quantization noise. A topological interpretation connects each folding geometry to a surface whose genus reflects the lattice complexity, and reveals a natural hardware implementation via comparator circuits.

eess.SP↗

Knowledge Distillation for Sensing-Assisted Long-Term Beam Tracking in mmWave Communications

Infrastructure-mounted sensors can capture rich environmental information to enhance communications and facilitate beamforming in millimeter-wave systems. This work presents an efficient sensing-assisted long-term beam tracking framework that selects optimal beams from a codebook for current and multiple future time slots. We first design a large attention-enhanced neural network (NN) to fully exploit past visual observations for beam tracking. A convolutional NN extracts compact image features, while gated recurrent units with attention capture the temporal dependencies within sequences. The large NN then acts as the teacher to guide the training of a lightweight student NN via knowledge distillation. The student requires shorter input sequences yet preserves long-term beam prediction ability. Numerical results demonstrate that the teacher achieves Top-5 accuracies exceeding 93% for current and six future time slots, approaching state-of-the-art performance with a 90% reduction of model parameters. The student closely matches the teacher's performance while reducing the number of model parameters by over 1670% and cutting complexity by over 450%, despite operating with 60% shorter input sequences. This improvement significantly enhances data efficiency, reduces latency, and reduces power consumption in sensing and processing.

eess.SP↗

Semi-Supervised Model-Free Bayesian State Estimation from Compressed Measurements

We consider data-driven Bayesian state estimation from compressed measurements (BSCM) of a model-free process. The dimension of the temporal measurement vector is lower than that of the temporal state vector to be estimated, leading to an under-determined inverse problem. The underlying dynamical model of the state's evolution is unknown for a `model-free process.' Hence, it is difficult to use traditional model-driven methods, for example, Kalman and particle filters. Instead, we consider data-driven methods. We experimentally show that two existing unsupervised learning-based data-driven methods fail to address the BSCM problem in a model-free process. The methods are -- data-driven nonlinear state estimation (DANSE) and deep Markov model (DMM). While DANSE provides good predictive/forecasting performance to model the temporal measurement data as a time series, its unsupervised learning lacks suitable regularization for tackling the BSCM task. We then propose a semi-supervised learning approach and develop a semi-supervised learning-based DANSE method, referred to as SemiDANSE. In SemiDANSE, we use a large amount of unlabelled data along with a limited amount of labelled data, i.e., pairwise measurement-and-state data, which provides the desired regularization. Using {benchmark chaotic dynamical systems}, we {empirically} show that the data-driven SemiDANSE provides competitive state estimation performance for BSCM {using a handful of different measurement systems}, against a hybrid method called KalmanNet and two model-driven methods (extended Kalman filter and unscented Kalman filter) that know the dynamical models exactly.

eess.SP↗

TV-Regularized Frequency-Domain Full-Waveform Inversion for Single-Sided Linear Ultrasound Array Data

Quantitative speed-of-sound (SoS) and attenuation of tissues are closely related to pathology; however, conventional B-mode images are limited to qualitative visualization. Existing ultrasound full-waveform inversion (FWI) methods for quantitative SoS reconstruction are primarily developed under double-sided or ring-shaped arrays, which limits their applicability to widely adopted routine clinical acquisitions. In this work, we develop a frequency-domain, total variation (TV)-regularized FWI framework tailored for single-sided linear ultrasound arrays, which enables quantitative reconstruction of SoS maps using standard clinical probes. To address the severe ill-posedness and computational challenges in this setup, efficient forward modeling, fast gradient evaluation, ADMM-based optimization, and multi-GPU parallelization are integrated into the inversion framework. Numerical experiments in a thyroid cyst imaging scenario demonstrate that the proposed method reconstructs the SoS of both simple (fluid-filled) and solid cysts with improved visual and quantitative performance compared to conventional FWI. Additional 2D and 3D simulations across different target and array apertures further elucidate the capabilities and limitations of single-sided ultrasound FWI.

eess.SP↗

Ultra-Massive MIMO with Orthogonal Chirp Division Multiplexing for Near-Field Sensing and Communication Integration

This paper integrates the emerging ultra-massive multiple-input multiple-output (UM-MIMO) technique with orthogonal chirp division multiplexing (OCDM) waveform to tackle the challenging near-field integrated sensing and communication (ISAC) problem. Specifically, we conceive a comprehensive ISAC architecture, where an UM-MIMO base station adopts OCDM waveform for communications and a co-located sensing receiver adopts the frequency-modulated continuous wave (FMCW) detection principle to simplify the associated hardware. For sensing tasks, several OCDM subcarriers, namely, dedicated sensing subcarriers (DSSs), are each transmitted through a dedicated sensing antenna (DSA) within the transmit antenna array. By judiciously designing the DSS selection scheme and optimizing receiver parameters, the FMCW-based sensing receiver can decouple the echo signals from different DSAs with significantly reduced hardware complexity. This setup enables the estimation of ranges and velocities of near-field targets in an antenna-pairwise manner. Moreover, by leveraging the spatial diversity of UM-MIMO, we introduce the concept of virtual bistatic sensing (VIBS), which incorporates the estimates from multiple antenna pairs to achieve high-accuracy target positioning and three-dimensional velocity measurement. The VIBS paradigm is immune to hostile channel environments characterized by spatial non-stationarity and uncorrelated multipath environment. Furthermore, the channel estimation of UM-MIMO OCDM systems enhanced by the sensing results is investigated. Simulation results demonstrate that the proposed ISAC scheme enhances sensing accuracy, and also benefits communication performance.

eess.SP↗