Defending non-Bayesian learning against adversarial attacks
From MaRDI portal
Publication:2318111
DOI10.1007/s00446-018-0336-4zbMath1451.68054arXiv1606.08883OpenAlexW2962743217WikidataQ129651836 ScholiaQ129651836MaRDI QIDQ2318111
Publication date: 13 August 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.08883
Learning and adaptive systems in artificial intelligence (68T05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Computer security (68M25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-Bayesian social learning
- Some variations on Tverberg's theorem
- Decentralized detection by a large number of sensors
- Bayesian learning in social networks.
- Non-Bayesian learning in the presence of Byzantine agents
- Reaching approximate Byzantine consensus with multi-hop communication
- Iterative approximate byzantine consensus in arbitrary directed graphs
- Distributed Detection: Finite-Time Analysis and Impact of Network Topology
- Belief Consensus and Distributed Hypothesis Testing in Sensor Networks
- Reaching approximate agreement in the presence of faults
- Reaching Agreement in the Presence of Faults
- Distributed Detection Over Adaptive Networks Using Diffusion Adaptation
- Distributed Detection Over Noisy Networks: Large Deviations Analysis
- Large Deviations Performance of Consensus+Innovations Distributed Detection With Non-Gaussian Observations
- A Theory of Non-Bayesian Social Learning
- Social Learning and Distributed Hypothesis Testing
- Byzantine vector consensus in complete graphs
- Multidimensional approximate agreement in Byzantine asynchronous systems
- Products of Indecomposable, Aperiodic, Stochastic Matrices
This page was built for publication: Defending non-Bayesian learning against adversarial attacks
