← Search

Konstantinos Slavakis

9 accepted papers

2024

Multi-Linear Kernel Regression and Imputation VIA Manifold Learning: the Dynamic MRI Case

ICASSP 2024accepted

This paper introduces an efficient multi-linear nonparametric (kernel-based) approximation framework for data regression and imputation. Data features are assumed to reside in or close to a smooth and userunknown manifold embedded in a reproducing kernel Hilbert space. Landmark points are identified…

Cited by 0SourceScholar
2024

Proximal Bellman Mappings for Reinforcement Learning and Their Application to Robust Adaptive Filtering

ICASSP 2024accepted

This paper aims at the algorithmic/theoretical core of reinforcement learning (RL) by introducing the novel class of proximal Bellman mappings. These mappings are defined in reproducing kernel Hilbert spaces (RKHSs), to benefit from the rich approximation properties and inner product of RKHSs, they…

Cited by 0SourceScholar
2023

Dynamic Selection of p-norm in Linear Adaptive Filtering via online Kernel-based Reinforcement Learning

ICASSP 2023accepted

This study addresses the problem of selecting dynamically, at each time instance, the "optimal" p-norm to combat outliers in linear adaptive filtering without any knowledge on the potentially time-varying probability density function of the outliers. To this end, an online and data-driven framework…

Cited by 0SourceScholar
2021

Online Classification of Dynamic Multilayer-Network Time Series in Riemannian Manifolds

ICASSP 2021accepted

This work exploits Riemannian manifolds to introduce a geometric framework for online state and community classification in dynamic multilayer networks where nodes are annotated with time series. A bottom-up approach is followed, starting from the extraction of Riemannian features from nodal time se…

Cited by 0SourceScholar
2021

Outlier-Robust Kernel Hierarchical-Optimization RLS on a Budget with Affine Constraints

ICASSP 2021accepted

This paper introduces a non-parametric learning framework to combat outliers in online, multi-output, and nonlinear regression tasks. A hierarchical-optimization problem underpins the learning task: Search in a reproducing kernel Hilbert space (RKHS) for a function that minimizes a sample average ℓ…

Cited by 0SourceScholar
2018

Fast Projection-Based Solvers for the Non-Convex Quadratically Constrained Feasibility Problem

ICASSP 2018accepted

Quadratically constrained quadratic programming (QCQP) forms an important class of optimization tasks in various engineering disciplines. Fast identification of a feasible point under low computational complexity load is critical for several approximation techniques which have been developed to solv…

Cited by 0SourceScholar
2017

Accelerating the hybrid steepest descent method for affinely constrained convex composite minimization tasks

ICASSP 2017accepted

The hybrid steepest descent method (HSDM) [Yamada, '01] was introduced as a low-computational complexity tool for solving convex variational-inequality problems over the fixed-point set of non-expansive mappings in Hilbert spaces. Motivated by results on decentralized optimization, this study introd…

Cited by 1SourceScholar
2016

Multi-kernel based nonlinear models for connectivity identification of brain networks

ICASSP 2016accepted

Partial correlations (PCs) of functional magnetic resonance imaging (fMRI) time series play a principal role in revealing connectivity of brain networks. To explore nonlinear behavior of the blood-oxygen-level dependent signal, the present work postulates a kernel-based nonlinear connectivity model…

Cited by 0SourceScholar