<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>TaeHo Yoon</title>
    <description>Personal website for TaeHo Yoon (based on the theme Phantom by Jami Gibbs)</description>
    <link>https://tetrzim.github.io/</link>
    <atom:link href="https://tetrzim.github.io/feed.xml" rel="self" type="application/rss+xml"/>
    <pubDate>Tue, 13 Oct 2026 22:56:14 +0000</pubDate>
    <lastBuildDate>Tue, 13 Oct 2026 22:56:14 +0000</lastBuildDate>
    <generator>Jekyll v3.10.0</generator>
    
      <item>
        <title>Dual-Anchor Acceleration Is Near-Optimal for Stochastic Monotone Root-Finding</title>
        <description>
</description>
        <pubDate>Mon, 28 Sep 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/09/28/dual-anchor-acceleration.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/09/28/dual-anchor-acceleration.html</guid>
        
        <category>optimization</category>
        
        <category>stochastic-optimization</category>
        
        <category>root-finding-problems</category>
        
        <category>acceleration</category>
        
        <category>dual-anchoring</category>
        
        
      </item>
    
      <item>
        <title>Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems</title>
        <description>
</description>
        <pubDate>Thu, 24 Sep 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/09/24/anchored-extra-proximal.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/09/24/anchored-extra-proximal.html</guid>
        
        <category>optimization</category>
        
        <category>monotone-inclusions</category>
        
        <category>higher-order-methods</category>
        
        <category>acceleration</category>
        
        <category>oracle-complexity</category>
        
        
      </item>
    
      <item>
        <title>Polyak-Type Extragradient Methods for Monotone Root-Finding Problems</title>
        <description>
</description>
        <pubDate>Tue, 22 Sep 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/09/22/polyak-extragradient.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/09/22/polyak-extragradient.html</guid>
        
        <category>optimization</category>
        
        <category>stochastic-optimization</category>
        
        <category>root-finding-problems</category>
        
        <category>extragradient</category>
        
        <category>Polyak-step-sizes</category>
        
        
      </item>
    
      <item>
        <title>Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization</title>
        <description>
</description>
        <pubDate>Wed, 12 Aug 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/08/12/stochastic-root-finding.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/08/12/stochastic-root-finding.html</guid>
        
        <category>optimization</category>
        
        <category>stochastic-optimization</category>
        
        <category>root-finding-problems</category>
        
        <category>acceleration</category>
        
        
      </item>
    
      <item>
        <title>On Same-Sample and Independent-Sample Stochastic Extragradient for Monotone Variational Inequalities</title>
        <description>
</description>
        <pubDate>Thu, 06 Aug 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/08/06/stochastic-extragradient.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/08/06/stochastic-extragradient.html</guid>
        
        <category>stochastic-optimization</category>
        
        <category>variational-inequalities</category>
        
        <category>extragradient</category>
        
        
      </item>
    
      <item>
        <title>Peppy: An AI-Assisted Workflow for Tight Convergence Analysis of Optimization Algorithms</title>
        <description>
</description>
        <pubDate>Fri, 10 Jul 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/07/10/peppy.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/07/10/peppy.html</guid>
        
        <category>optimization</category>
        
        <category>AI-assisted-research</category>
        
        <category>convergence-analysis</category>
        
        <category>lyapunov-analysis</category>
        
        
      </item>
    
      <item>
        <title>Toward a Systematic Understanding and Interactive Search of Lyapunov-Style Proofs in Optimization</title>
        <description>
</description>
        <pubDate>Wed, 24 Jun 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/06/24/lyapunov-proofs.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/06/24/lyapunov-proofs.html</guid>
        
        <category>optimization</category>
        
        <category>performance-estimation</category>
        
        <category>lyapunov-analysis</category>
        
        <category>tight-proofs</category>
        
        
      </item>
    
      <item>
        <title>A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms</title>
        <description>
</description>
        <pubDate>Mon, 04 May 2026 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2026/05/04/composition-duality.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2026/05/04/composition-duality.html</guid>
        
        <category>optimization</category>
        
        <category>acceleration</category>
        
        <category>fixed-point-problems</category>
        
        <category>H-duality</category>
        
        
      </item>
    
      <item>
        <title>H-invariance Theory: A Complete Characterization of Minimax Optimal Fixed-Point Algorithms</title>
        <description>
</description>
        <pubDate>Tue, 18 Nov 2025 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2025/11/18/H-invariance.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2025/11/18/H-invariance.html</guid>
        
        <category>optimization</category>
        
        <category>acceleration</category>
        
        <category>fixed-point-problems</category>
        
        
      </item>
    
      <item>
        <title>Multiplayer Federated Learning: Reaching Equilibrium with Less Communication</title>
        <description>
</description>
        <pubDate>Tue, 14 Jan 2025 00:00:00 +0000</pubDate>
        <link>https://tetrzim.github.io/2025/01/14/MpFL.html</link>
        <guid isPermaLink="true">https://tetrzim.github.io/2025/01/14/MpFL.html</guid>
        
        <category>optimization</category>
        
        <category>federated-learning</category>
        
        <category>multiplayer-game-theory</category>
        
        
      </item>
    
  </channel>
</rss>
