5 citations · 16 across the 6 of their papers we have counts for
10 papers
Online Learning and Bandits with Queried Hints
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im +2
We consider the classic online learning and stochastic multi-armed bandit (MAB) problems, when at each step, the online policy can probe and find out which of a small number ()…
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
Sreenivas Gollapudi, Guru Guruganesh, Kostas Kollias +3
We consider the following variant of contextual linear bandits motivated by routing applications in navigational engines and recommendation systems. We wish to learn a hidden -d…
Almost Envy-free Repeated Matching in Two-sided Markets
Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut
A two-sided market consists of two sets of agents, each of whom have preferences over the other (Airbnb, Upwork, Lyft, Uber, etc.). We propose and analyze a repeated matching probl…
Predict and Match: Prophet Inequalities with Uncertain Supply
Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi +2
We consider the problem of selling perishable items to a stream of buyers in order to maximize social welfare. A seller starts with a set of identical items, and each arriving buye…
Hiring Under Uncertainty
Manish Raghavan, Manish Purohit, Sreenivas Gollupadi
In this paper we introduce the hiring under uncertainty problem to model the questions faced by hiring committees in large enterprises and universities alike. Given a set of el…
On the Learnability of Deep Random Networks
Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar +1
In this paper we study the learnability of deep random networks from both theoretical and practical points of view. On the theoretical front, we show that the learnability of rando…