1 code implementation • 16 Apr 2023 • Navid Seidi, Ardhendu Tripathy, Sajal K. Das
Time elapsed till an event of interest is often modeled using the survival analysis methodology, which estimates a survival score based on the input features.
no code implementations • 8 Mar 2021 • Blake Mason, Ardhendu Tripathy, Robert Nowak
Specifically, consider the setting in which an NNS algorithm has access only to a stochastic distance oracle that provides a noisy, unbiased estimate of the distance between any pair of points, rather than the exact distance.
no code implementations • 15 Dec 2020 • Subhojyoti Mukherjee, Ardhendu Tripathy, Robert Nowak
Active learning can reduce the number of samples needed to perform a hypothesis test and to estimate the parameters of a model.
no code implementations • NeurIPS 2020 • Blake Mason, Lalit Jain, Ardhendu Tripathy, Robert Nowak
The pure-exploration problem in stochastic multi-armed bandits aims to find one or more arms with the largest (or near largest) means.
1 code implementation • 16 Jun 2020 • Blake Mason, Lalit Jain, Ardhendu Tripathy, Robert Nowak
Mathematically, the all-{\epsilon}-good arm identification problem presents significant new challenges and surprises that do not arise in the pure-exploration objectives studied in the past.
no code implementations • 3 Feb 2020 • Matthew L. Malloy, Ardhendu Tripathy, Robert D. Nowak
More precisely, consider an empirical distribution $\widehat{\boldsymbol{p}}$ generated from $n$ iid realizations of a random variable that takes one of $k$ possible values according to an unknown distribution $\boldsymbol{p}$.
1 code implementation • NeurIPS 2019 • Sumeet Katariya, Ardhendu Tripathy, Robert Nowak
This paper studies the problem of adaptively sampling from K distributions (arms) in order to identify the largest gap between any two adjacent means.
1 code implementation • NeurIPS 2019 • Blake Mason, Ardhendu Tripathy, Robert Nowak
We consider the problem of learning the nearest neighbor graph of a dataset of n items.
no code implementations • 19 Dec 2017 • Ardhendu Tripathy, Ye Wang, Prakash Ishwar
We propose a data-driven framework for optimizing privacy-preserving data release mechanisms to attain the information-theoretically optimal tradeoff between minimizing distortion of useful data and concealing specific sensitive information.