Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

Picture for Anup Rao

Multiscale Manifold Warping


Sep 19, 2021
Sridhar Mahadevan, Anup Rao, Georgios Theocharous, Jennifer Healey

* 18 pages 

  Access Paper or Ask Questions

Asymptotics of Ridge Regression in Convolutional Models


Mar 08, 2021
Mojtaba Sahraee-Ardakan, Tung Mai, Anup Rao, Ryan Rossi, Sundeep Rangan, Alyson K. Fletcher


  Access Paper or Ask Questions

Machine Unlearning via Algorithmic Stability


Feb 25, 2021
Enayat Ullah, Tung Mai, Anup Rao, Ryan Rossi, Raman Arora


  Access Paper or Ask Questions

Fundamental Tradeoffs in Distributionally Adversarial Training


Jan 15, 2021
Mohammad Mehrabi, Adel Javanmard, Ryan A. Rossi, Anup Rao, Tung Mai

* 23 pages, 3 figures 

  Access Paper or Ask Questions

Heterogeneous Graphlets


Oct 23, 2020
Ryan A. Rossi, Nesreen K. Ahmed, Aldo Carranza, David Arbour, Anup Rao, Sungchul Kim, Eunyee Koh

* arXiv admin note: substantial text overlap with arXiv:1901.10026 

  Access Paper or Ask Questions

Efficient Balanced Treatment Assignments for Experimentation


Oct 21, 2020
David Arbour, Drew Dimmery, Anup Rao


  Access Paper or Ask Questions

Graph Neural Networks with Heterophily


Sep 28, 2020
Jiong Zhu, Ryan A. Rossi, Anup Rao, Tung Mai, Nedim Lipka, Nesreen K. Ahmed, Danai Koutra


  Access Paper or Ask Questions

Sample Efficient Graph-Based Optimization with Noisy Observations


Jun 04, 2020
Tan Nguyen, Ali Shameli, Yasin Abbasi-Yadkori, Anup Rao, Branislav Kveton

* AISTATS 2019 
* The first version of this paper appeared in AISTATS 2019. Thank to community feedback, some typos and a minor issue have been identified. Specifically, on page 4, column 2, line 18, the statement $\Delta_{1,s} \ge (1+m)^{S-1-s} \Delta_1$ is not valid, and in the proof of Theorem 2, "By Lemma 1" should be "By Definition 2". These problems are fixed in this updated version published here on arxiv 

  Access Paper or Ask Questions

Model Selection in Contextual Stochastic Bandit Problems


Mar 03, 2020
Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvari

* 12 main pages, 2 figures, 14 appendix pages 

  Access Paper or Ask Questions

Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifs


Jun 12, 2019
Ryan A. Rossi, Anup Rao, Sungchul Kim, Eunyee Koh, Nesreen K. Ahmed, Gang Wu


  Access Paper or Ask Questions

Heterogeneous Network Motifs


Feb 04, 2019
Ryan A. Rossi, Nesreen K. Ahmed, Aldo Carranza, David Arbour, Anup Rao, Sungchul Kim, Eunyee Koh


  Access Paper or Ask Questions

Higher-order Graph Convolutional Networks


Sep 12, 2018
John Boaz Lee, Ryan A. Rossi, Xiangnan Kong, Sungchul Kim, Eunyee Koh, Anup Rao


  Access Paper or Ask Questions

HONE: Higher-Order Network Embeddings


May 30, 2018
Ryan A. Rossi, Nesreen K. Ahmed, Eunyee Koh, Sungchul Kim, Anup Rao, Yasin Abbasi Yadkori


  Access Paper or Ask Questions

New Insights into Bootstrapping for Bandits


May 24, 2018
Sharan Vaswani, Branislav Kveton, Zheng Wen, Anup Rao, Mark Schmidt, Yasin Abbasi-Yadkori


  Access Paper or Ask Questions

Stochastic Low-Rank Bandits


Dec 13, 2017
Branislav Kveton, Csaba Szepesvari, Anup Rao, Zheng Wen, Yasin Abbasi-Yadkori, S. Muthukrishnan


  Access Paper or Ask Questions

Fast, Provable Algorithms for Isotonic Regression in all $\ell_{p}$-norms


Nov 11, 2015
Rasmus Kyng, Anup Rao, Sushant Sachdeva


  Access Paper or Ask Questions

Algorithms for Lipschitz Learning on Graphs


Jun 30, 2015
Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman

* Code used in this work is available at https://github.com/danspielman/YINSlex 30 pages 

  Access Paper or Ask Questions