Sanmay Das
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Sanmay Das has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Boleslaw Karol Szymanski
Rensselaer Polytechnic Institute
2 shared publications - Aditya Kumar Sehgal
K.J. Somaiya College of Engineering, Mumbai, India
1 shared publication - Charles Elkan
Department of Computer Science and Engineering University of California San Diego La Jolla 92093 CA USA
1 shared publication Elliot Anshelevich
Rensselaer Polytechnic Institute
1 shared publicationIlya Ryzhov
Robert H. Smith School of Business, University of Maryland
1 shared publication- Keith Noto
Dept. of Computer Science and Engineering University of California San Diego La Jolla 92093 CA
1 shared publication
Latest Publications
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 4994-5001
The Promise and Perils of Myopia in Dynamic Pricing With Censored Information
A seller with unlimited inventory of a digital good interacts with potential buyers with i.i.d. valuations. The seller can adaptively quote prices to each buyer to maximize long-term profits, but does not know the valuation distribution exactly. Under a linear demand model, we consider two information settings: partially censored, where agents who buy reveal their true valuations after the purchase is completed, and completely censored, where agents never reveal their valuations. In the partially censored case, we prove that myopic pricing with a Pareto prior is Bayes optimal and has finite regret. In both settings, we evaluate the myopic strategy against more sophisticated look-aheads using three valuation distributions generated from real data on auctions of physical goods, keyword auctions, and user ratings, where the linear demand assumption is clearly violated. For some datasets, complete censoring actually helps, because the restricted data acts as a "regularizer" on the posterior, preventing it from being affected too much by outliers.
- 1 July 2018
- Published by International Joint Conferences on Artificial Intelligence
- p. 4994-5001
The Promise and Perils of Myopia in Dynamic Pricing With Censored Information
A seller with unlimited inventory of a digital good interacts with potential buyers with i.i.d. valuations. The seller can adaptively quote prices to each buyer to maximize long-term profits, but does not know the valuation distribution exactly. Under a linear demand model, we consider two information settings: partially censored, where agents who buy reveal their true valuations after the purchase is completed, and completely censored, where agents never reveal their valuations. In the partially censored case, we prove that myopic pricing with a Pareto prior is Bayes optimal and has finite regret. In both settings, we evaluate the myopic strategy against more sophisticated look-aheads using three valuation distributions generated from real data on auctions of physical goods, keyword auctions, and user ratings, where the linear demand assumption is clearly violated. For some datasets, complete censoring actually helps, because the restricted data acts as a "regularizer" on the posterior, preventing it from being affected too much by outliers.
- 23 March 2012
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 8 (3) , 346-357
Market mechanisms for resource allocation in pervasive sensor applications
- 23 March 2012
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 8 (3) , 346-357
Market mechanisms for resource allocation in pervasive sensor applications
- Open Access
Near-Optimal Target Learning With Stochastic Binary Signals
We study learning in a noisy bisection model: specifically, Bayesian algorithms to learn a target value V given access only to noisy realizations of whether V is less than or greater than a threshold theta. At step t = 0, 1, 2, ..., the learner sets threshold theta t and observes a noisy realization of sign(V - theta t). After T steps, the goal is to output an estimate V^ which is within an eta-tolerance of V . This problem has been studied, predominantly in environments with a fixed error probability q < 1/2 for the noisy realization of sign(V - theta t). In practice, it is often the case that q can approach 1/2, especially as theta -> V, and there is little known when this happens. We give a pseudo-Bayesian algorithm which provably converges to V. When the true prior matches our algorithm's Gaussian prior, we show near-optimal expected performance. Our methods extend to the general multiple-threshold setting where the observation noisily indicates which of k >= 2 regions V belongs to.
Open AccessNear-Optimal Target Learning With Stochastic Binary Signals
We study learning in a noisy bisection model: specifically, Bayesian algorithms to learn a target value V given access only to noisy realizations of whether V is less than or greater than a threshold theta. At step t = 0, 1, 2, ..., the learner sets threshold theta t and observes a noisy realization of sign(V - theta t). After T steps, the goal is to output an estimate V^ which is within an eta-tolerance of V . This problem has been studied, predominantly in environments with a fixed error probability q < 1/2 for the noisy realization of sign(V - theta t). In practice, it is often the case that q can approach 1/2, especially as theta -> V, and there is little known when this happens. We give a pseudo-Bayesian algorithm which provably converges to V. When the true prior matches our algorithm's Gaussian prior, we show near-optimal expected performance. Our methods extend to the general multiple-threshold setting where the observation noisily indicates which of k >= 2 regions V belongs to.
- 8 October 2011
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 26 (1) , 120-140
Anarchy, stability, and utopia: creating better matchings
- 8 October 2011
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 26 (1) , 120-140
Anarchy, stability, and utopia: creating better matchings
- 8 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 8 (3) , 851-857
Identifying Relevant Data for a Biological Database: Handcrafted Rules versus Machine Learning
With well over 1,000 specialized biological databases in use today, the task of automatically identifying novel, relevant data for such databases is increasingly important. In this paper, we describe practical machine learning approaches for identifying MEDLINE documents and Swiss-Prot/TrEMBL protein records, for incorporation into a specialized biological database of transport proteins named TCDB. We show that both learning approaches outperform rules created by hand by a human expert. As one of the first case studies involving two different approaches to updating a deployed database, both the methods compared and the results will be of interest to curators of many specialized databases.
- 8 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 8 (3) , 851-857
Identifying Relevant Data for a Biological Database: Handcrafted Rules versus Machine Learning
With well over 1,000 specialized biological databases in use today, the task of automatically identifying novel, relevant data for such databases is increasingly important. In this paper, we describe practical machine learning approaches for identifying MEDLINE documents and Swiss-Prot/TrEMBL protein records, for incorporation into a specialized biological database of transport proteins named TCDB. We show that both learning approaches outperform rules created by hand by a human expert. As one of the first case studies involving two different approaches to updating a deployed database, both the methods compared and the results will be of interest to curators of many specialized databases.