Non-Bayesian social learning with observation reuse and soft switching
We propose a non-Bayesian social learning update rule for agents in a network, which minimizes the sum of the Kullback-Leibler divergence between the true distribution generating the agents’ local observations and the agents’ beliefs (parameterized by a hypothesis set), and a weighted varentropy-rel...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/102641 http://hdl.handle.net/10220/48151 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-102641 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1026412020-03-07T14:00:34Z Non-Bayesian social learning with observation reuse and soft switching Md. Zulfiquar Ali Bhotto Tay, Wee Peng School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering Non-Bayesian Social Learning Misinforming Agent We propose a non-Bayesian social learning update rule for agents in a network, which minimizes the sum of the Kullback-Leibler divergence between the true distribution generating the agents’ local observations and the agents’ beliefs (parameterized by a hypothesis set), and a weighted varentropy-related term. The varentropy-related term allows us to control the rate of convergence of our update rule, which also reuses some of the most recent observations of each agent to speed up convergence. Under mild technical conditions, we show that the belief of each agent concentrates on the optimal hypothesis set, and we derive a bound for the convergence rate. Furthermore, to overcome the performance degradation due to misinforming agents, who use a corrupted likelihood functions in their belief updates, we propose to use multiple social networks that update their beliefs independently and a convex combination mechanism among the beliefs of all the networks. Simulations with applications to location identification and group recommendation demonstrate that our proposed methods offer improvements over two other current state-of-the art non-Bayesian social learning algorithms. MOE (Min. of Education, S’pore) EDB (Economic Devt. Board, S’pore) Accepted version 2019-05-10T03:37:11Z 2019-12-06T20:58:06Z 2019-05-10T03:37:11Z 2019-12-06T20:58:06Z 2018 Journal Article Md. Zulfiquar Ali Bhotto., & Tay, W. P. (2018). Non-Bayesian social learning with observation reuse and soft switching. ACM Transactions on Sensor Networks, 14(2), 14-. doi:10.1145/3199513 1550-4859 https://hdl.handle.net/10356/102641 http://hdl.handle.net/10220/48151 10.1145/3199513 en ACM Transactions on Sensor Networks © 2018 ACM. All rights reserved. This paper was published in ACM Transactions on Sensor Networks and is made available with permission of ACM. 21 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Electrical and electronic engineering Non-Bayesian Social Learning Misinforming Agent |
spellingShingle |
DRNTU::Engineering::Electrical and electronic engineering Non-Bayesian Social Learning Misinforming Agent Md. Zulfiquar Ali Bhotto Tay, Wee Peng Non-Bayesian social learning with observation reuse and soft switching |
description |
We propose a non-Bayesian social learning update rule for agents in a network, which minimizes the sum of the Kullback-Leibler divergence between the true distribution generating the agents’ local observations and the agents’ beliefs (parameterized by a hypothesis set), and a weighted varentropy-related term. The varentropy-related term allows us to control the rate of convergence of our update rule, which also reuses some of the most recent observations of each agent to speed up convergence. Under mild technical conditions, we show that the belief of each agent concentrates on the optimal hypothesis set, and we derive a bound for the convergence rate. Furthermore, to overcome the performance degradation due to misinforming agents, who use a corrupted likelihood functions in their belief updates, we propose to use multiple social networks that update their beliefs independently and a convex combination mechanism among the beliefs of all the networks. Simulations with applications to location identification and group recommendation demonstrate that our proposed methods offer improvements over two other current state-of-the art non-Bayesian social learning algorithms. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Md. Zulfiquar Ali Bhotto Tay, Wee Peng |
format |
Article |
author |
Md. Zulfiquar Ali Bhotto Tay, Wee Peng |
author_sort |
Md. Zulfiquar Ali Bhotto |
title |
Non-Bayesian social learning with observation reuse and soft switching |
title_short |
Non-Bayesian social learning with observation reuse and soft switching |
title_full |
Non-Bayesian social learning with observation reuse and soft switching |
title_fullStr |
Non-Bayesian social learning with observation reuse and soft switching |
title_full_unstemmed |
Non-Bayesian social learning with observation reuse and soft switching |
title_sort |
non-bayesian social learning with observation reuse and soft switching |
publishDate |
2019 |
url |
https://hdl.handle.net/10356/102641 http://hdl.handle.net/10220/48151 |
_version_ |
1681045414688587776 |