activity
20162023
most citedPractical Algorithms for Best-K Identification in Multi-Armed Bandits

8 citations · 32 across the 23 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

cs.DS2019

Online Vector Balancing and Geometric Discrepancy

Nikhil Bansal, Haotian Jiang, Sahil Singla +1

We consider an online vector balancing question where vectors, chosen from an arbitrary distribution over , arrive one-by-one and must be immediately given a si…

cs.DS2019★ 2 cited

Algorithms and Adaptivity Gaps for Stochastic -TSP

Haotian Jiang, Jian Li, Daogao Liu +1

Given a metric and a , the classic $\textsf{$k$-TSP}$ problem is to find a tour originating at the of minimum length that visits at lea…

cs.DS2019★ 4 cited

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization

Haotian Jiang, Janardhan Kulkarni, Sahil Singla

Consider a unit interval in which points arrive one-by-one independently and uniformly at random. On arrival of a point, the problem is to immediately and irrevocably c…

math.FA2019

A Generalized Central Limit Conjecture for Convex Bodies

Haotian Jiang, Yin Tat Lee, Santosh S. Vempala

The central limit theorem for convex bodies says that with high probability the marginal of an isotropic log-concave distribution along a random direction is close to a Gaussian, w…

cs.DS2019

Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization

Venkatesan Guruswami, Haotian Jiang

Minimum storage regenerating (MSR) codes are MDS codes which allow for recovery of any single erased symbol with optimal repair bandwidth, based on the smallest possible fraction o…

cs.DS2019

The Markovian Price of Information

Anupam Gupta, Haotian Jiang, Ziv Scully +1

Suppose there are Markov chains and we need to pay a per-step \emph{price} to advance them. The "destination" states of the Markov chains contain rewards; however, we can only…