Search Results for author:
Found 6 papers, 1 papers with code
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs
Specifically, we assume there is a local reward for each hyperedge, and the reward of the joint arm is the sum of these local rewards.
Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication
Based on the actions selected by all players, the team of players receives a reward.
Bode Integral Limitation For Irrational Systems
Bode integrals of sensitivity and sensitivity-like functions along with complementary sensitivity and complementary sensitivity-like functions are conventionally used for describing performance limitations of a feedback control system.
Approximation Capabilities of Neural Networks using Morphological Perceptrons and Generalizations
Furthermore, we consider proposed signed-max-sum and max-star-sum generalizations of morphological ANNs and show that these variants also do not have universal approximation capabilities.
Online Learning for Cooperative Multi-Player Multi-Armed Bandits
For the first setting, we propose a UCB-inspired algorithm that achieves $O(\log T)$ regret whether the rewards are IID or Markovian.
Toward Automatic Threat Recognition for Airport X-ray Baggage Screening with Deep Convolutional Object Detection
We show performance of our models on held-out evaluation sets, analyze several design parameters, and demonstrate the potential of such systems for automated detection of threats that can be found in airports.
