CombOpt Reading Group
CombOpt Reading Group
About
Upcoming Talks
Recent Talks
Topics
Archive
Light
Dark
Automatic
Regret Minimization and Online Algorithms
Mar, 2024
An Optimal Algorithm for Online Bipartite Matching
by Vihan Shah
Mar 22, 2024 12:00 PM
MC6029
Abstract
Online Matroid Intersection, Beating Half for Random Arrival
by Jacob Skitsko
Mar 8, 2024 12:00 PM
MC6029
Abstract
A O(log log (rank) ) - competitive algorithm for the matroid secretary problem, Part 2
by David Aleman
Mar 1, 2024 12:00 PM
MC6029
Abstract
Feb, 2024
A O(log log (rank) ) - competitive algorithm for the matroid secretary problem
by David Aleman
Feb 16, 2024 12:00 PM
MC6029
Abstract
Online Edge Coloring with Tree Recurrences
by Janani Sundaresan
Feb 9, 2024 12:00 PM
MC6029
Abstract
Regret bounds for FTRL and Mirror Descent
by Rian Neogi
Feb 2, 2024 12:00 PM
MC6029
Abstract
Jan, 2024
Follow the Regularized Leader and Mirror Descent
by Rian Neogi
Jan 26, 2024 12:00 PM
MC6029
Abstract
Dec, 2023
Prophets, philosophers, and online algorithms
by David Wajc
Dec 8, 2023 1:00 PM
MC6029 or Zoom
Abstract
Sublinear Regret 101
by Nathan Benedetto Proenca
Dec 1, 2023 1:00 PM
MC6029 or Zoom
Abstract
Nov, 2023
Online Convex Optimization
by Victor Sanches Portella
Nov 24, 2023 1:00 PM
MC6029 or Zoom
Abstract
Multiplicative Weight Update (MWU) Method for Solving Packing/Covering LPs
by Sepehr Assadi
Nov 17, 2023 1:00 PM
MC6029 or Zoom
Abstract
Cite
×