SEARCH · Searcharxiv

Search Searcharxiv

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5Linked to original sources

arXiv2026

From topology learning to graph generation: A unifying perspective

Learning graph structures from data is a fundamental problem that spans a wide range of signal processing and machine learning tasks. While significant effort has been made to tackle the problem, existing research has largely evolved along two parallel directions. The first seeks to infer the topology of an individual graph from observations supported on it, whereas the second seeks to learn a generative distribution from observed graph instances, enabling the sampling of new graphs. This review presents a unified framework that connects these formulations by viewing them as inverse problems of a common generation process for graph data. We review the major methodologies within this framework, highlight their relationships, strengths, and limitations, and identify opportunities for integrating ideas across paradigms. By bridging graph topology learning and graph generation, this review provides a broader cross-disciplinary perspective on the field and outlines promising directions for future research.

stat.ML↗

arXiv2026

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC↗

arXiv2026

Multivariable Geometric Laplace Transform and Fault Detection in Distributed-Converter Lines

Monitoring a DC line with many distributed power converters is a genuinely spatio-temporal problem: the information about a localized fault travels along the whole conductor and reaches a few measurement points mixed with the dynamics of the line itself. This paper develops a two-dimensional geometric Laplace transform (t,x) -> (s_t,s_x) over a commutative subalgebra of the geometric algebra Cl(4,0), isomorphic to Segre's bicomplex numbers, in which two bivectors B_t and B_x act as independent imaginary units for the temporal and the spatial phase. Because the two phases live in algebraically distinguishable planes, a fault at position x_f leaves a transformed residual that factorizes as F_f(s_t) e^{-s_x x_f}: its temporal nature stays in the first factor and its location can be read as a geometric argument of the second. On this representation we build a transmission-line model of the converter line and its space-time dispersion relation, a distributed control by admittance shaping, including an exact treatment of discrete converter sites (spatial sampling, aliasing, and a per-converter droop realization that is exact on the sub-Nyquist band), and a fault diagnosis chain that detects, localizes and classifies injection-loss, shunt, sensor and local-controller faults, extends to multiple simultaneous faults with automatic order selection, and distinguishes the outage of a plant from a cable defect. As an integral object the transform is known in bicomplex analysis, and with a single independent variable it reduces to the complex Laplace transform; the contribution lies in its geometric embedding and in its operational use for fault diagnosis in distributed-converter networks. All results are reproduced by an accompanying open implementation.

eess.SY↗

arXiv2026

A Dry-Contact Ear-EEG System With Continuous Electrode-Skin Impedance Mismatch Monitoring for Motion Artifact Cancellation Using DRL Stimulus

Dry-contact ear-electroencephalography (Ear-EEG) enables wearable neural monitoring. However, motion induced electrode-skin impedance (ESI) mismatches between electrodes can severely degrade signal quality. To the best of our knowledge, this paper presents the first proof-of-concept dry-contact EarEEG system that uses a driven-right-leg (DRL) stimulus for continuous ESI mismatch monitoring, enabling online adaptive motion artifact cancellation. A 1 kHz sinusoidal stimulus is injected through the DRL electrode. The resulting response to the injected carrier is separated from the EEG using bandpass filtering and demodulation, and then used to extract the ESI mismatch information as the reference input for a normalized least-mean-square adaptive filter followed by a Hampel filtering stage. To evaluate artifact suppression and preservation of neural activity, alpha-band EEG activity was analyzed involving four healthy participants performing head nodding, electrode tapping, and jaw clenching. The system achieved artifact power reductions of 6.5, 12.6, and 9.0 dB (77.6%, 92.8%, and 86.4%, respectively) while alpha-band modulation remained clearly observable after processing. This demonstrates the feasibility of DRL-stimulusbased ESI mismatch monitoring for motion artifact cancellation in wearable dry-contact Ear-EEG.

eess.SP↗

arXiv2026

Understanding Automatic Mixing: A Subtask-Oriented Analysis of Two-Stage Mixing System

Automatic mixing transforms multitrack recordings into perceptually coherent, balanced, and aesthetically consistent mixes. In real-world production, this task is challenging due to large track counts, diverse instrumentation, and strong inter-track dependencies. Two-stage systems address this complexity by separating intra-group processing from inter-group mixing, yet it remains unclear whether their gains arise from stronger component models or from explicit task decomposition. We present a subtask-oriented analysis of automatic mixing through three controlled listening experiments. We investigate whether full-mix models transfer to intra-group mixing, whether downstream models compensate for grouping and loudness errors, and whether two-stage decomposition improves full-mix quality. Across three dense pop and rock excerpts, transfer differs between the evaluated models; inappropriate grouping causes clear downstream degradation, while altered loudness relationships have weaker and model-dependent effects. Both two-stage variants significantly outperform their corresponding single-stage baselines. These findings support explicit separation of local balance and global mix coordination as a useful design principle for automatic mixing. Code and audio examples are available online.

cs.SD↗

arXiv2026

A single-precision floating-point systolic Givens-QRD Triangular Solver for MVDR Beamforming

Computation of adaptive beamforming weights in Minimum Variance Distortionless Response (MVDR) processing is a latency-critical operation that poses significant challenges for real-time hardware implementation. This paper presents an FPGA implementation of a systolic Givens-rotation QR decomposition pipeline for MVDR beamforming on a simulated 32-element ultrasound transducer array, using single-precision floating-point arithmetic. The design is deployed on a Zynq UltraScale+ FPGA at 100 MHz with three parallel kernel instances operating concurrently, achieving a measured throughput of 31,123 weight vectors/s at 90.9% parallel efficiency relative to the measured single-instance rate. At an estimated 2.451 W of programmable-logic power, and 5.286 W including the processing system, this corresponds to 12,698 and 5,888 weight vectors/s/W, respectively. Under a matched three-way dispatch, a 24-core Intel Xeon Gold 5220R at 2.20 GHz achieves 465,699 weight vectors/s at a measured 83.08 W package power, corresponding to 5,606 weight vectors/s/W. The FPGA therefore attains 2.3x the power-normalised throughput of the processor on a programmable-logic basis and 1.05x on a total on-chip basis. In contrast, the processor retains a raw throughput advantage of approximately 15x at this operating point. Numerical precision is validated against MATLAB float32 reference outputs from a Field II cyst phantom simulation, achieving a 100% pass rate with a root mean square error of 5.10x10^-7, confirming near-theoretical finite-precision behaviour without systematic bias.

cs.AR↗

arXiv2026

Feasible but Not Safe: Constraint Violations and Report-Channel Attacks in Learned Cell-Free ISAC Association

Learning-based schedulers have been proposed to provide real-time user, target, and access point (AP) association in distributed cell-free integrated sensing and communication systems. In a typical approach, a graph neural network (GNN), trained on labels from a mixed-integer linear program, maps lightweight per-AP statistics to decisions on AP clustering, user and target scheduling, and mode selection in one forward pass. Such solutions assume that hard constraints, enforced only as soft training penalties, hold at inference, and that the self-reported statistics are truthful. Using our ASSENT algorithm as an example, we find that despite high $F_1$ scores, many solutions violate at least one hard constraint, demonstrating that high prediction accuracy does not ensure joint feasibility. Projecting the GNN output onto a feasible solution restores constraint satisfaction with low utility loss, even with a simple greedy repair procedure. We further show that feasibility alone does not guarantee robustness to false data injection attacks. A single malicious AP that reports false information cannot substantially increase its user associations, but can greatly increase the rate of infeasible solutions. The effect of such attacks depends on the type of information being falsified. Misreporting information that affects the objective can largely be mitigated through feasibility projection, whereas falsifying information that affects the constraints cannot. The latter can, however, be detected using a low-complexity cross-AP consistency check. These results show that learned ISAC schedulers should be evaluated using constraint-aware feasibility metrics in addition to conventional accuracy measures.

cs.NI↗

arXiv2026

A Survey of Decentralized Physical Infrastructure Network,Research Directions, and Open Challenges

The Decentralized Physical Infrastructure Network (DePIN) represents a transformative paradigm that redefines the construction, operation, and governance of Information and Communication Technology (ICT) infrastructure in the Web 3.0 era. DePIN integrates physical resources, such as networking equipment, storage, and computing power, with decentralized digital governance, forming a self-incentivized ecosystem that is collaboratively built, shared, and governed by the community. It provides a foundational framework for future communication networks, facilitating decentralized edge intelligence, efficient resource sharing, and trustworthy coordination among heterogeneous devices. Focusing on the feasibility of this emerging paradigm, this paper examines the technology landscape in the pre-DePIN era and gaps between existing methodologies and the forthcoming decentralized infrastructure for Web 3.0. It provides a systematic and comprehensive survey of the background, core characteristics, technical architecture, and applications of DePIN across various vertical domains. The paper analyzes the DePIN technology stack from six layers: physical infrastructure, blockchain, interaction, trust, incentive, and application, with special attention to their cross-layer feedback loops, implementation readiness, and deployment limitations. To further bridge conceptual analysis and practical deployment, we propose a DePIN feasibility assessment framework covering technical, governance, and economic dimensions. Moreover, we highlight promising research directions, providing insights and guidance for further exploration and deployment of DePIN.

eess.SP↗

arXiv2026

Direct Satellite-to-Device Communications: From Cooperative Task Offloading to Non-Cooperative Access Monitoring

Direct satellite-to-device (DS2D) communication is emerging as a transformative paradigm for extending ubiquitous connectivity and edge computing capabilities to remote and underserved regions within 6G non-terrestrial networks. However, practical deployment faces dual critical challenges: i) dynamic satellite channel conditions (e.g., severe Doppler shifts, fast fading) and constrained satellite computing resources in cooperative scenarios; and ii) unauthorized satellite access introduces significant spectrum security threats in non-cooperative scenarios. To address these challenges, we propose a versatile DS2D system that supports cooperative task offloading and non-cooperative access monitoring. For cooperative DS2D communications, we integrate a channel estimation module with a dueling double deep Q-network (D3QN) to dynamically optimize task offloading strategy. For non-cooperative DS2D communications, we propose Transformer-based models to enable blind signal detection and automatic modulation classification (AMC). Simulation results show that: 1) The D3QN algorithm reduces average latency by up to 225\% compared to static association policies. 2) Our signal detection model achieves an average presence detection probability of 90.5\% for DS2D signals. 3) The proposed AMC algorithm achieves superior performance across different signal-to-noise ratios (SNRs), with a 9.4\% accuracy gain in low-SNR regimes compared to existing methods.

cs.IT↗

arXiv2026

Differential Space-Time Block Coding for Phase-Unsynchronized Cell-Free MIMO Downlink

In the downlink of CF-mMIMO systems, spectral efficiency gains critically rely on joint coherent transmission, as all APs must align their transmitted signals in phase at the UE. Achieving such phase alignment is challenging, as it requires tight synchronization among geographically distributed APs. In this paper, we address this issue by introducing a DSTBC approach that bypasses the need for AP phase synchronization. We first provide analytic bounds to the achievable spectral efficiency of CF-mMIMO with phase-unsynchronized APs. Then, we propose a DSTBC-based transmission scheme tailored to CF-mMIMO, which operates without CSI and phase synchronization among the APs. We derive a closed-form expression for the resulting SINR, enabling quantitative comparisons among different DSTBC schemes. Numerical simulations confirm that phase misalignments can significantly impair system performance. In contrast, the proposed DSTBC scheme can mitigate these effects, achieving performance comparable to that of fully synchronized systems. However, when more than two APs jointly serve a UE, the code rate of DSTBC schemes can limit their SE gains. Hence, we also investigate DQO-STBC schemes that achieve full code rate by relaxing the orthogonality constraints.

cs.IT↗

arXiv2026

QABBA: Symbolic Time-Series Compression via Integer-Quantized Aggregation

The expansion of time-series data from sensors and monitoring systems has made compact representations increasingly important. Such representations should retain signal structure while cutting storage, transmission and computation costs. Adaptive Brownian Bridge-based Aggregation (ABBA) addresses this need by converting long numerical series into short symbolic sequences, but reductions in parameter storage and computational precision remain desirable. We propose Quantized ABBA (QABBA), a quantized version of ABBA. By quantizing the symbolic centers, QABBA reduces the parameter footprint and enables integer arithmetic while maintaining high reconstruction quality. We establish several error bounds for the additional approximation introduced by quantization: a dimension-free bound on the excess error of each segment, a time-domain reconstruction-error bound, a stability condition for symbolic assignment, and a rule for allocating bits between segment lengths and increments. The resulting symbolic strings can be passed directly to a pretrained large language model (LLM) without any extra time-series embedding layer. Experiments on the Monash regression archive, UCR Time Series Classification Archive, and UEA Multivariate Time Series Classification Archive demonstrate a practical trade-off among storage, reconstruction accuracy and downstream predictive performance. QABBA therefore provides an error-controlled, low-precision symbolic representation for time-series compression and LLM-based analysis.

cs.LG↗

arXiv2026

Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming

Signed graphs are equipped with both positive and negative edge weights, encoding pairwise correlations as well as anti-correlations in data. A balanced signed graph is a signed graph with no cycles containing an odd number of negative edges. Laplacian of a balanced signed graph has eigenvectors that map via a simple linear transform to ones in a corresponding positive graph Laplacian, thus enabling reuse of spectral filtering tools designed for positive graphs. We propose an efficient computation method to learn a balanced signed graph Laplacian directly from data. Specifically, extending a previous linear programming (LP) based sparse inverse covariance estimation method called CLIME, we formulate a new LP problem for each Laplacian column $i$, where the linear constraints restrict weight signs of edges stemming from node $i$, so that nodes of same / different polarities are connected by positive / negative edges. We derive a feasible CLIME parameter $ρ_i$ for each sign-constrained column problem. We solve the LP problem efficiently by tailoring a sparse LP method based on ADMM. We theoretically prove that the row / column updates produce a non-increasing objective sequence, and show that the iterations are terminated in a finite number of steps. Extensive experimental results on synthetic and real-world datasets show that our balanced graph learning method outperforms competing methods and enables reuse of spectral filters, wavelets, and graph neural nets (GNN) constructed for positive graphs.

cs.LG↗

arXiv2026

Quantum Private Distributed Matrix Multiplication: Extending the Classical Codes and Limitations

In this paper, we explore how quantum resources can be used to increase the rate of private distributed matrix multiplication (PDMM). In PDMM, a user who has two high-dimensional matrices, A and B, and lacks the computational capabilities to apply matrix multiplication locally, divides the matrices A and B into K and L sub-blocks, respectively. Then, the user sends them to N servers to apply the required multiplication \emph{privately}, i.e., any $T$ colluding servers cannot get any information about the user's matrices. The goal is to reduce the number of servers needed to perform the required matrix multiplication, thereby decreasing the communication cost. First, in the high-privacy regime, the state-of-the-art classical code is called the gap additive secure polynomial (GASP) code. We define a feasibility requirement in the quantum setting for the GASP code such that the highest performance is achieved when the requirement is satisfied. Thus, super-dense coding gain is achieved when the feasibility condition is satisfied. We show that when $T \geq KL-K+1$, the feasibility condition is always satisfied and the GASP code can be extended to the quantum version. In the case of $T < KL-K+1$, the feasibility can still be satisfied. To further examine this behavior, we numerically study how the minimum privacy requirement depends on the matrix dimensions and provide a quadratic estimate for this relation. The results suggest that feasibility can be achieved when $T \sim 0.5 KL$. Second, in the low-privacy regime, the recently developed cyclic-addition degree tables (CAT) and discretely optimized GASP (DOG) codes are among the most efficient known classical constructions for PDMM. We show that the feasibility condition developed for GASP can be adopted for both CAT and DOG codes as well, thus unifying the feasibility framework for multiple classical PDMM coding schemes.

cs.IT↗

arXiv2026

Leakage-Audited Benchmarking Reveals Limited Evidence for Cross-Subject Auditory-Evoked EEG Vowel Perception Decoding

We tested whether auditory-evoked EEG supports subject-independent five-vowel perception decoding when trial identity, model identity, prediction provenance, and participant-level inference are controlled within a single benchmark. We reconstructed Study 2 event tables from OpenNeuro ds006104 version 1.0.1 and analysed the consonant-vowel pair task. One-to-one marker-stimulus pairing yielded 3,840 independent trials; control-condition selection and artifact rejection retained 1,094 epochs from 16 participants and 61 EEG channels. Thirteen unique implementations were evaluated using leave-one-subject-out testing, with participant metrics reconstructed from 36,102 trial predictions across 33 complete prediction replicas. Random Forest was numerically highest at 21.474% balanced accuracy (95% participant-bootstrap interval, 19.526-23.482%; chance, 20%), but neither its participant-level tests nor any implementation survived correction across the 13-model family. Deep-model performance was close to chance, and several architectures showed substantial seed-dependent variation and low trial-label agreement. An exploratory MDM analysis comprising 9,616 genuine refits across training cohorts of 3-15 participants showed no monotonic performance gain. Within this dataset and protocol, evidence for reliable cross-subject five-vowel decoding is limited. The benchmark provides a reproducible chain from source rows to retained epochs, predictions, participant-level metrics, multiplicity-adjusted inference, and bounded diagnostic analyses.

eess.SP↗

arXiv2026

A Kalman Filter-Based Tracking Loop Design for Real-Time Aerospace GNSS Applications with Minimum Pull-Out Probability

Kalman filter-based (KF-based) tracking loops are a powerful alternative to traditional phase-locked loops (PLLs) for Global Navigation Satellite Systems (GNSS) signal tracking. The primary advantage of the KF is its ability to incorporate high-fidelity models for receiver dynamics and clock errors, allowing the loop to adapt optimally to signal conditions. However, this theoretical optimality is often compromised in practice by the processing delays inherent in real-time systems with hardware correlators, which existing KF formulations typically neglect. This paper introduces a Modified Kalman filter (mKF) that overcomes this limitation specifically for hardware-based architectures. By reformulating the measurement update to be consistent with the processing delays, the proposed mKF maintains optimality in a practical implementation. We further present a systematic method for tuning both the process noise covariance matrix and the correlation time, based on an analytical expression for the pull-out probability (POP), which is validated through Monte Carlo simulation. The mKF is then validated with a GNSS signal simulator, both by post-processing baseband samples and on a real-time GPS receiver with hardware correlators. A direct equivalence between the mKF and a one-delay Digital PLL (DPLL) is established entirely in the digital domain. At equal noise bandwidth, the mKF matches the DPLL's phase error variance while achieving lower error in the higher-order states. Moreover, the mKF sustains lock at bandwidths inaccessible to the optimal one-delay DPLL under the same dynamic stress, positioning the proposed architecture as a robust and noise-efficient solution for high-dynamic aerospace GNSS applications.

eess.SP↗

arXiv2026

Real-Time Neuromorphic Spectrum Intelligence Simulator

We present the Real-Time Neuromorphic Spectrum Intelligence Simulator (RT-NuSIS), a modular framework to study spiking neural network (SNN) and memristor-inspired agents for dynamic spectrum access under constrained energy budgets and adversarial conditions. RT-NuSIS couples leaky integrate-and-fire neuronal dynamics, memristive synaptic models, physics-informed energy-harvesting models (triboelectric and RF), and adversary models including jamming and Byzantine behavior. We formalize the simulator mathematically, prove boundedness, present a mean-field adversary threshold, analyze per-step complexity, and provide a reproducible benchmark harness for energy-per-inference, latency, and robustness metrics. The codebase is modular, deterministic by seed, and designed for large-scale event-driven simulations.

eess.SP↗

arXiv2026

BeamRMX: Radiation-Pattern-Driven Learning for Generalizable Beam Radio Map Prediction and Beam Management

The evolution toward sixth-generation (6G) wireless networks is driving larger antenna arrays and highly directional multi-beam transmission, making accurate knowledge of beam-dependent spatial coverage important for beam management and environment-aware network operation. Radio maps (RMs) provide such a representation, yet conventional RM prediction assumes omnidirectional or transmitter-level radiation. In beamformed multiple-input multiple-output (MIMO) systems, one propagation scene instead gives rise to many configuration-dependent beam radio maps (BeamRMs), creating challenges in beam representation and generalization. Existing methods either condition prediction on beam descriptors or use beam maps as auxiliary inputs to generic architectures. We propose BeamRMX, which, to the best of our knowledge, is the first dedicated framework to treat the spatial radiation pattern as the primary BeamRM query and learn how scene geometry transforms it into the received power field. XBase learns multiscale interactions between the radiation query and scene geometry, while an optional Evidence Adapter uses a few cross-configuration BeamRMs from the same scene. Matched-domain and zero-shot experiments show consistent gains over deterministic and diffusion baselines, including mean absolute error reductions of 26.1\% on unseen scenes and 47.8\% on an unseen configuration. Cross-configuration evidence further improves reconstruction and intra-sector beam refinement.

eess.SP↗

arXiv2026

MaskCode: Mask Transformer for Feedback-Assisted Coding With Linear Block Codes

Feedback-based coding schemes have demonstrated substantial performance gains over today's open-loop coding schemes. Unfortunately, these gains are usually achieved in idealized settings with perfect feedback. Over the last few years, machine learning-based schemes have been shown to be promising solutions for implementing feedback-based codes, particularly when combined with short-block-length open-loop error correcting codes (ECCs) in a concatenated coding structure. However, existing ML-based feedback schemes remain agnostic to the outer code's structure, potentially misallocating feedback resources on error patterns already correctable by the outer ECC. To address this, we propose MaskCode, a Transformer-based inner feedback code for concatenated coding systems, which explicitly incorporates structural knowledge of the outer linear block code into the inner feedback encoder design via two synergistic mechanisms: 1) a soft syndrome-based input that informs the encoder about potential parity constraint violations, and 2) a code-aware attention mask derived from the Tanner graph. We further show that end-to-end training with a differentiable belief propagation (BP) decoder offers no additional gain, as MaskCode's structure-aware design already internalizes the structural knowledge of the outer code; in fact, backpropagation through the iterative BP decoder introduces gradient explosion, which degrades rather than improves performance. Extensive evaluations on BCH and LDPC outer codes demonstrate that MaskCode consistently outperforms all baselines, achieving up to 1.5 dB SNR gain.

cs.IT↗