<?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/r15/feed.xml" rel="self" type="application/atom+xml" /><link href="https://proceedings.mlr.press/r15/" rel="alternate" type="text/html" /><updated>2026-10-04T22:56:29+00:00</updated><id>https://proceedings.mlr.press/r15/feed.xml</id><title type="html">Proceedings of Machine Learning Research</title><subtitle>Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence
  Held in Sydney, Australia on 11-15 August 2017

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

Volume Edited by:
  Gal Elidan
  Kristian Kersting

Series Editors:
  Tegan Emerson
  Hoel Kervadec
  Neil D. Lawrence
</subtitle><author><name>PMLR</name></author><entry><title type="html">Coupling Adaptive Batch Sizes with Learning Rates</title><link href="https://proceedings.mlr.press/r15/balles17a.html" rel="alternate" type="text/html" title="Coupling Adaptive Batch Sizes with Learning Rates" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/balles17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/balles17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Lukas&quot;, &quot;family&quot;=&gt;&quot;Balles&quot;}, {&quot;given&quot;=&gt;&quot;Javier&quot;, &quot;family&quot;=&gt;&quot;Romero&quot;}, {&quot;given&quot;=&gt;&quot;Philipp&quot;, &quot;family&quot;=&gt;&quot;Hennig&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">The Binomial Block Bootstrap Estimator for Evaluating Loss on Dependent Clusters</title><link href="https://proceedings.mlr.press/r15/barnes17a.html" rel="alternate" type="text/html" title="The Binomial Block Bootstrap Estimator for Evaluating Loss on Dependent Clusters" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/barnes17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/barnes17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Matt&quot;, &quot;family&quot;=&gt;&quot;Barnes&quot;}, {&quot;given&quot;=&gt;&quot;Artur&quot;, &quot;family&quot;=&gt;&quot;Dubrawski&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Weighted Model Counting With Function Symbols</title><link href="https://proceedings.mlr.press/r15/belle17a.html" rel="alternate" type="text/html" title="Weighted Model Counting With Function Symbols" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/belle17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/belle17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Vaishak&quot;, &quot;family&quot;=&gt;&quot;Belle&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Regret Minimization Algorithms for the Follower’s Behaviour Identification in Leadership Games</title><link href="https://proceedings.mlr.press/r15/bisi17a.html" rel="alternate" type="text/html" title="Regret Minimization Algorithms for the Follower’s Behaviour Identification in Leadership Games" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/bisi17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/bisi17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Lorenzo&quot;, &quot;family&quot;=&gt;&quot;Bisi&quot;}, {&quot;given&quot;=&gt;&quot;Giuseppe&quot;, &quot;family&quot;=&gt;&quot;De Nittis&quot;}, {&quot;given&quot;=&gt;&quot;Francesco&quot;, &quot;family&quot;=&gt;&quot;Trov‘ò&quot;}, {&quot;given&quot;=&gt;&quot;Marcello&quot;, &quot;family&quot;=&gt;&quot;Restelli&quot;}, {&quot;given&quot;=&gt;&quot;Nicola&quot;, &quot;family&quot;=&gt;&quot;Gatti&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Exact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories</title><link href="https://proceedings.mlr.press/r15/braz17a.html" rel="alternate" type="text/html" title="Exact Inference for Relational Graphical Models with Interpreted Functions: Lifted Probabilistic Inference Modulo Theories" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/braz17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/braz17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Rodrigo de Salvo&quot;, &quot;family&quot;=&gt;&quot;Braz&quot;}, {&quot;given&quot;=&gt;&quot;Ciaran&quot;, &quot;family&quot;=&gt;&quot;O’Reilly&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Best Student Paper &amp;lt;/h4&amp;gt;&amp;lt;h4&amp;gt;Why Rules are Complex: Real-Valued Probabilistic Logic Programs are not Fully Expressive</title><link href="https://proceedings.mlr.press/r15/buchman17a.html" rel="alternate" type="text/html" title="Best Student Paper &amp;lt;/h4&amp;gt;&amp;lt;h4&amp;gt;Why Rules are Complex: Real-Valued Probabilistic Logic Programs are not Fully Expressive" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/buchman17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/buchman17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;David&quot;, &quot;family&quot;=&gt;&quot;Buchman&quot;}, {&quot;given&quot;=&gt;&quot;David&quot;, &quot;family&quot;=&gt;&quot;Poole&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">On the Complexity of Nash Equilibrium Reoptimization</title><link href="https://proceedings.mlr.press/r15/celli17a.html" rel="alternate" type="text/html" title="On the Complexity of Nash Equilibrium Reoptimization" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/celli17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/celli17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Andrea&quot;, &quot;family&quot;=&gt;&quot;Celli&quot;}, {&quot;given&quot;=&gt;&quot;Alberto&quot;, &quot;family&quot;=&gt;&quot;Marchesi&quot;}, {&quot;given&quot;=&gt;&quot;Nicola&quot;, &quot;family&quot;=&gt;&quot;Gatti&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Robust Model Equivalence using Stochastic Bisimulation for N-Agent Interactive DIDs</title><link href="https://proceedings.mlr.press/r15/chandrasekaran17a.html" rel="alternate" type="text/html" title="Robust Model Equivalence using Stochastic Bisimulation for N-Agent Interactive DIDs" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/chandrasekaran17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/chandrasekaran17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Muthukumaran&quot;, &quot;family&quot;=&gt;&quot;Chandrasekaran&quot;}, {&quot;given&quot;=&gt;&quot;Junhuan&quot;, &quot;family&quot;=&gt;&quot;Zhang&quot;}, {&quot;given&quot;=&gt;&quot;Prashant&quot;, &quot;family&quot;=&gt;&quot;Doshi&quot;}, {&quot;given&quot;=&gt;&quot;Yifeng&quot;, &quot;family&quot;=&gt;&quot;Zeng&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Analysis of Thompson Sampling for Stochastic Sleeping Bandits</title><link href="https://proceedings.mlr.press/r15/chatterjee17a.html" rel="alternate" type="text/html" title="Analysis of Thompson Sampling for Stochastic Sleeping Bandits" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/chatterjee17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/chatterjee17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Aritra&quot;, &quot;family&quot;=&gt;&quot;Chatterjee&quot;}, {&quot;given&quot;=&gt;&quot;Ganesh&quot;, &quot;family&quot;=&gt;&quot;Ghalme&quot;}, {&quot;given&quot;=&gt;&quot;Shweta&quot;, &quot;family&quot;=&gt;&quot;Jain&quot;}, {&quot;given&quot;=&gt;&quot;Rohit&quot;, &quot;family&quot;=&gt;&quot;Vaish&quot;}, {&quot;given&quot;=&gt;&quot;Y.&quot;, &quot;family&quot;=&gt;&quot;Narahari&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting</title><link href="https://proceedings.mlr.press/r15/chen17a.html" rel="alternate" type="text/html" title="Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshooting" /><published>2017-08-11T00:00:00+00:00</published><updated>2017-08-11T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r15/chen17a</id><content type="html" xml:base="https://proceedings.mlr.press/r15/chen17a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Yuxin&quot;, &quot;family&quot;=&gt;&quot;Chen&quot;}, {&quot;given&quot;=&gt;&quot;Jean-Michel&quot;, &quot;family&quot;=&gt;&quot;Renders&quot;}, {&quot;given&quot;=&gt;&quot;Morteza Haghir&quot;, &quot;family&quot;=&gt;&quot;Chehreghani&quot;}, {&quot;given&quot;=&gt;&quot;Andreas&quot;, &quot;family&quot;=&gt;&quot;Krause&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry></feed>