Search arXiv⌕ Search

arXiv · 2610.05339

Nonlinear Tensor Decomposition for Pattern Discovery

Abstract

The CANDECOMP/PARAFAC (CP) decomposition is widely used for revealing the underlying patterns from multiway data (also referred to as a higher-order tensor). When the data is clipped or saturated, however, the linear CP model becomes unreliable. Several remedies exist such as treating the clipped entries as missing or imputation; however, both fall short in different scenarios. We propose a nonlinear CP model (NCP) for pattern discovery in this setting, extending ideas from nonlinear matrix decompositions to tensors, and solve it using a flexible ADMM (Alternating Direction Method of Multipliers)-based framework that can accommodate a variety of nonlinearities. Using synthetic data with known factors and simulated metabolomics data where clipping arises from instrument detection limits, we demonstrate that NCP recovers the underlying factors more accurately than CP fitted to only the observed entries or threshold-imputed data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Atharva Awari, Geert Roelof van der Ploeg, Arnaud Vandaele, Nicolas Gillis, Evrim Acar. 2026-10-04. Nonlinear Tensor Decomposition for Pattern Discovery. https://arxiv.org/abs/2610.05339

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Resource-Efficient Wi-Fi CSI-Based Sensing via Exploiting the Age of Samples

Wi-Fi channel state information (CSI)-based sensing must coexist with data communications, limiting the availability of temporally-dense CSI measurements. We formulate CSI-based human activity and identity recognition under an average sensing budget that limits the fraction of CSI measurement and reporting opportunities within a sensing session. The budget captures sensing-communication resource sharing, packet loss, and traffic-induced irregularity, which we model using deterministic (accumulated) and stochastic (Bernoulli) sampling policies. We propose a low-cost, age-aware WiFi sensing framework that encodes the age of each retained CSI sample and multiplicatively fuses it with the CSI embedding. On the NTU-Fi human activity recognition and person identification datasets, the proposed model outperforms both a CSI-only baseline and the time-aware attention model of the UniFi benchmark across most operating regimes. For person identification, it improves over UniFi by more than 10 percentage points, with the largest gains under strict sensing budgets.

eess.SP↗

Graph Learning for Cross-Subject, Cross-Population EEG Emotion Decoding and Model-Derived Spatial-Spectral Neural Signatures

Cross subject emotion decoding from electroencephalography EEG requires representations that accommodate individual variability while preserving spatial spectral structure for interpretation. This study introduces EmoDiPyraTrans, a differential graph Transformer that integrates adaptive graph recurrence, differential attention, pyramid fusion and distribution regularization over sequential relative power spectral density graphs. Across SEED, FACED, MAHNOB HCI, DEAP and DREAMER, the model achieved the highest participant mean accuracy and positive class F1 among the evaluated methods, with accuracy and F1 both reaching 0.928 on SEED. On DEP EEG, positive versus neutral accuracy reached 0.802 within healthy controls and 0.704 within participants with depression, compared with 0.591 under healthy to depression transfer and 0.581 with mixed population development. Complementary SEED analyses identified distributed spatial weighting and an alpha centred spectral preference, while configurations averaging six channels retained near full performance. These findings link generalization assessment with model derived candidate signatures to support interpretable EEG emotion decoding, with code available at https://github.com/hdy6438/EmoDiPyraTrans.

eess.SP↗