Adaptive networks
AH Sayed - Proceedings of the IEEE, 2014 - ieeexplore.ieee.org
This paper surveys recent advances related to adaptation, learning, and optimization over
networks. Various distributed strategies are discussed that enable a collection of networked …
networks. Various distributed strategies are discussed that enable a collection of networked …
Adaptation, learning, and optimization over networks
AH Sayed - Foundations and Trends® in Machine Learning, 2014 - nowpublishers.com
This work deals with the topic of information processing over graphs. The presentation is
largely self-contained and covers results that relate to the analysis and design of multi-agent …
largely self-contained and covers results that relate to the analysis and design of multi-agent …
Distributed constrained optimization by consensus-based primal-dual perturbation method
Various distributed optimization methods have been developed for solving problems which
have simple local constraint sets and whose objective function is the sum of local cost …
have simple local constraint sets and whose objective function is the sum of local cost …
Adaptive learning in a world of projections
S Theodoridis, K Slavakis… - IEEE Signal Processing …, 2010 - ieeexplore.ieee.org
This article presents a general tool for convexly constrained parameter/function estimation
both for classification and regression tasks, in a timeadaptive setting and in (infinite …
both for classification and regression tasks, in a timeadaptive setting and in (infinite …
Adaptive robust distributed learning in diffusion sensor networks
S Chouvardas, K Slavakis… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
In this paper, the problem of adaptive distributed learning in diffusion networks is
considered. The algorithms are developed within the convex set theoretic framework. More …
considered. The algorithms are developed within the convex set theoretic framework. More …
Differentially private distributed online algorithms over time-varying directed networks
We consider a private distributed online optimization problem where a set of agents aim to
minimize the sum of locally convex cost functions while each desires that the local cost …
minimize the sum of locally convex cost functions while each desires that the local cost …
Online distributed learning over networks in RKH spaces using random Fourier features
P Bouboulis, S Chouvardas… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
We present a novel diffusion scheme for online kernel-based learning over networks. So far,
a major drawback of any online learning algorithm, operating in a reproducing kernel Hilbert …
a major drawback of any online learning algorithm, operating in a reproducing kernel Hilbert …
Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
I Yamada, M Yukawa, M Yamagishi - … for Inverse Problems in Science and …, 2011 - Springer
The first aim of this paper is to present a useful toolbox of quasi-nonexpansive mappings for
convex optimization from the viewpoint of using their fixed point sets as constraints. Many …
convex optimization from the viewpoint of using their fixed point sets as constraints. Many …
A sparsity promoting adaptive algorithm for distributed learning
In this paper, a sparsity promoting adaptive algorithm for distributed learning in diffusion
networks is developed. The algorithm follows the set-theoretic estimation rationale. At each …
networks is developed. The algorithm follows the set-theoretic estimation rationale. At each …
Cues paired with a low dose of alcohol acquire conditioned incentive properties in social drinkers
M Field, T Duka - Psychopharmacology, 2002 - Springer
Rationale: Drug-related cues may acquire incentive properties through classical
conditioning. Objective: The present study investigated whether arbitrary stimuli paired with …
conditioning. Objective: The present study investigated whether arbitrary stimuli paired with …