Tight analyses for non-smooth stochastic gradient descent. - Nicholas J. A. Harvey; Christopher Liaw; Yaniv Plan; Sikander Randhawa (COLT, 2019)

The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue. - Hu Fu 001; Christopher Liaw; Sikander Randhawa (EC, 2019)

Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent. - Nicholas J. A. Harvey; Christopher Liaw; Sikander Randhawa (CoRR, 2019)

Optimal anytime regret for two experts. - Nicholas J. A. Harvey; Christopher Liaw; Edwin A. Perkins; Sikander Randhawa (FOCS, 2020)

Tight analyses for subgradient descent I: Lower bounds. - Nicholas J. A. Harvey; Chris Liaw; Sikander Randhawa (Open J. Math. Optim., 2024)