<?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/r7/feed.xml" rel="self" type="application/atom+xml" /><link href="https://proceedings.mlr.press/r7/" rel="alternate" type="text/html" /><updated>2026-10-04T22:14:53+00:00</updated><id>https://proceedings.mlr.press/r7/feed.xml</id><title type="html">Proceedings of Machine Learning Research</title><subtitle>Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence
  Held in Montreal, QC, Canada on 18-21 June 2009

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

Volume Edited by:
  Jeff Bilmes
  Andrew Y. Ng

Series Editors:
  Tegan Emerson
  Hoel Kervadec
  Neil D. Lawrence
</subtitle><author><name>PMLR</name></author><entry><title type="html">On Maximum a Posteriori Estimation of Hidden Markov Processes</title><link href="https://proceedings.mlr.press/r7/allahverdyan09a.html" rel="alternate" type="text/html" title="On Maximum a Posteriori Estimation of Hidden Markov Processes" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/allahverdyan09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/allahverdyan09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Armen&quot;, &quot;family&quot;=&gt;&quot;Allahverdyan&quot;}, {&quot;given&quot;=&gt;&quot;Aram&quot;, &quot;family&quot;=&gt;&quot;Galstyan&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Lower Bound Bayesian Networks - Efficient Inference of Lower Bounds on Probability Distributions</title><link href="https://proceedings.mlr.press/r7/andrade09a.html" rel="alternate" type="text/html" title="Lower Bound Bayesian Networks - Efficient Inference of Lower Bounds on Probability Distributions" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/andrade09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/andrade09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Daniel&quot;, &quot;family&quot;=&gt;&quot;Andrade&quot;}, {&quot;given&quot;=&gt;&quot;Bernhard&quot;, &quot;family&quot;=&gt;&quot;Sick&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">On Smoothing and Inference for Topic Models</title><link href="https://proceedings.mlr.press/r7/asuncion09a.html" rel="alternate" type="text/html" title="On Smoothing and Inference for Topic Models" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/asuncion09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/asuncion09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Arthur&quot;, &quot;family&quot;=&gt;&quot;Asuncion&quot;}, {&quot;given&quot;=&gt;&quot;Max&quot;, &quot;family&quot;=&gt;&quot;Welling&quot;}, {&quot;given&quot;=&gt;&quot;Padhraic&quot;, &quot;family&quot;=&gt;&quot;Smyth&quot;}, {&quot;given&quot;=&gt;&quot;Yee Whye&quot;, &quot;family&quot;=&gt;&quot;Teh&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs</title><link href="https://proceedings.mlr.press/r7/bartlett09a.html" rel="alternate" type="text/html" title="REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/bartlett09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/bartlett09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Peter&quot;, &quot;family&quot;=&gt;&quot;Bartlett&quot;}, {&quot;given&quot;=&gt;&quot;Ambuj&quot;, &quot;family&quot;=&gt;&quot;Tewari&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Alternating Projections for Learning with Expectation Constraints</title><link href="https://proceedings.mlr.press/r7/bellare09a.html" rel="alternate" type="text/html" title="Alternating Projections for Learning with Expectation Constraints" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/bellare09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/bellare09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Kedar&quot;, &quot;family&quot;=&gt;&quot;Bellare&quot;}, {&quot;given&quot;=&gt;&quot;Gregory&quot;, &quot;family&quot;=&gt;&quot;Druck&quot;}, {&quot;given&quot;=&gt;&quot;Andrew&quot;, &quot;family&quot;=&gt;&quot;McCallum&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Conditional Probability Tree Estimation Analysis and Algorithms</title><link href="https://proceedings.mlr.press/r7/beygelzimer09a.html" rel="alternate" type="text/html" title="Conditional Probability Tree Estimation Analysis and Algorithms" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/beygelzimer09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/beygelzimer09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Alina&quot;, &quot;family&quot;=&gt;&quot;Beygelzimer&quot;}, {&quot;given&quot;=&gt;&quot;John&quot;, &quot;family&quot;=&gt;&quot;Langford&quot;}, {&quot;given&quot;=&gt;&quot;Yury&quot;, &quot;family&quot;=&gt;&quot;Lifshits&quot;}, {&quot;given&quot;=&gt;&quot;Gregory&quot;, &quot;family&quot;=&gt;&quot;Sorkin&quot;}, {&quot;given&quot;=&gt;&quot;Alex&quot;, &quot;family&quot;=&gt;&quot;Strehl&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Deterministic POMDPs Revisited</title><link href="https://proceedings.mlr.press/r7/bonet09a.html" rel="alternate" type="text/html" title="Deterministic POMDPs Revisited" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/bonet09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/bonet09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Blai&quot;, &quot;family&quot;=&gt;&quot;Bonet&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Optimization of Structured Mean Field Objectives</title><link href="https://proceedings.mlr.press/r7/bouchard-cote09a.html" rel="alternate" type="text/html" title="Optimization of Structured Mean Field Objectives" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/bouchard-cote09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/bouchard-cote09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Alexandre&quot;, &quot;family&quot;=&gt;&quot;Bouchard-Côté&quot;}, {&quot;given&quot;=&gt;&quot;Mike&quot;, &quot;family&quot;=&gt;&quot;Jordan&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Multilingual Topic Models for Unaligned Text</title><link href="https://proceedings.mlr.press/r7/boyd-graber09a.html" rel="alternate" type="text/html" title="Multilingual Topic Models for Unaligned Text" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/boyd-graber09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/boyd-graber09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Jordan&quot;, &quot;family&quot;=&gt;&quot;Boyd-Graber&quot;}, {&quot;given&quot;=&gt;&quot;David&quot;, &quot;family&quot;=&gt;&quot;Blei&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Convex Coding</title><link href="https://proceedings.mlr.press/r7/bradley09a.html" rel="alternate" type="text/html" title="Convex Coding" /><published>2009-06-18T00:00:00+00:00</published><updated>2009-06-18T00:00:00+00:00</updated><id>https://proceedings.mlr.press/r7/bradley09a</id><content type="html" xml:base="https://proceedings.mlr.press/r7/bradley09a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;David&quot;, &quot;family&quot;=&gt;&quot;Bradley&quot;}, {&quot;given&quot;=&gt;&quot;J. Andrew&quot;, &quot;family&quot;=&gt;&quot;Bagnell&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry></feed>