2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.LG2013★ 2 cited
Optimal amortized regret in every interval
Rina Panigrahy, Preyas Popat
Consider the classical problem of predicting the next bit in a sequence of bits. A standard performance measure is {\em regret} (loss in payoff) with respect to a set of experts. F…
cs.LG2013★ 1 cited
Fractal structures in Adversarial Prediction
Rina Panigrahy, Preyas Popat
Fractals are self-similar recursive structures that have been used in modeling several real world processes. In this work we study how "fractal-like" processes arise in a predictio…
cs.CC2011★ 1 cited
$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing
Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi
We prove that for an arbitrarily small constant $\eps>0,$ assuming NPDTIME$(2^{{\log^{O(1/\eps)} n}})$, the preprocessing versions of the closest vector problem and…