Sorry, you need to enable JavaScript to visit this website.

This paper considers a decentralized projection free algorithm for non-convex optimization in high dimension. More specifically, we propose a Decentralized Frank-Wolfe (DeFW)
algorithm which is suitable when high dimensional optimization constraints are difficult to handle by conventional projection/proximal-based gradient descent methods. We present conditions under which the DeFW algorithm converges to a stationary point and prove that the rate of convergence is as fast as ${\cal O}( 1/\sqrt{T} )$, where

Categories:
9 Views

This paper focuses on the problem of distributed sequence
prediction in a network of sparsely interconnected agents,
where agents collaborate to achieve provably reasonable
predictive performance. An expert assisted online learning
algorithm in a distributed setup of the consensus+innovations
form is proposed, in which the agents update their weights
for the experts’ predictions by simultaneously processing the
latest network losses (innovations) and the cumulative losses
obtained from neighboring agents (consensus). This paper

Categories:
2 Views

We formulate and study a multi-user multi-armed bandit (MAB) problem that exploits the temporal-spatial reuse of primary user (PU) channels so that secondary users (SUs) who do not interfere with each other can make use of the same PU channel. We first propose a centralized channel allocation policy that has logarithmic regret, but requires a central processor to solve a NP-complete optimization problem at exponentially increasing time intervals.

Categories:
13 Views

Broad areal coverage and low cost make wireless sensor networks natural platforms for blind source separation (BSS). In this context, distributed processing is attractive because of low power requirements and scalability. However, existing distributed BSS algorithms either require a fully connected pattern of connectivity or require a high computational load at each sensor node. We introduce a distributed robust BSS algorithm that uses a fully shared computation and can be applied over any connected graph.

Categories:
3 Views

Pages