Search Results for author: Sreenivas Gollapudi

Found 7 papers, 0 papers with code

Robust Learning for Congestion-Aware Routing

no code implementations1 Jan 2021 Sreenivas Gollapudi, Kostas Kollias, Benjamin Plaut, Ameya Velingker

We consider the problem of routing users through a network with unknown congestion functions over an infinite time horizon.

Online Learning under Adversarial Corruptions

no code implementations1 Jan 2021 Pranjal Awasthi, Sreenivas Gollapudi, Kostas Kollias, Apaar Sadhwani

We study the design of efficient online learning algorithms tolerant to adversarially corrupted rewards.

Multi-Armed Bandits

Beyond GNNs: A Sample Efficient Architecture for Graph Problems

no code implementations1 Jan 2021 Pranjal Awasthi, Abhimanyu Das, Sreenivas Gollapudi

Finally, we empirically demonstrate the effectiveness of our proposed architecture for a variety of graph problems.

Generalization Bounds

Adaptive Probing Policies for Shortest Path Routing

no code implementations NeurIPS 2020 Aditya Bhaskara, Sreenivas Gollapudi, Kostas Kollias, Kamesh Munagala

Inspired by traffic routing applications, we consider the problem of finding the shortest path from a source $s$ to a destination $t$ in a graph, when the lengths of the edges are unknown.

On the Learnability of Deep Random Networks

no code implementations8 Apr 2019 Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar, Rina Panigrahy

In this paper we study the learnability of deep random networks from both theoretical and practical points of view.

Algorithms for $\ell_p$ Low-Rank Approximation

no code implementations ICML 2017 Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem.

Cannot find the paper you are looking for? You can Submit a new open access paper.