<?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/v336/feed.xml" rel="self" type="application/atom+xml" /><link href="https://proceedings.mlr.press/v336/" rel="alternate" type="text/html" /><updated>2026-06-30T09:23:12+00:00</updated><id>https://proceedings.mlr.press/v336/feed.xml</id><title type="html">Proceedings of Machine Learning Research</title><subtitle>Proceedings of Thirty Ninth Conference on Learning Theory
  Held in San Diego, California on 29 June to 03 July 2026

Published as Volume 336 by the Proceedings of Machine Learning Research on 29 June 2026.

Volume Edited by:
  Steve Hanneke
  Tor Lattimore

Series Editors:
  Neil D. Lawrence
</subtitle><author><name>PMLR</name></author><entry><title type="html">How fast can you find a good hypothesis?</title><link href="https://proceedings.mlr.press/v336/aamand26a.html" rel="alternate" type="text/html" title="How fast can you find a good hypothesis?" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/aamand26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/aamand26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Anders&quot;, &quot;family&quot;=&gt;&quot;Aamand&quot;}, {&quot;given&quot;=&gt;&quot;Maryam&quot;, &quot;family&quot;=&gt;&quot;Aliakbarpour&quot;}, {&quot;given&quot;=&gt;&quot;Justin Y.&quot;, &quot;family&quot;=&gt;&quot;Chen&quot;}, {&quot;given&quot;=&gt;&quot;Sandeep&quot;, &quot;family&quot;=&gt;&quot;Silwal&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">On efficient robust regression with subquadratic samples</title><link href="https://proceedings.mlr.press/v336/adil26a.html" rel="alternate" type="text/html" title="On efficient robust regression with subquadratic samples" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/adil26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/adil26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Deeksha&quot;, &quot;family&quot;=&gt;&quot;Adil&quot;}, {&quot;given&quot;=&gt;&quot;Jarosław&quot;, &quot;family&quot;=&gt;&quot;Błasiok&quot;}, {&quot;given&quot;=&gt;&quot;Hongjie&quot;, &quot;family&quot;=&gt;&quot;Chen&quot;}, {&quot;given&quot;=&gt;&quot;Deepak Narayanan&quot;, &quot;family&quot;=&gt;&quot;Sridharan&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry</title><link href="https://proceedings.mlr.press/v336/ahmadi26a.html" rel="alternate" type="text/html" title="Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/ahmadi26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/ahmadi26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Ali&quot;, &quot;family&quot;=&gt;&quot;Ahmadi&quot;}, {&quot;given&quot;=&gt;&quot;Kiarash&quot;, &quot;family&quot;=&gt;&quot;Banihashem&quot;}, {&quot;given&quot;=&gt;&quot;Iman&quot;, &quot;family&quot;=&gt;&quot;Gholami&quot;}, {&quot;given&quot;=&gt;&quot;Mohammad Taghi&quot;, &quot;family&quot;=&gt;&quot;Hajiaghayi&quot;}, {&quot;given&quot;=&gt;&quot;Jan&quot;, &quot;family&quot;=&gt;&quot;Olkowski&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions</title><link href="https://proceedings.mlr.press/v336/aliakbarpour26a.html" rel="alternate" type="text/html" title="Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/aliakbarpour26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/aliakbarpour26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Maryam&quot;, &quot;family&quot;=&gt;&quot;Aliakbarpour&quot;}, {&quot;given&quot;=&gt;&quot;Alireza&quot;, &quot;family&quot;=&gt;&quot;Azizi&quot;}, {&quot;given&quot;=&gt;&quot;Ria&quot;, &quot;family&quot;=&gt;&quot;Stevens&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Query Efficient Structured Matrix Learning</title><link href="https://proceedings.mlr.press/v336/amsel26a.html" rel="alternate" type="text/html" title="Query Efficient Structured Matrix Learning" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/amsel26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/amsel26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Noah&quot;, &quot;family&quot;=&gt;&quot;Amsel&quot;}, {&quot;given&quot;=&gt;&quot;Pratyush&quot;, &quot;family&quot;=&gt;&quot;Avi&quot;}, {&quot;given&quot;=&gt;&quot;Tyler&quot;, &quot;family&quot;=&gt;&quot;Chen&quot;}, {&quot;given&quot;=&gt;&quot;Feyza&quot;, &quot;family&quot;=&gt;&quot;Duman Keles&quot;}, {&quot;given&quot;=&gt;&quot;Chinmay&quot;, &quot;family&quot;=&gt;&quot;Hegde&quot;}, {&quot;given&quot;=&gt;&quot;Christopher&quot;, &quot;family&quot;=&gt;&quot;Musco&quot;}, {&quot;given&quot;=&gt;&quot;Cameron&quot;, &quot;family&quot;=&gt;&quot;Musco&quot;}, {&quot;given&quot;=&gt;&quot;David&quot;, &quot;family&quot;=&gt;&quot;Persson&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Swap Regret Minimization Through Response-Based Approachability</title><link href="https://proceedings.mlr.press/v336/anagnostides26a.html" rel="alternate" type="text/html" title="Swap Regret Minimization Through Response-Based Approachability" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/anagnostides26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/anagnostides26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Ioannis&quot;, &quot;family&quot;=&gt;&quot;Anagnostides&quot;}, {&quot;given&quot;=&gt;&quot;Gabriele&quot;, &quot;family&quot;=&gt;&quot;Farina&quot;}, {&quot;given&quot;=&gt;&quot;Maxwell&quot;, &quot;family&quot;=&gt;&quot;Fishelson&quot;}, {&quot;given&quot;=&gt;&quot;Haipeng&quot;, &quot;family&quot;=&gt;&quot;Luo&quot;}, {&quot;given&quot;=&gt;&quot;Jon&quot;, &quot;family&quot;=&gt;&quot;Schneider&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures</title><link href="https://proceedings.mlr.press/v336/anderson26a.html" rel="alternate" type="text/html" title="Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/anderson26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/anderson26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Prashanti&quot;, &quot;family&quot;=&gt;&quot;Anderson&quot;}, {&quot;given&quot;=&gt;&quot;Mitali&quot;, &quot;family&quot;=&gt;&quot;Bafna&quot;}, {&quot;given&quot;=&gt;&quot;Rares-Darius&quot;, &quot;family&quot;=&gt;&quot;Buhai&quot;}, {&quot;given&quot;=&gt;&quot;Pravesh K.&quot;, &quot;family&quot;=&gt;&quot;Kothari&quot;}, {&quot;given&quot;=&gt;&quot;David&quot;, &quot;family&quot;=&gt;&quot;Steurer&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Statistical Learning from Attribution Sets</title><link href="https://proceedings.mlr.press/v336/applebaum26a.html" rel="alternate" type="text/html" title="Statistical Learning from Attribution Sets" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/applebaum26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/applebaum26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Lorne&quot;, &quot;family&quot;=&gt;&quot;Applebaum&quot;}, {&quot;given&quot;=&gt;&quot;Robert&quot;, &quot;family&quot;=&gt;&quot;Busa-Fekete&quot;}, {&quot;given&quot;=&gt;&quot;August&quot;, &quot;family&quot;=&gt;&quot;Chen&quot;}, {&quot;given&quot;=&gt;&quot;Claudio&quot;, &quot;family&quot;=&gt;&quot;Gentile&quot;}, {&quot;given&quot;=&gt;&quot;Tomer&quot;, &quot;family&quot;=&gt;&quot;Koren&quot;}, {&quot;given&quot;=&gt;&quot;Aryan&quot;, &quot;family&quot;=&gt;&quot;Mokhtari&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization</title><link href="https://proceedings.mlr.press/v336/armacki26a.html" rel="alternate" type="text/html" title="Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/armacki26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/armacki26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Aleksandar&quot;, &quot;family&quot;=&gt;&quot;Armacki&quot;}, {&quot;given&quot;=&gt;&quot;Dragana&quot;, &quot;family&quot;=&gt;&quot;Bajović&quot;}, {&quot;given&quot;=&gt;&quot;Dušan&quot;, &quot;family&quot;=&gt;&quot;Jakovetić&quot;}, {&quot;given&quot;=&gt;&quot;Soummya&quot;, &quot;family&quot;=&gt;&quot;Kar&quot;}, {&quot;given&quot;=&gt;&quot;Ali H&quot;, &quot;family&quot;=&gt;&quot;Sayed&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">Learning depth-3 circuits via quantum agnostic boosting</title><link href="https://proceedings.mlr.press/v336/arunachalam26a.html" rel="alternate" type="text/html" title="Learning depth-3 circuits via quantum agnostic boosting" /><published>2026-06-29T00:00:00+00:00</published><updated>2026-06-29T00:00:00+00:00</updated><id>https://proceedings.mlr.press/v336/arunachalam26a</id><content type="html" xml:base="https://proceedings.mlr.press/v336/arunachalam26a.html"><![CDATA[]]></content><author><name>[{&quot;given&quot;=&gt;&quot;Srinivasan&quot;, &quot;family&quot;=&gt;&quot;Arunachalam&quot;}, {&quot;given&quot;=&gt;&quot;Arkopal&quot;, &quot;family&quot;=&gt;&quot;Dutt&quot;}, {&quot;given&quot;=&gt;&quot;Alexandru&quot;, &quot;family&quot;=&gt;&quot;Gheorghiu&quot;}, {&quot;given&quot;=&gt;&quot;Michael&quot;, &quot;family&quot;=&gt;&quot;De Oliveira&quot;}]</name></author><summary type="html"><![CDATA[]]></summary></entry></feed>