5 papers
Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions
Soumita Hait, Ping Li, Haipeng Luo +1
Last-iterate convergence of learning dynamics in games has attracted significant recent attention. In two-player zero-sum games with bandit feedback, where only the loss of the sel…
Comparator-Adaptive -Regret: Improved Bounds, Simpler Algorithms, and Applications to Games
Soumita Hait, Ping Li, Haipeng Luo +1
In the classic expert problem, -regret measures the gap between the learner's total loss and that achieved by applying the best action transformation . A recent work by…
Alternating Regret for Online Convex Optimization
Soumita Hait, Ping Li, Haipeng Luo +1
Motivated by alternating learning dynamics in two-player games, a recent work by Cevher et al.(2024) shows that alternating regret is possible for any -round adver…
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
Anubhav Dhar, Soumita Hait, Sudeshna Kolay
The Euclidean Steiner Minimal Tree problem takes as input a set of points in the Euclidean plane and finds the minimum length network interconnecting all the points of…
On finding short reconfiguration sequences between independent sets
Akanksha Agrawal, Soumita Hait, Amer E. Mouawad
Assume we are given a graph , two independent sets and in of size , and a positive integer . The goal is to decide whether there exists a sequ…