15 accepted papers
The efficiency of Bayesian optimization (BO) relies heavily on the choice of the Gaussian process (GP) kernel, which plays a central role in balancing exploration and exploitation under limited evaluation budgets. Traditional BO methods often rely on fixed or heuristic kernel selection strategies, w…
A fundamental problem in cognitive radio is spectrum sensing, which detects the presence of the primary users in a licensed spectrum. To boost the detection performance and robustness, the multiantenna detector has been investigated and various related methods have been developed, e.g., the energy d…
In this work, we propose a Multi-Window Masked Autoencoder (MW-MAE) fitted with a novel Multi-Window Multi-Head Attention (MW-MHA) module that facilitates the modelling of local-global interactions in every decoder transformer block through attention heads of several distinct local and global window…
The Gaussian process state-space model (GPSSM) has attracted extensive attention for modeling complex nonlinear dynamical systems. However, the existing GPSSM employs separate Gaussian processes (GPs) for each latent state dimension, leading to escalating computational complexity and parameter proli…
Extracting information from fMRI data constitutes a broad active area of research. Current techniques still present several limitations; some ignore relevant aspects regarding the brain functioning or lack of interpretability. In an effort to overcome such limitations, we introduce an extension of t…
Variational autoencoders (VAE) are one of the most prominent deep generative models for learning the underlying statistical distribution of high-dimensional data. However, training VAEs suffers from a severe issue called posterior collapse; that is, the learned posterior distribution collapses to th…
Transfer entropy can to a certain degree assess the direction in addition to the strength of the couplings within dynamic time series. The greater the transfer entropy, the greater the strength of the dependency between time series. In this work, we are interested in quantifying the effect that a gi…
This work addresses adversarial robustness in deep learning by considering deep networks with stochastic local winner-takes-all (LWTA) activations. This type of network units result in sparse representations from each model layer, as the units are organized in blocks where only one unit generates a…
We propose a novel Gaussian process kernel that takes advantage of a deep neural network (DNN) structure but retains good interpretability. The resulting kernel is capable of addressing four major issues of the previous works of similar art, i.e., the optimality, explainability, model complexity, an…
The aim of this work is to enable inference of deep networks that retain high accuracy for the least possible model complexity, with the latter deduced from the data during inference. To this end, we revisit deep networks that comprise competing linear units, as opposed to nonlinear units that do no…
Extracting information from functional magnetic resonance images (fMRI) has been a major area of research for more than two decades. The goal of this work is to present a new method for the analysis of fMRI data sets, that is capable to incorporate a priori available information, via an efficient op…
This paper proposes a novel algorithm for online distributed dictionary learning, where a set of nodes is requested to collectively estimate a common dictionary via sequentially received data vectors. At each time instance, in which a new datum becomes available, the sparse representation of the dat…
A novel algorithm for distributed labeling of speech sources is proposed. We consider a wireless sensor network comprising devices that are equipped with multiple microphones, which can “hear” a number of speech signals. The labeling task is performed in a decentralized fashion with a new two-step a…
A promising approach when dealing with massive data sets is to apply randomized dimensionality reduction and then operate in lower dimensions. This paper deals with the randomized linear regression task in the case where the available data are sporadically corrupted. Instead of relying to minimizati…
This paper presents pattern classification to a predefined set of classes as a missing data task. This is achieved by first augmenting the feature vector of each training pattern with the corresponding binary codeword representing its class. A Restricted Boltzmann Machine (RBM) or a Dictionary Learn…