Search Results for author:
Found 15 papers, 1 papers with code
Mitigating Data Injection Attacks on Federated Learning
However, despite its advantages, federated learning can be susceptible to false data injection attacks.
Fair Multi-Agent Bandits
This significantly improves previous results which had the same upper bound on the regret of order $O(f(\log T) \log T )$ but an exponential dependence on the number of agents.
Communication Efficient Distributed Learning over Wireless Channels
Vertical distributed learning exploits the local features collected by multiple learning workers to form a better global model.
Medium Access Control protocol for Collaborative Spectrum Learning in Wireless Networks
Based on the algorithm we provide a medium access control protocol which allows distributed implementation of the algorithm in ad-hoc networks.
Distributed Deep Reinforcement Learning for Collaborative Spectrum Sharing
In this paper, we combine game-theoretic insights with deep Q-learning to provide a novel asymptotically optimal solution to the spectrum collaboration problem.
Multi-Gigabit Wireline Systems over Copper: An Interference Cancellation Perspective
Interference cancellation is the main driving technology in enhancing the transmission rates over telephone lines above 100 Mbps.
Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game
We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network.
The Restless Hidden Markov Bandit with Linear Rewards and Side Information
Furthermore, we assume structural side information where the decision maker knows in advance that there are two types of hidden states; one is common to all arms and evolves according to a Markovian distribution, and the other is unique to each arm and is distributed according to an i. i. d.
Distributed Learning for Channel Allocation Over a Shared Spectrum
When the CSI is time varying and unknown to the users, the users face the challenge of both learning the channel statistics online and converge to a good channel allocation.
Distributed Multi-Player Bandits - a Game of Thrones Approach
Each player has different expected rewards for the arms, and the instantaneous rewards are independent and identically distributed.
Decentralized Caching for Content Delivery Based on Blockchain: A Game Theoretic Perspective
In this paper, we propose a decentralized framework of proactive caching in a hierarchical wireless network based on blockchains.
Networking and Internet Architecture
RIDS: Robust Identification of Sparse Gene Regulatory Networks from Perturbation Experiments
To overcome this challenge, we develop the Robust IDentification of Sparse networks (RIDS) method that reconstructs the GRN from a small number of perturbation experiments.
Active Sensing of Social Networks
The model used for the regression is based on the steady state equation in the linear DeGroot model under the influence of stubborn agents, i. e., agents whose opinions are not influenced by their neighbors.
Algorithms for Linear Bandits on Polyhedral Sets
We then provide a nearly optimal algorithm and show that its expected regret scales as $O(N\log^{1+\epsilon}(T))$ for an arbitrary small $\epsilon >0$.
A Gaussian Tree Approximation for Integer Least-Squares
The factor graph that corresponds to this problem is very loopy; in fact, it is a complete graph.
