8 citations · 36 across the 17 of their papers we have counts for
6 papers · 1 filter
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
Sivakanth Gopi, Yin Tat Lee, Daogao Liu +2
The development of efficient sampling algorithms catering to non-Euclidean geometries has been a challenging endeavor, as discretization techniques which succeed in the Euclidean s…
Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme
Hu Fu, Jiawei Li, Daogao Liu
Weitzman (1979) introduced the Pandora Box problem as a model for sequential search with inspection costs, and gave an elegant index-based policy that attains provably optimal expe…
Private Convex Optimization via Exponential Mechanism
Sivakanth Gopi, Yin Tat Lee, Daogao Liu
In this paper, we study private optimization problems for non-smooth convex functions on . We show that modifying the exponential mechanism…
Multi-token Markov Game with Switching Costs
Jian Li, Daogao Liu
We study a general Markov game with metric switching costs: in each round, the player adaptively chooses one of several Markov chains to advance with the objective of minimizing th…
Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity
Yaonan Jin, Daogao Liu, Zhao Song
The ability to resolve detail in the object that is being imaged, named by resolution, is the core parameter of an imaging system. Super-resolution is a class of techniques that ca…
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…