<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://proceedings.mlr.press/r9/feed.xml" rel="self" type="application/atom+xml" /><link href="https://proceedings.mlr.press/r9/" rel="alternate" type="text/html" /><updated>2026-10-04T22:49:02+00:00</updated><id>https://proceedings.mlr.press/r9/feed.xml</id><title type="html">Proceedings of Machine Learning Research</title><subtitle>Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence
  Held in Barcelona, Spain on 14-17 July 2011

Published as Reissue 9 by the Proceedings of Machine Learning Research on 04 October 2026.

Volume Edited by:
  Fabio Cozman
  Avi Pfeffer

Series Editors:
  Tegan Emerson
  Hoel Kervadec
  Neil D. Lawrence
</subtitle><author><name>PMLR</name></author><entry><title type="html">Graphical Models for Bandit Problems</title><link href="https://proceedings.mlr.press/r9/amin11a.html" rel="alternate" type="text/html" title="Graphical Models for Bandit Problems" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/amin11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/amin11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Kareem&quot;, &quot;family&quot;=&gt;&quot;Amin&quot;}, {&quot;given&quot;=&gt;&quot;Michael&quot;, &quot;family&quot;=&gt;&quot;Kearns&quot;}, {&quot;given&quot;=&gt;&quot;Umar&quot;, &quot;family&quot;=&gt;&quot;Syed&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Extended Lifted Inference with Joint Formulas</title><link href="https://proceedings.mlr.press/r9/apsel11a.html" rel="alternate" type="text/html" title="Extended Lifted Inference with Joint Formulas" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/apsel11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/apsel11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Udi&quot;, &quot;family&quot;=&gt;&quot;Apsel&quot;}, {&quot;given&quot;=&gt;&quot;Ronen I.&quot;, &quot;family&quot;=&gt;&quot;Brafman&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Learning is planning: near Bayes-optimal reinforcement learning via Monte-Carlo tree search</title><link href="https://proceedings.mlr.press/r9/asmuth11a.html" rel="alternate" type="text/html" title="Learning is planning: near Bayes-optimal reinforcement learning via Monte-Carlo tree search" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/asmuth11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/asmuth11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;John&quot;, &quot;family&quot;=&gt;&quot;Asmuth&quot;}, {&quot;given&quot;=&gt;&quot;Michael L.&quot;, &quot;family&quot;=&gt;&quot;Littman&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Fractional Moments on Bandit Problems</title><link href="https://proceedings.mlr.press/r9/b11a.html" rel="alternate" type="text/html" title="Fractional Moments on Bandit Problems" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/b11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/b11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Ananda Narayanan&quot;, &quot;family&quot;=&gt;&quot;B&quot;}, {&quot;given&quot;=&gt;&quot;Balaraman&quot;, &quot;family&quot;=&gt;&quot;Ravindran&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Solving Cooperative Reliability Games</title><link href="https://proceedings.mlr.press/r9/bachrach11a.html" rel="alternate" type="text/html" title="Solving Cooperative Reliability Games" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/bachrach11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/bachrach11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Yoram&quot;, &quot;family&quot;=&gt;&quot;Bachrach&quot;}, {&quot;given&quot;=&gt;&quot;Reshef&quot;, &quot;family&quot;=&gt;&quot;Meir&quot;}, {&quot;given&quot;=&gt;&quot;Michal&quot;, &quot;family&quot;=&gt;&quot;Feldman&quot;}, {&quot;given&quot;=&gt;&quot;Moshe&quot;, &quot;family&quot;=&gt;&quot;Tennenholtz&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Active Diagnosis via AUC Maximization: An Efficient Approach for Multiple Fault Identification in Large Scale, Noisy Networks</title><link href="https://proceedings.mlr.press/r9/bellala11a.html" rel="alternate" type="text/html" title="Active Diagnosis via AUC Maximization: An Efficient Approach for Multiple Fault Identification in Large Scale, Noisy Networks" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/bellala11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/bellala11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Gowtham&quot;, &quot;family&quot;=&gt;&quot;Bellala&quot;}, {&quot;given&quot;=&gt;&quot;Jason&quot;, &quot;family&quot;=&gt;&quot;Stanley&quot;}, {&quot;given&quot;=&gt;&quot;Clayton&quot;, &quot;family&quot;=&gt;&quot;Scott&quot;}, {&quot;given&quot;=&gt;&quot;Suresh K.&quot;, &quot;family&quot;=&gt;&quot;Bhavnani&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Semi-supervised Learning with Density Based Distances</title><link href="https://proceedings.mlr.press/r9/bijral11a.html" rel="alternate" type="text/html" title="Semi-supervised Learning with Density Based Distances" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/bijral11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/bijral11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Avleen S.&quot;, &quot;family&quot;=&gt;&quot;Bijral&quot;}, {&quot;given&quot;=&gt;&quot;Nathan&quot;, &quot;family&quot;=&gt;&quot;Ratliff&quot;}, {&quot;given&quot;=&gt;&quot;Nathan&quot;, &quot;family&quot;=&gt;&quot;Srebro&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Deconvolution of mixing time series on a graph</title><link href="https://proceedings.mlr.press/r9/blocker11a.html" rel="alternate" type="text/html" title="Deconvolution of mixing time series on a graph" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/blocker11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/blocker11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Alexander W.&quot;, &quot;family&quot;=&gt;&quot;Blocker&quot;}, {&quot;given&quot;=&gt;&quot;Edoardo M.&quot;, &quot;family&quot;=&gt;&quot;Airoldi&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Portfolio Allocation for Bayesian Optimization</title><link href="https://proceedings.mlr.press/r9/brochu11a.html" rel="alternate" type="text/html" title="Portfolio Allocation for Bayesian Optimization" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/brochu11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/brochu11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Eric&quot;, &quot;family&quot;=&gt;&quot;Brochu&quot;}, {&quot;given&quot;=&gt;&quot;Matthew W.&quot;, &quot;family&quot;=&gt;&quot;Hoffman&quot;}, {&quot;given&quot;=&gt;&quot;Nando&quot;, &quot;family&quot;=&gt;&quot;Freitas&quot;, &quot;prefix&quot;=&gt;&quot;de&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Factored Filtering of Continuous-Time Systems</title><link href="https://proceedings.mlr.press/r9/celikkaya11a.html" rel="alternate" type="text/html" title="Factored Filtering of Continuous-Time Systems" /><published>2011-07-14T00:00:00+00:00</published><updated>2011-07-14T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r9/celikkaya11a</id><content type="html" xml:base="https://proceedings.mlr.press/r9/celikkaya11a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;E. Busra&quot;, &quot;family&quot;=&gt;&quot;Celikkaya&quot;}, {&quot;given&quot;=&gt;&quot;Christian R.&quot;, &quot;family&quot;=&gt;&quot;Shelton&quot;}, {&quot;given&quot;=&gt;&quot;William&quot;, &quot;family&quot;=&gt;&quot;Lam&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry></feed>