• DocumentCode
    3434584
  • Title

    Distributed learning from social sampling

  • Author

    Sarwate, Anand D. ; Javidi, Tara

  • Author_Institution
    Toyta Technol. Inst. at Chicago, Chicago, IL, USA
  • fYear
    2012
  • fDate
    21-23 March 2012
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    We describe a general set of protocols for distributed estimation of distributions in a network. This work falls in the framework of consensus or gossip algorithms - individuals have local observations of a global phenomenon and wish to estimate a global quantity through synchronous (consensus) or asynchronous (gossip) protocols. Our approach departs from consensus-based models of communication by using a message model based on the exchange of randomly selected messages. In most cases these messages are much simpler to transmit than the full state information required by a consensus protocols. In other words, agents collect information and form beliefs via sampling: agents take local (noisy) samples of the global phenomenon of interest and social samples from the belief neighbors in the network. We propose an appropriate analytic framework and provide examples to demonstrate how social sampling can enable social learning.
  • Keywords
    distributed processing; learning (artificial intelligence); belief neighbors; consensus algorithms; consensus protocols; consensus-based models; distributed estimation; distributed learning; gossip algorithms; social learning; social sampling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems (CISS), 2012 46th Annual Conference on
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4673-3139-5
  • Electronic_ISBN
    978-1-4673-3138-8
  • Type

    conf

  • DOI
    10.1109/CISS.2012.6310767
  • Filename
    6310767