<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Online Learning | Akhilesh Tumu</title>
    <link>https://aktumu.github.io/tag/online-learning/</link>
      <atom:link href="https://aktumu.github.io/tag/online-learning/index.xml" rel="self" type="application/rss+xml" />
    <description>Online Learning</description>
    <generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><lastBuildDate>Fri, 01 Dec 2023 00:00:00 +0000</lastBuildDate>
    <image>
      <url>https://aktumu.github.io/media/icon_huf81513cd465b0045e76ded67516f9fbb_13124_512x512_fill_lanczos_center_3.png</url>
      <title>Online Learning</title>
      <link>https://aktumu.github.io/tag/online-learning/</link>
    </image>
    
    <item>
      <title>Best-of-Both-Worlds Online Linear Optimization</title>
      <link></link>
      <pubDate>Fri, 01 Dec 2023 00:00:00 +0000</pubDate>
      <guid></guid>
      <description>&lt;p&gt;We study online linear optimization as a principled framework for best-of-both-worlds (BOBW) online
learning, i.e., attaining the optimal regret rate for the stochastic regime whenever data is iid and the optimal
regret rate for the adversarial regime whenever data is adversarial without requiring any prior knowledge
about the data generating process. In particular, we demonstrate the surprising versatility of online mirror
descent with time-varying Legendre regularizers in the context of BOBW prediction with expert advice (full
information setting) and multi-armed bandits (partial information setting).&lt;/p&gt;
</description>
    </item>
    
  </channel>
</rss>
