跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+817新增论文
+672其中 AI 相关
+98已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 06:59各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 13:13 — 2026-11-19 13:13(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 273 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
新论文 · v1arXiv:2611.20164

Cross-Subject Priors for Maximum a Posteriori Estimation of Latent Structure Influence Models in Motor-Imagery EEG With Few Trials

Sagnik De, Anil Kumar Gupta

原文摘要

Coupled hidden Markov models such as the latent structure influence model (LSIM) describe how the sensorimotor rhythms of the two hemispheres evolve and interact during motor imagery, but subject-specific maximum likelihood (ML) estimates are unstable when few trials are available. This paper derives a maximum a posteriori (MAP) estimator for the LSIM whose conjugate prior equals the expected statistics of $λ$ pseudo-trials from a population model fitted to other subjects. The M-step remains in closed form, expectation maximization keeps its monotone ascent, and ML ($λ=0$) and the population model ($λ\to\infty$) are limiting cases. The prior strength was selected on 35 subjects of the PhysioNet EEG Motor Movement/Imagery Dataset and applied unchanged to 70 held-out subjects and to BCI Competition IV-2a. With $λ=1$ the held-out log-likelihood exceeded that of ML in 61 of 70 subjects (Holm-adjusted $p=9.1\times10^{-8}$) and in all 70 subjects with five training trials per class. A prior learned only from the PhysioNet data improved the held-out likelihood of all nine BCI IV-2a subjects at five trials per class and reduced the error of the joint transition matrix by 61%. Decoding accuracy did not improve ($p=0.17$). Cross-subject priors therefore stabilize few-trial dynamic models of motor-imagery EEG, but they do not improve decoding, which in these data relies mainly on structure shared across subjects.

eess.SP · cs.LG

新论文 · v1arXiv:2611.20068

Kolmogorov-Arnold Lookup Table Demappers for Amplitude Phase-Shift Keying over Nonlinear Satellite Links

Kürşat Tekbıyık, Güneş Karabulut Kurt, Antoine Lesage-Landry

原文摘要

Next-generation high-throughput satellites increasingly demodulate and decode on board, so the per-symbol cost of the receiver constrains payload power and throughput. Soft demappers for nonlinear satellite links must therefore produce accurate bit log-likelihood ratios (LLRs) at low cost. We introduce a KAN-LUT demapper, a two-layer Kolmogorov--Arnold network (KAN) whose learned univariate edge functions are stored as 128-entry lookup tables (LUTs), so that inference needs only table reads, linear interpolation, and additions. We bound the LLR error introduced by the tables and evaluate the demapper on amplitude phase-shift keying (APSK) links with low-density parity-check (LDPC) coding and a nonlinear traveling-wave-tube amplifier. For 16-, 32-, and 64-APSK, KAN-LUT stays within 0.2 dB of a per-cluster Gaussian log-MAP (LogMAP-CG) demapper, while its cost relative to LogMAP-CG falls from 87% to 27% as the order grows. It matches or slightly exceeds multilayer perceptrons (MLPs) at about one fifth of their cost, remains competitive under operating-point mismatch, and needs only tens of kilobytes of tables. KAN-LUT is therefore a low-cost candidate demapper for regenerative payloads.

eess.SP · cs.LG

新论文 · v1arXiv:2611.20058

SWAN-Rx: Efficient and Bandwidth-Scalable Neural Reception for MIMO-OFDM

Zhoubin Kou, Cong Shen

原文摘要

We present a Scalable Windowed Axial-attention Neural Receiver (SWAN-Rx) for multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. The receiver improves reception accuracy and reduces forward-pass computation while supporting frozen-weight reuse across bandwidth allocations and channel conditions. It combines a common resource-element representation of received observations and pilot context with alternating time-axis and local frequency-axis attention. Shared parameters and relative positional information permit soft detection across allocation lengths without inference-time parameter updates. At fixed subcarrier spacing, model configuration, and symbol count, bounded frequency neighborhoods give linear growth of forward-pass computation with bandwidth. Evaluations compatible with the 5G New Radio physical layer reuse weights trained on four physical resource blocks (PRBs) at up to 273 PRBs and on unseen channels. At the training bandwidth, SWAN-Rx achieves lower pre- and post-decoding bit error rates than the implemented three-step neural receiver (NRX) and DeepRx-MIMO baselines, with 16.9% and 39.7% fewer parameters and 56.3% and 35.7% fewer forward-pass operations, respectively. The same weights achieve lower pre-decoding error rates than these baselines throughout the evaluated bandwidth-extrapolation and 16-PRB channel-transfer tests, with an estimated 0.4-0.9 dB signal-to-noise ratio reduction relative to NRX at a pre-decoding error rate of $10^{-2}$ in the 16-PRB tests.

eess.SP · cs.IT · cs.LG

新论文 · v1arXiv:2611.19865

Max-Min Throughput in RSMA-Aided SWIPT for Sustainable Internet of Underground Things: A Deep Reinforcement Learning Approach

Kaiqiang Lin, Mohamed-Slim Alouini

原文摘要

Unmanned aerial vehicle (UAV)-enabled wireless-powered underground sensor networks (WPUSNs) allow underground devices (UDs) to harvest radio-frequency energy from a UAV via wireless energy transfer (WET) techniques, enabling sustainable Internet of underground things (IoUT) applications. This paper integrates rate-splitting multiple access (RSMA)-aided simultaneous wireless information and power transfer (SWIPT) into UAV-enabled WPUSNs to deliver information and energy to UDs. Within this framework, we investigate a max-min fairness problem that jointly optimizes the UAV transmit power, power allocation and message splitting, power-splitting ratios, and time allocation, aiming to maximize the minimum uplink throughput across UDs subject to per-UD downlink throughput requirements and a UAV energy-consumption constraint. To address this non-convex problem under dynamic underground environments, we develop an off-policy deep reinforcement learning approach based on the primal-dual truncated quantile critics (PD-TQC), where a TQC-based reward critic evaluates the fairness objective, cost critics estimate constraint costs, and an actor learns the resource-control policy with adaptive dual-variable updates. Simulations using in-situ soil volumetric water content measurements from a center-pivot irrigation farm demonstrate that PD-TQC achieves the highest annual average minimum uplink throughput compared with four benchmarks while satisfying the per-frame constraints in over 96% of the evaluated frames, and that this throughput advantage is preserved under different Rician factors, numbers of UDs, and downlink throughput thresholds.

eess.SY · cs.LG · eess.SP

版本更新 · v2arXiv:2609.12244

CRFCAN: A Complex-Valued Cross-Domain Residual Network for Joint Channel and Phase Noise Estimation in Sub-THz OFDM Systems

Ruilin Wang, Xiaodai Dong

原文摘要

The coupling between multipath propagation and phase noise (PN) poses challenges for joint channel and PN estimation in sub-terahertz (sub-THz) cyclic-prefix OFDM systems. This paper proposes CRFCAN, a complex-valued residual FFT convolutional attention network for single-input single-output systems using comb-type pilots only. Its shared backbone alternately refines time- and frequency-domain features through complex-valued residual channel attention and PN-inspired multiplicative updates, producing channel and PN estimates in their respective domains. An unfolded PN refinement tail combines least-squares updates with feature-guided complex-valued CNN corrections. Simulation results show that CRFCAN achieves lower channel estimation error and bit error rate than the evaluated baselines in both training TDL-A/B/E + 3GPP RAN4 and TDL-C/D + 3GPP RAN1 generalization settings, together with lower PN estimation error at medium-to-high signal-to-noise ratios. Further tests without fine-tuning demonstrate its applicability across different data modulations, OFDM parameters, channel models, and PN spectra.

cs.LG · eess.SP

新论文 · v1arXiv:2611.19820

Hermitian Positive Definite Neural Networks for Matrix-CFAR Geometric Signal Detection in Nonhomogeneous Clutter

Xiyao Chen, Takumi Sato, Linyu Peng

原文摘要

Matrix information geometry (MIG) detectors exploit the Riemannian geometry of Hermitian positive definite (HPD) matrices to achieve robust object detection in nonhomogeneous clutter. The matrix constant false alarm rate (matrix-CFAR) method is a representative MIG detector that relies on the geometric structures with respect to specific metrics. In most cases, computing representative HPD covariance matrices requires numerical methods, typically involving computationally intensive iterative optimization algorithms. Although explicit formulas are available for certain cases, such as the log-Euclidean (LE) mean, they are generally unavailable for many other matrix means and medians. To address this challenge, we propose integrating the Hermitian positive definite neural network (HPDNet) into the matrix-CFAR framework, replacing conventional numerical optimization procedures with a learned, geometry-preserving mapping that directly estimates representative HPD covariance matrices from data. In the simulations, the framework is evaluated for MIG detectors using both means and medians associated with the affine-invariant Riemannian metric, the LE metric, and the Bures--Wasserstein metric, on both simulated compound-Gaussian clutter and real IPIX sea clutter. In both cases, the HPDNet is trained solely on simulated data to assess its applicability to the study of real data. The results show a significant reduction of computational cost in testing, while maintaining detection performance and robustness.

eess.SP · cs.LG · stat.AP

新论文 · v1arXiv:2611.19640

Floorplan-Context-Aware Cross-Environment Human Activity Recognition from mmWave Radar Point Clouds

Zixiong Han, Xilai Wang, Chenzhe Zhao, Amr Mourad, Miodrag Bolic

原文摘要

Human activity recognition (HAR) models based on mmWave radar point clouds and trained in controlled open spaces often experience performance degradation when deployed in furnished rooms. We propose a Floorplan-Context-Aware (FCA) HAR enhancement method that augments the input with subject-furniture relative position information to improve cross-environment performance. Because existing mmWave point-cloud datasets lack registered floorplans, we introduce a pseudo-landmark augmentation strategy for training the FCA model. In cross-environment evaluation on the mm-ADL-Home dataset, FCA achieves 77.70% accuracy and 65.49% macro-F1, improving upon the point-cloud-only direct-transfer baseline by 10.73 and 10.05 percentage points, respectively, and exceeding the strongest evaluated adaptation baseline by 7.37 and 6.27 percentage points. At deployment, FCA requires only a one-time registration of furniture landmarks, with no target-domain activity annotations or model weight updates.

cs.CV · eess.SP

新论文 · v1arXiv:2611.19515

Over-the-Air Semantic Alignment via Dual Stacked Intelligent Metasurfaces

Mario Edoardo Pandolfo, Kyriakos Stylianopoulos, George C. Alexandropoulos, Paolo Di Lorenzo

原文摘要

Semantic communications enable task-oriented information exchange, but suffer from latent-space mismatch when transmitter and receiver employ heterogeneous machine learning models. Existing semantic alignment methods rely on digital processing, introducing computational and latency overhead. This paper proposes a dual stacked intelligent metasurfaces (dual-SIM) architecture that performs semantic alignment entirely in the wave domain. By jointly exploiting programmable metasurfaces at both ends of a link and the wireless channel, the proposed architecture realizes an end-to-end linear transformation between heterogeneous latent spaces. We show phase-only multilayer SIM can approximate both supervised linear aligners and zero-shot Parseval-frame equalizers. We investigate single-SIM, disjoint asymmetric and symmetric dual-SIM, and jointly optimized dual-SIM configurations, considering channel equalization and constructive channel exploitation. For joint design, we develop an alternating projected gradient algorithm with convergence guarantees to first-order stationary points. We further introduce a deep-unrolled network that unrolls gradient-based iterations to reduce computational cost of SIM reconfiguration under channel variations. Numerical results with heterogeneous vision transformer encoders show accurate semantic alignment from moderate to high signal-to-noise ratios. The joint and symmetric disjoint dual-SIM designs achieve the highest accuracy over compact channels, the joint design leads at shallow stack depths, and the advantage over single-SIM designs diminishes at equal depth.

eess.SP · cs.LG · stat.ML

版本更新 · v3arXiv:2611.00920

Non-intrusive appliance state detection in unseen homes using classical machine learning

Zablon Ombiro

原文摘要

Non-intrusive load monitoring (NILM) infers, from the aggregate signal of a single smart meter, when each appliance in a home is ON or OFF, offering significant potential to enhance energy efficiency. Classical machine-learning detectors report F1 scores (the harmonic mean of precision and recall) from 0.53 to 0.98, but the causes of this spread are unseparated, so it is unclear which design choices matter. Real-world deployments, however, require detectors that work in houses never seen during training, whereas most studies test on houses used for training. To address this challenge, we propose a factorial analysis of variance design that separates the effects of classifier, feature set and class-imbalance strategy across five appliances (270 configurations), and a leave-house-out protocol with house-grouped model selection. Unlike studies that vary one factor at a time or pool houses, the approach attributes performance to each factor and measures it on unseen homes. Extensive experiments on REFIT, a public dataset of 20 UK households, show that the appliance explains 38 percent of F1 variance, the feature set 13 percent, the classifier 8 percent and the imbalance strategy 2 percent. Pooled testing overstates support-weighted F1 (0.548 versus 0.447 in unseen houses), class weighting gains grow from 32 percent to 69 percent, and feature engineering gives the same 52 percent gain in both protocols. House-grouped selection raises F1 for three of five appliances, by up to 0.110, and a convolutional neural network scores 0.450 (0.496 calibrated) against 0.447 for classical models. The findings guide appliance-level monitoring in smart-metering and energy-management systems.

cs.LG · eess.SP

新论文 · v1arXiv:2611.18450

PACT:一种解码器置信度引导的两轮接收机,用于亚太赫兹OFDM中的联合信道与相位噪声估计

PACT: A Decoder-Confidence-Guided Two-Round Receiver for Joint Channel and Phase-Noise Estimation in Sub-THz OFDM

Ruilin Wang, Xiaodai Dong

AI 速读 基于摘要

作者提出一种由解码器置信度引导的两轮接收机,联合估计亚太赫兹OFDM系统中的频域信道与有效时域相位噪声,并在两个基准设置下报告了相比最佳学习基线的码块错误率降低。

cs.LG · eess.SP

查看原文摘要

Frequency-selective fading and oscillator phase noise (PN) jointly impair coded sub-THz OFDM reception. We propose a decoder-confidence-guided two-round receiver combining a {pilot-aware complex transformer} (PACT) estimator, banded linear minimum mean-square error equalization, and neural normalized min-sum decoding. PACT jointly estimates the frequency-domain channel and effective time-domain PN through interacting complex-valued branches. Decoder-derived pseudo-pilots and continuous constellation-aware confidence guide second-round refinement through PACT inputs and attention, with parameters shared across rounds. At $E_b/N_0=30$~dB, the PACT receiver achieves approximately $70\%$ and $57\%$ lower code-block error rates than the best-performing learning-based baseline in the two benchmark settings, respectively. Frozen-weight tests further demonstrate applicability across channel/PN models, carrier frequencies, and FFT/bandwidth configurations.

新论文 · v1arXiv:2611.18434

面向可解释睡眠分期分类的单通道脑电图研究

Towards Explainable Sleep Stage Classification using Single-Channel Electroencephalogram

Gurinder Kaur Sandhu, Jude Koenig, Ankita Shukla, Shruti Kshirsagar

AI 速读 基于摘要

该研究在单通道EEG上系统比较五种XAI归因方法,并以AASM频带为临床参照评估归因保真度,发现Integrated Gradients在Sleep-EDF与DREAMT上表现最佳。

cs.AI · eess.SP

查看原文摘要

Automated sleep staging has achieved strong bench- mark accuracy; however, clinical adoption remains limited due to a lack of interpretability. In this work, we fill the research gap by extending the SleepXAI sleep staging framework to systematically compare five different XAI methods. Further, attribution fidelity is evaluated using Spearman rank correlation with AASM-defined EEG frequency bands, serving as clinically grounded reference signals. In this paper, we focus on single- channel Electroencephalogram (EEG), which is more amenable to practical clinical deployment compared to full polysomnography setups. Experiments are conducted on the Sleep-EDF benchmark dataset and the DREAMT dataset. In DREAMT, we stratified subjects based on OSA into four Apnea-Hypopnea Index (AHI) severity groups. We observed that the SleepXAI model achieves strong classification performance on both datasets. Among the evaluated methods, Integrated Gradients (IG) consistently achieves the highest mean attribution fidelity across all five sleep stages on Sleep-EDF and across all AHI groups on DREAMT, outperforming all other evaluated methods under the Spearman rank correlation metric. These findings highlight the importance of attribution method selection as a key factor for ensuring reliable and clinically interpretable automated sleep staging systems.

版本更新 · v2arXiv:2610.05503

Lightweight Semantic EEG Foundation Model for Frozen Cross-Disorder Transfer

Rita Huan-Ting Peng, Nhat Bui

原文摘要

Large-scale EEG foundation models have demonstrated promising transferability across neurological disorders, but often require millions of parameters and substantial computational resources. In this paper, we present the Universal Semantic EEG Foundation Model (USE-FM), a lightweight EEG foundation model that learns transferable neural representations through self-supervised signal reconstruction on the Temple University Hospital EEG Corpus (TUEG). After pretraining, the encoder is frozen and evaluated on two clinically distinct downstream tasks, abnormal EEG detection (TUAB) and epileptic seizure recognition (TUEP), using a unified frozen-transfer protocol against recent EEG foundation models, including LUNA-Base and CBraMod. With only 1.46 million parameters, approximately one-fifth the size of existing models, USE-FM achieves competitive overall performance, including strong sensitivity and F1-score on TUEP (SEN $75.00 \pm 14.14$, F1 $70.37 \pm 4.01$), while maintaining competitive performance on TUAB (AUC $85.24 \pm 5.61$). Beyond downstream classification, latent representation analysis using $k$-means clustering together with PCA and t-SNE demonstrates that USE-FM learns organized semantic EEG representations comparable to substantially larger foundation models. These results suggest that large-scale self-supervised pretraining enables lightweight architectures to learn transferable semantic EEG representations, providing a computationally efficient foundation for cross-disorder analysis and future clinical decision support in neurological disorders.

cs.LG · eess.SP · q-bio.NC

新论文 · v1arXiv:2611.18181

Linear Dynamic Range Extension for Rydberg Atomic Receiver via Band-Limited Reconstruction

Meng Fang, Lebin Chen, Jun-Rong Chen, Ming-Min Zhao, Bin-Bin Wei

原文摘要

Rydberg-atom receiver offers a promising approach to radio-frequency (RF) signal reception in wireless communication and sensing systems, combining high sensitivity with the potential for broad frequency coverage. However, the limited linear dynamic range (LDR) of the atomic system causes nonlinear distortion at high input signal levels, thereby restricting the receiver's effective linear input range. To address this issue, we analyze the mechanisms underlying nonlinear distortion in Rydberg atomic receivers and propose a physics-informed band-limited iterative reconstruction (PI-BLIR) method. Specifically, by exploiting the known nonlinear atomic response and signal bandwidth prior, we formulate a constrained maximum-likelihood problem to reconstruct the distorted complex intermediate-frequency (IF) waveform. With the bandwidth constraint absorbed into the frequency-domain parameterization, the constrained maximum-likelihood problem is transformed into an unconstrained optimization problem, which is solved using gradient descent. The proposed method relies solely on digital post-processing and requires no changes to the local-oscillator (LO) field strength, optical parameters, or atomic operating conditions. Simulation results demonstrate that PI-BLIR extends the receiver's LDR by more than 14 dB and enhances the demodulation performance of the atomic receiver.

eess.SP · cs.IT

版本更新 · v2arXiv:2604.26741

Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning

Paul Zheng, Yao Zhu, Xiaopeng Yuan, Yulin Hu, Anke Schmeink

原文摘要

In next-generation wireless edge systems, efficient functionality integration is essential to address the growing demands of communication, computation, and sensing. Signal-level integrated sensing, computing, and communication (Sig-ISCC) is envisioned, where a single waveform simultaneously supports sensing, computing and communication via over-the-air computation (AirComp). Meanwhile, federated learning (FL) is widely regarded as a promising distributed machine learning framework that enables network intelligence in a privacy-preserving and secure manner, and exhibits strong synergy with AirComp, which alleviates the communication bottleneck of FL. In this paper, we study uplink Sig-ISCC design for AirComp-FL with joint target detection. We formulate the joint power and receive-scaling control problem, where edge devices' transmitted signals should serve both sensing and AirComp purposes. The goal is to minimize the AirComp aggregation distortion subject to a joint target-detection requirement. Although the resulting problem is non-convex in the original variables, we show that it admits an equivalent convex reformulation after a suitable variable transformation. By exploiting analytical optimality properties, we develop a robust, optimal, and polynomial-time-complexity algorithm that efficiently achieves the optimal transmit powers and receive scaling factor. Simulation results validate the optimality and numerical robustness of the proposed algorithm and show its superior FL performance compared to baseline methods.

cs.IT · eess.SP · math.OC

新论文 · v1arXiv:2611.17950

Toward Interference-Agnostic RF Source Separation

Maxence Albert, Raphaël Duroselle, Thibaud Ehret, Olivier Boeffard, Jean-François Bonastre

原文摘要

Separating a radio-frequency signal of interest from a co-channel interference is mostly addressed with specialized separators, each trained for one pair of signal and interference types and therefore relying on a label that a heavily jammed receiver cannot identify. We show that this reliance is not benign: applied to an interference it was not trained on, such a separator usually fails to recover the signal, and in most of the cases we measure it leaves the signal worse than no processing at all. We then train a single separator over every pair, giving it no indication at test time of which one it faces, on two architectures with no component in common: the convolutional WaveNet of the ICASSP 2024 RF Challenge, and a band-split transformer that we adapt from music source separation. Both behave the same way. At the size of one specialized model, the unified separator stays close to the whole models it replaces, keeping the bit error rate close on almost every pair, better on one and worse on another. On an interference absent from every training set, it does as well as the best specialized model, without anyone having to choose which one to deploy.

cs.AI · eess.SP

新论文 · v1arXiv:2611.17872

Protection-Oriented Assessment of Machine Learning-Based Fault Detection in Power Systems

Julian Oelhaf, Georg Kordowich, Changhun Kim, Christian Bergler, Andreas Maier, Johann Jäger, Siming Bayer

原文摘要

Machine learning (ML)-based fault detectors are increasingly proposed for power system protection, yet aggregate metrics can obscure the consequences of false and missed trips. We present a protection-oriented assessment of three ML detectors and a sequence-current reference on PROTECT-90, comprising 9,022 simulated fault episodes on a 90 kV double-circuit line. The assessment combines five window conditions, causal window-end labelling, episode-grouped cross-validation, and operating-point selection under a fixed security budget. It reports security, dependability, detection timing, decision margins, and episode-level nuisance assertions. Gradient-boosted trees, a convolutional neural network, and logistic regression achieve AUC-ROC values above 0.999, yet at a security budget of $10^{-3}$ their developed-fault missed-trip rates range from 0.007% to 1.99%. Post-clearing false-trip rates of approximately 0.12-0.16% per window coexist with nuisance assertions in 11.3-19.1% of episodes. Among the analysed physical descriptors, missed trips are most consistently associated with higher fault resistance within the sampled range. An analytical current proxy suggests a fault-current gradient only partly reproduced by waveform-derived current (rank correlation 0.62). No single topology state or faulted phase consistently dominates within the sampled domain. Because PROTECT-90 contains fault episodes only, security is assessed on pre-fault and post-clearing windows rather than independent non-fault disturbances.

cs.LG · eess.SP

版本更新 · v2arXiv:2603.20891

Auto-differentiable data assimilation: Co-learning of states, dynamics, and filtering algorithms

Melissa Adrian, Daniel Sanz-Alonso, Rebecca Willett

原文摘要

Data assimilation algorithms estimate the state of a dynamical system from partial observations, where the successful performance of these algorithms hinges on costly parameter tuning and on employing an accurate model for the dynamics. This paper introduces a framework for jointly learning the state, dynamics, and parameters of filtering algorithms in data assimilation through a process we refer to as auto-differentiable filtering. The framework leverages a theoretically motivated loss function that enables learning from partial, noisy observations via gradient-based optimization using auto-differentiation. We further demonstrate how several well-known data assimilation methods can be learned or tuned within this framework. To underscore the versatility of auto-differentiable filtering, we perform experiments on dynamical systems spanning multiple scientific domains, such as the Clohessy-Wiltshire equations from aerospace engineering, the Lorenz-96 system from atmospheric science, the generalized Lotka-Volterra equations from systems biology, and the two-layer quasi-geostrophic model from geophysical fluid dynamics. Finally, we provide guidelines for practitioners to customize our framework according to their observation model, accuracy requirements, and computational budget.

stat.ML · cs.LG · eess.SP · math.DS

新论文 · v1arXiv:2611.17723

uhd-rfsoc: Bringing Off-the-Shelf RFSoC Boards to Unmodified UHD Applications

Wei Cheng, Yiming Li, Junyao Zheng, Cheng-Bin Chen, Tingjun Chen

原文摘要

Next-generation wireless research relies on software-defined radios (SDRs) with more channels and larger bandwidth. The USRP family is one of the most widely used SDR platforms, and much of the wireless software ecosystem is built on top of the USRP hardware driver (UHD). However, each USRP model comes with a fixed channel count, bandwidth, and streaming capability. Off-the-shelf radio frequency system-on-chip (RFSoC) boards, on the other hand, integrate up to 16 analog-to-digital converters (ADCs) and 16 digital-to-analog converters (DACs) operating at several gigasamples per second (GS/s), but existing UHD applications cannot directly use them. We present uhd-rfsoc, an open-source FPGA design and host software stack that turns these boards, including the 16-channel ZCU216 and the RFSoC 4x2, into standard UHD devices without modifying UHD. Through standard UHD calls, applications can configure the carrier frequency, channel count, the per-channel I/Q sample rate, and the wire format. uhd-rfsoc combines timestamped, flow-controlled sample transport in the FPGA with data plane development kit (DPDK) packet processing and vectorized sample conversion on x86 and Arm hosts. The built bitstreams for a number of RFSoC board configurations with varying RF data converter rates, channel counts, I/Q sample rates, and wire formats all successfully pass UHD's built-in streaming benchmarks. We further demonstrate compatibility with unmodified GNU Radio flowgraphs, a custom GPU-accelerated transceiver digital signal processing pipeline, as well as the OCUDU and Duranta 5G radio access network stacks using both software and commodity user equipment.

cs.NI · cs.AR · eess.SP

版本更新 · v2arXiv:2610.03713

What Should World Models Forget? Stratified Retention for Continual Adaptation

Nishit Anand, Ramani Duraiswami, Dinesh Manocha

原文摘要

Continual learning treats any drop in performance on previously seen data as forgetting, a convention inherited from settings where the prediction target is stationary. World models violate this assumption: their target is the environment, which changes, so knowledge that was accurate when learned can later become false, and revising it is correct behavior rather than a defect. Non-stationary ground truth is well studied in the concept drift literature and in the temporal factuality of language models, but it has not been formulated for world models, which are distinctive in that they also encode structural knowledge, such as physical laws and object permanence, that must never be degraded. We argue that continual world models need retention stratified by invariance timescale, the time over which knowledge stays true: invariants should be refined but never degraded, while instance-level facts should be revised once the environment changes. We show that standard forgetting metrics, used alone, count correct revision as forgetting and so rank a frozen model highest. We propose differential retention, which reports two quantities separately: invariant retention, checked after every adaptation round, and revision latency, the number of observations a model needs to pick up a change.

cs.LG · cs.AI · cs.CV · eess.IV · eess.SP

版本更新 · v2arXiv:2610.10850

Similar Predictive Fit but Different Latent Dynamics: Characterizing Learned Dynamical Structure in Personalized Models of Brain Disorders

Rita Huan-Ting Peng, Nhat Bui

原文摘要

As AI models move toward clinical decision-making and personalized treatment, understanding \emph{what} a model learns is important beyond predictive accuracy alone. We investigate whether personalized latent dynamics reveal clinically associated differences even when predictive fit is similar. A lightweight CNN--Transformer EEG foundation model pretrained on the Temple University EEG Corpus (TUEG) extracts segment-level representations. Using the Temple University Epilepsy Corpus (TUEP), representations are mapped to a shared latent-state space, and sparse multinomial logistic transition distributions (mLTD) are fit independently to each subject to obtain personalized transition-dependency graphs $W_n$. Analyses include $n{=}198$ subjects (99 epilepsy / 99 non-epilepsy). At $k{=}4$, epilepsy subjects exhibit substantially denser learned dependency structure ($p{=}1.1\times10^{-7}$), with the same pattern at $k{=}6$ (19.90 vs. 13.46; $p{=}5.2\times10^{-5}$). Graph-derived features provide moderate group discrimination under 5-fold subject-wise cross-validation (AUROC 0.68 at $k{=}4$; 0.65 at $k{=}6$). In contrast, held-out log-likelihood is nearly identical between groups at $k{=}4$ ($-0.992$ vs. $-0.991$; $p{=}0.95$), with similarly matched next-state prediction (AUROC 0.855 vs. 0.861; $p{=}0.54$). Thus, similar predictive fit does not imply similar learned dynamics: groups can be comparably predictable while differing substantially in the internal dynamical structure learned by personalized models. This distinction motivates evaluating learned structure alongside predictive performance in personalized clinical models.

cs.LG · eess.SP · q-bio.NC

新论文 · v1arXiv:2611.17492

PF-Exec: Large-Scale UAV Relay Load Balancing with an Anchored Potential Direction Decider and a Per-Dimension Gain-Learning Executor

Liheng Zeng, Hanzhang Jia, Yiran Li, Yi Gao, Bo Ma

原文摘要

Relay load balancing in large-scale UAV networks requires joint decisions on association, bandwidth, power and hovering position, while the dimension grows with the number of UAVs and each UAV sees only its local state. This paper splits the decision into two layers. An anchored potential direction decider emits a closed-form target at every instant and returns its direction only. A gain-learning executor maps a local observation into a positive gain per dimension, composes gain and target, and clips the action against the physical single-step bound; the two layers form PF-Exec. The unit gain is the default start, so the executor reduces to the pure potential policy before training. The load is first-order homogeneous in bandwidth, making the bandwidth target closed form, and the position target is the demand-weighted centroid of the served users. The system uses a two-hop access and millimetre-wave backhaul link with soft association, a 3GPP UMa-AV channel with two shadowing layers, an OU-type social-force crowd and a quadrotor physical layer. Evaluation spans all fleet sizes, two crowd scenarios, independent seeds, the published baselines in their own settings and a degraded-information line. In the highest-pressure burst setting the fixed-step comparison breaks down on part of the seeds, losing fairness and mean load at once, while PF-Exec holds fairness near one. Among the ten comparison methods only the greedy heuristic survives that setting; its load variance stays far higher. Under stale global state and position noise the fairness index stays high at both largest-scale scenarios. Flight energy is nearly identical between the learned and the fixed-step executor, and three constants are fixed once across all settings. The convergence properties of both layers, from the truncated gain iteration to the perturbed tracking bound, are proved in the companion analysis.

cs.LG · cs.IT · eess.SP

新论文 · v1arXiv:2611.17488

Convergence Properties of PF-Exec: Homogeneous Structure, Anchored Closed Form, and Gain Dynamics

Hanzhang Jia, Liheng Zeng, Yiran Li, Yi Gao, Bo Ma

原文摘要

This paper establishes a layered mathematical char acterisation of PF-Exec, the algorithm of the companion system paper. Demand-proportional bandwidth allocation yields an exact first-order homogeneous decomposition, from which the equal-load bandwidth target and its feasibility bound follow in closed form. The logarithmic knee view preserves strict load order and shares its global optimum with the Jain fairness index, while the demand-weighted centroid minimises the position potential. The damped softmax association block possesses a fixed point on the product of simplices. The truncated one-dimensional gain iteration admits a complete characterisation, with geomet ric convergence below the critical gain, initial-value-dependent bounded oscillation at it, and a family of bounded two-state cycles above it. A global invariant error ball and an explicit tracking recursion complete the execution guarantee. A numerical audit confirms the structural identities on every measured state and quantifies the local amplification of the coupled association and resource dynamics. Together, the results explain how closed form recovery directions and bounded adaptive gains provide stable execution without requiring a global Euclidean contraction assumption.

math.OC · cs.LG · eess.SP

新论文 · v1arXiv:2611.17456

Physical-Risk-Aware Decentralized Agents for Constrained Vehicle Communications

Haoran Peng, William Weijia Zheng, Hang Liu, Ying-Jun Angela Zhang

原文摘要

Decentralized V2X resource control is challenging because each vehicle has only local observations, while reliability depends on network-wide interactions. We develop a physical-risk-aware spatio-temporal graph attention (PA-STGAT) framework for agentic V2X control. Each vehicle perceives its local interaction graph, retains short-term temporal context, and independently selects its PC5 resource and power. Network outcomes are used during centralized training to refine the shared policy. Transmitter-specific credits map reliability failures to individual vehicles. A dual-priced graph term further converts network violations into coordination signals for discrete resource selection, with higher priority on short time-to-collision links. Experiments show higher raw-policy reliability than the tested graph-based baselines. Under filtered execution, PA-STGAT meets the nominal empirical communication requirements across all five seeds, with tradeoffs among utility, delivery reliability, resource occupancy, and filter-induced repair. Compared with GNN+MATD3, it requires fewer resource repairs but achieves lower utility and mean delivery reliability. Mechanism ablations show that removing dual-priced graph coordination causes resource-selection collapse. Density and mobility tests characterize the operating limits of empirical constraint satisfaction.

eess.SP · cs.MA

新论文 · v1arXiv:2611.17059

容量受限延迟反馈下的在线保形风险控制

Capacity-Constrained Delayed Feedback for Online Conformal Risk Control

Bowen Wang, Osvaldo Simeone

AI 速读 基于摘要

针对反馈延迟且跟踪容量有限导致反馈丢失的场景,提出容量感知的在线保形风险控制框架 CA-OCRC,联合优化反馈跟踪分配与预测集构造。

cs.LG · eess.SP

查看原文摘要

Online conformal risk control (OCRC) enables reliable uncertainty quantification in machine learning by converting model outputs into prediction sets with long-term risk guarantees. These guarantees, however, hinge on the assumption that the loss of each round is revealed immediately and losslessly. In practice, feedback may be delayed, and limited resources may prevent tracking all pending predictions, causing some feedback to be lost. To address this challenge, we develop capacity-aware OCRC (CA-OCRC), a framework that jointly determines how to allocate limited tracking feedback capacity and how to construct prediction sets. CA-OCRC is based on a randomized tracking policy that samples a proxy delay to decide whether, and for how long, feedback for the current round is tracked. CA-OCRC updates the prediction sets via inverse probability weighting, compensating for the possibility of feedback lost due to delays and limited tracking capacity. We analyze risk bounds for both arbitrary and stochastic delays, revealing a trade-off between receiving more feedback and avoiding capacity saturation. Building on these bounds, we optimize the proxy delay distribution, showing scaling laws for the tracking capacity that ensure the same long-term risk as OCRC with unlimited feedback. Experiments on medical imaging, natural language processing, computer vision, and wireless communications show the effectiveness of CA-OCRC as compared to existing OCRC mechanisms.

新论文 · v1arXiv:2611.16789

ScrewSense: Mapping the Invisible - Anomaly Detection and Error Classification in Screwdriving Processes

Tobias Lettner, Tatyana Ivanovska, Anwar Al Assadi, Christian Bergler

原文摘要

The growing volume of process data generated by screwdriving systems, combined with advancements in computing power, data storage, and algorithms, is facilitating the application of artificial intelligence in this field. Accurately detecting and classifying screwdriving errors is crucial for ensuring product quality, avoiding costly rework in manufacturing, and supporting sustainability by facilitating the maintenance, reuse, and recycling of screw-connected products. In this context, machine learning approaches offer a promising alternative to traditional monitoring techniques, such as window-based methods or envelope curves. This study examines the use of deep learning techniques for anomaly detection and error classification in screwdriving processes. The data corpus consists of multivariate time series capturing process parameters, such as torque and rotation angle. For anomaly detection, the embedding space of a vector quantized variational autoencoder was analyzed. In terms of error classification, four different model architectures were evaluated. The results demonstrate the effectiveness of anomaly detection and confirm that deep learning models can distinguish between multiple error categories beyond traditional binary classification. This extends the capabilities of conventional monitoring approaches, achieving accuracies of up to 100%. Additionally, real-world data material was examined in order to further demonstrate model robustness. Overall the results indicate strong generalization capability and highlight the practical potential of the developed models for use in industrial screwdriving processes, eliminating the need for expert knowledge in error identification and significantly reducing manual effort and analysis time.

cs.LG · cs.RO · eess.SP

新论文 · v1arXiv:2611.16646

Measurement-Calibrated Synthetic Pretraining for Rapid Adaptation of UAV Channel Predictors

Qiuheng Zhou, Wei Jiang, Donglin Wang, Hans D. Schotten

原文摘要

Unmanned aerial vehicle (UAV) links can change faster than route-specific channel data can be collected, so a channel predictor must often be adapted from only a short target-flight calibration segment. This paper studies measurement-calibrated synthetic pretraining as an offline source prior for rapid adaptation of channel state information (CSI) predictors. The synthetic source is calibrated to flight-only power evolution, temporal shape variation, frequency selectivity, and phase disturbance, and is then combined with measured source-flight fine-tuning before target-flight adaptation. Under chronological held-out flight splits, synthetic-to-real (S2R) fine-tuning reduces the measured-data budget needed to reach useful prediction in the low-data regime. For 50 ms-ahead prediction, it crosses a latest-channel-estimate persistence baseline with 50 measured training windows, roughly 0.5 s of 10 ms-spaced supervised windows, whereas training from scratch requires 600 windows. A target-prefix adaptation study further shows that a lightweight gated recurrent unit predictor can reuse the pretrained source prior with one prediction-layer update epoch, positioning measurement-calibrated synthetic pretraining as a reusable prior for scarce target-flight measurements.

eess.SP · cs.LG

新论文 · v1arXiv:2611.16643

Optimized Mirabbasi-Martin Pulse Shaping Filter for Higher-Order Modulation in Zak-OTFS

Naveed Bin Nazir, Ananthanarayanan Chockalingam

原文摘要

The performance of Zak-OTFS modulation depends critically on the delay-Doppler (DD) domain pulse shaping filter, which must support both accurate channel estimation and reliable data detection. Filters reported in the Zak-OTFS literature fall short in bit error rate (BER) performance for higher-order modulation due to sensitivity to model-free channel estimation errors and pilot-data interference. Motivated by this, in this paper, we introduce a separable two-dimensional Mirabbasi-Martin (MM) filter for Zak-OTFS and propose a filter coefficient optimization framework that minimizes the aggregate sidelobe energy while preserving the compact structure of the MM prototype. By trading exact Nyquist nulls for high localization, the optimized MM filter exhibits no sidelobes with the narrowest $-40$ dB DD domain pulsewidth compared to sinc, Gaussian, and GS pulses. This compactness of the optimized filter tightly confines the pilot energy within the pilot region of the embedded frame, ensuring that the full response is captured for model-free channel estimation while significantly reducing pilot-data interference. This yields both an improved estimation performance and a significantly improved BER performance for higher-order QAM. For the proposed filter, we derive closed-form expressions for the effective DD domain channel and the covariance of the receive-filtered noise, which drastically reduce simulation run times. Our simulation results demonstrate that the optimized MM filter achieves significantly better uncoded/coded BER performance for higher-order QAM compared to that of sinc, Gaussian, and GS filters. For example, for 64-QAM with M=32, N=48, rate-1/2 convolutional code, and TDL-A channel model with fractional DDs, the optimized MM filter achieves a coded BER of 3x10^{-4} at an E_b/N_0 of 40 dB, while the sinc, Gaussian, and GS filters exhibit error floors above 10^{-2}.

cs.IT · eess.SP

新论文 · v1arXiv:2611.16609

A Dual-Branch Graph and Convolutional Network for Interpretable Movement EEG Classification

Maryam Ostadsharif Memar, Behzad Nazari

原文摘要

Decoding upper-limb movements from scalp electroencephalography (EEG) is an important problem for brain-computer interfaces (BCIs), but many deep learning models provide limited insight into the brain regions underlying their predictions. We propose a two-branch architecture that combines an LGGNet-inspired local-global graph branch with an EEGNet-style convolutional branch for movement-versus-rest classification. The graph branch groups 61 EEG electrodes into anatomically informed regions and learns their spatial relationships, providing a direct representation of the regions emphasized by the model. We evaluate the proposed architecture using leave-one-subject-out cross-validation on the Ofner upper-limb movement dataset. The model achieves a mean F1-score of 0.74 +/- 0.06 across subjects. Beyond classification performance, we analyze the learned graph structure to identify the regions with the strongest connectivity. Across all held-out subjects, the highest connectivity is consistently observed in the Parietal Left Low region, corresponding to electrodes P1 and P3. This region is opposite to the performed right-arm movements and lies within the posterior parietal area previously associated with upper-limb movement processing. These results show that incorporating a region-based graph into the decoder can provide an anatomically interpretable representation while maintaining effective movement classification, offering a practical approach toward more transparent EEG-based BCIs.

cs.AI · cs.HC · cs.LG · eess.SP

版本更新 · v2arXiv:2607.21426

Semantic-Aware Task Clustering for Constructive and Cooperative Multi-Tasking

Ahmad Halimi Razlighi, Maximilian H. V. Tillmann, Edgar Beck, Bho Matthiesen, Armin Dekorsy

原文摘要

Cooperative multi-task semantic communication (CMT-SemCom) improves task execution performance by leveraging shared representations. However, as we demonstrated in [1], cooperative multi-tasking can be either constructive or destructive, depending on the semantic relationships among tasks. To ensure constructive cooperation, we propose a semantic-aware task clustering method for CMT-SemCom. We have formulated a sequential multi-stage optimization problem in which semantically aligned tasks are clustered once after a short initial training phase, and then end-to-end (E2E) joint training is conducted exclusively within the discovered groups. Specifically, the problem decomposes into two stages: (i) a semantic clustering problem leveraging hierarchical density-based spatial clustering, and (ii) an intra-cluster E2E CMT-SemCom learning problem. Simulation results demonstrate that the proposed framework effectively mitigates destructive cooperation and negative transfer, yielding accuracy gains compared to unclustered multi-tasking and individual training baselines.

cs.LG · cs.IT · eess.SP · stat.ML

新论文 · v1arXiv:2611.16534

Context-Predictive Low-Rank Adaptation for Face Presentation Attack Detection

Aminu Yusuf, Shakeel Muhammad Ibrahim, Sulaimon Oyeniyi Adebayo, Muhammad Sohail Ibrahim, Muhammad Shahid Jabbar, Shujaat Khan

原文摘要

Face presentation attack detection requires representations that distinguish physical spoofing cues across changes in acquisition devices, subjects, and attack media. Large visual encoders offer transferable representations, but conventional binary fine-tuning supervises their final decisions without explicitly constraining how local facial evidence is represented under partial observation. We present CP-JEPA, a context-predictive adaptation framework that combines low-rank tuning of a pretrained CLIP image encoder with a joint-embedding predictive objective. A student predicts complete-image teacher features at masked spatial locations, while unmasked classification, masked classification, and prediction consistency retain the connection to the live/spoof task. An exponential-moving-average teacher supplies evolving latent targets. The auxiliary components are used only during training; inference requires only the LoRA-adapted CLIP visual encoder and binary classifier. {We evaluate CP-JEPA under single-source and multi-source OCIM transfer, additional CelebA-Spoof training, transfer to CelebA-Spoof, two-source training, and unseen-attack evaluation on SiW-Mv2.} On the standard OCIM benchmark, CP-JEPA achieves 3.74\% mean HTER and 98.73\% mean AUC. {Single-source evaluation achieves 11.36\% mean HTER across twelve source--target combinations.} With CelebA-Spoof added to the three OCIM training sources, CP-JEPA reduces mean HTER from 3.45\% to 2.35\% and increases mean AUC from 98.68\% to 99.32\%. On SiW-Mv2, it achieves 3.36\% mean HTER across the held-out attack categories. Controlled loss ablations examine the contributions of latent prediction, masked classification, and prediction consistency. The results show that context-predictive adaptation can improve cross-dataset PAD performance, although the gains vary with the training sources and evaluation setting.

cs.CV · eess.IV · eess.SP · stat.ML