<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (mraginsky)</title>
    <link>https://pinboard.in/u:mraginsky/public/</link>
    <description>recent bookmarks from mraginsky</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://arxiv.org/abs/1404.0145"/>
	<rdf:li rdf:resource="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5876302"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1107.2526"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1105.4765"/>
	<rdf:li rdf:resource="http://economics.sas.upenn.edu/system/files/10-005.pdf"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1007.3706"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1005.2012"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0907.0748"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://arxiv.org/abs/1404.0145">
    <title>[1404.0145] Distributed Nonlinear Consensus in the Space of Probability Measures</title>
    <dc:date>2014-04-02T02:04:36+00:00</dc:date>
    <link>http://arxiv.org/abs/1404.0145</link>
    <dc:creator>mraginsky</dc:creator><description><![CDATA[Distributed consensus in the Wasserstein metric space of probability measures is introduced for the first time in this work. It is shown that convergence of the individual agents' measures to a common measure value is guaranteed so long as a weak network connectivity condition is satisfied asymptotically. The common measure achieved asymptotically at each agent is the one closest simultaneously to all initial agent measures in the sense that it minimises a weighted sum of Wasserstein distances between it and all the initial measures. This algorithm has applicability in the field of distributed estimation.]]></description>
<dc:subject>papers to-read consensus-algorithms optimal-transportation distributed-systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:mraginsky/b:99635bd4077a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimal-transportation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:distributed-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5876302">
    <title>IEEE Xplore - A Lower Bound for Distributed Averaging Algorithms on the Line Graph</title>
    <dc:date>2011-11-01T19:06:22+00:00</dc:date>
    <link>http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5876302</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read control-theory dynamical-systems distributed-computing consensus-algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:576b4219b4e4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:distributed-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1107.2526">
    <title>[1107.2526] On the Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm</title>
    <dc:date>2011-07-14T01:50:40+00:00</dc:date>
    <link>http://arxiv.org/abs/1107.2526</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read distributed-systems optimization consensus-algorithms</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:3de91ad48393/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:distributed-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1105.4765">
    <title>[1105.4765] From Agreement to Asymptotic Learning</title>
    <dc:date>2011-05-25T01:07:28+00:00</dc:date>
    <link>http://arxiv.org/abs/1105.4765</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read bayesian-learning consensus-algorithms social-networks multiagent-systems</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:49a8c6ad1be5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:bayesian-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:social-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:multiagent-systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://economics.sas.upenn.edu/system/files/10-005.pdf">
    <title>&quot;Non-Bayesian social learning&quot; (Jadbabaie et al.)</title>
    <dc:date>2011-02-12T01:27:59+00:00</dc:date>
    <link>http://economics.sas.upenn.edu/system/files/10-005.pdf</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read social-networks multiagent-systems consensus-algorithms decision-making filetype:pdf media:document</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:89af7b174dc3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:social-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:multiagent-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:decision-making"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:filetype:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:media:document"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1007.3706">
    <title>[1007.3706] Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication</title>
    <dc:date>2010-07-22T00:44:39+00:00</dc:date>
    <link>http://arxiv.org/abs/1007.3706</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read optimization distributed-computing consensus-algorithms re:distributed_decisions_project</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:38ce71440690/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:distributed-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:re:distributed_decisions_project"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1005.2012">
    <title>[1005.2012] Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling</title>
    <dc:date>2010-05-19T14:03:12+00:00</dc:date>
    <link>http://arxiv.org/abs/1005.2012</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>papers to-read optimization distributed-computing consensus-algorithms re:distributed_decisions_project</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:8f810ee1a3dc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:distributed-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:re:distributed_decisions_project"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0907.0748">
    <title>[0907.0748] Gossip consensus algorithms via quantized communication</title>
    <dc:date>2010-01-21T02:25:49+00:00</dc:date>
    <link>http://arxiv.org/abs/0907.0748</link>
    <dc:creator>mraginsky</dc:creator><dc:subject>to-read papers control-theory consensus-algorithms decision-making</dc:subject>
<dc:identifier>https://pinboard.in/u:mraginsky/b:31bf901940cd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:to-read"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:consensus-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:mraginsky/t:decision-making"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>