Anup Rao

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Smoothing surfaces on fourfolds	2025	Scott Nollet Anup Rao
+ PDF Chat	On Distributional Discrepancy for Experimental Design with General Assignment Probabilities	2024	Anup Rao Peng Zhang
+ PDF Chat	An XOR Lemma for Deterministic Communication Complexity	2024	S. Purushothaman Iyer Anup Rao
+ PDF Chat	Hallucination Diversity-Aware Active Learning for Text Summarization	2024	Yu Xia Xu Liu Tong Yu Sungchul Kim Ryan A. Rossi Anup Rao Tung Mai Shuai Li
+ PDF Chat	Hallucination Diversity-Aware Active Learning for Text Summarization	2024	Yu Xia Xu Liu Tong Yu Sungchul Kim Ryan A. Rossi Anup Rao Tung Mai Shuai Li
+ PDF Chat	Decentralized Personalized Online Federated Learning	2023	Renzhi Wu Saayan Mitra Xiang Chen Anup Rao
+	Optimal Sketching Bounds for Sparse Linear Regression	2023	Tung Mai Alexander Munteanu Cameron Musco Anup Rao Chris Schwiegelshohn David P. Woodruff
+	Decentralized Personalized Online Federated Learning	2023	Renzhi Wu Saayan Mitra Xiang Chen Anup Rao
+ PDF Chat	Conditional Generative Model Based Predicate-Aware Query Approximation	2022	Nikhil Sheoran Subrata Mitra Vibhor Porwal Siddharth Ghetia Jatin Varshney Tung Mai Anup Rao Vikas Maddukuri
+	Online MAP Inference and Learning for Nonsymmetric Determinantal Point Processes.	2021	A. Rama Mohan Reddy Ryan A. Rossi Zhao Song Anup Rao Tung Mai Nedim Lipka Gang Wu Eunyee Koh Nesreen K. Ahmed
+	An Interpretable Graph Generative Model with Heterophily.	2021	Sudhanshu Chanpuriya Ryan A. Rossi Anup Rao Tung Mai Nedim Lipka Zhao Song Cameron Musco
+	Multiscale Manifold Warping.	2021	Sridhar Mahadevan Anup Rao Georgios Theocharous Jennifer Healey
+ PDF Chat	Coresets for Classification -- Simplified and Strengthened	2021	Tung Mai Anup Rao Cameron Musco
+ PDF Chat	Graph Neural Networks with Heterophily	2021	Jiong Zhu Ryan A. Rossi Anup Rao Tung Mai Nedim Lipka Nesreen K. Ahmed Danai Koutra
+	Designing Transportable Experiments Under S-admissability	2021	My V. T. Phan David Arbour Drew Dimmery Anup Rao
+	Fundamental Tradeoffs in Distributionally Adversarial Training	2021	Mohammad Mehrabi Adel Javanmard Ryan A. Rossi Anup Rao Tung Mai
+	Online Discrepancy Minimization via Persistent Self-Balancing Walks	2021	David Arbour Drew Dimmery Tung Mai Anup Rao
+	Asymptotics of Ridge Regression in Convolutional Models	2021	Mojtaba Sahraee-Ardakan Tung Mai Anup Rao Ryan A. Rossi Sundeep Rangan Alyson K. Fletcher
+	Fundamental Tradeoffs in Distributionally Adversarial Training	2021	Mohamad Ali Mehrabi Adel Javanmard Ryan A. Rossi Anup Rao Tung Mai
+	Coresets for Classification -- Simplified and Strengthened	2021	Tung Mai Anup Rao Cameron Musco
+	Optimal Space and Time for Streaming Pattern Matching	2021	Tung Mai Anup Rao Ryan A. Rossi Saeed Seddighin
+ PDF Chat	Heterogeneous Graphlets	2020	Ryan A. Rossi Nesreen K. Ahmed Aldo Carranza David Arbour Anup Rao Sungchul Kim Eunyee Koh
+	Heterogeneous Graphlets	2020	Ryan A. Rossi Nesreen K. Ahmed Aldo Carranza David Arbour Anup Rao Sungchul Kim Eunyee Koh
+	Efficient Balanced Treatment Assignments for Experimentation	2020	David Arbour Drew Dimmery Anup Rao
+	Designing Transportable Experiments	2020	My V. T. Phan David Arbour Drew Dimmery Anup Rao
+ PDF Chat	Higher-order Clustering in Complex Heterogeneous Networks	2020	Aldo Carranza Ryan A. Rossi Anup Rao Eunyee Koh
+	Model Selection in Contextual Stochastic Bandit Problems	2020	Aldo Pacchiano My V. T. Phan Yasin Abbasi-Yadkori Anup Rao Julian Zimmert Tor Lattimore Csaba Szepesvári
+	Determinant-Preserving Sparsification of SDDM Matrices	2020	David Durfee John Peebles Richard Peng Anup Rao
+	Efficient Balanced Treatment Assignments for Experimentation	2020	David Arbour Drew Dimmery Anup Rao
+	Graph Neural Networks with Heterophily	2020	Jiong Zhu Ryan A. Rossi Anup Rao Tung Mai Nedim Lipka Nesreen K. Ahmed Danai Koutra
+	Designing Transportable Experiments	2020	My V. T. Phan David Arbour Drew Dimmery Anup Rao
+ PDF Chat	Approximate Maximum Matching in Random Streams	2019	Alireza Farhadi Mohammad Taghi Hajiaghayi Tung Mah Anup Rao Ryan A. Rossi
+	Approximate Maximum Matching in Random Streams	2019	Alireza Farhadi MohammadTaghi Hajiaghayi Tung Mai Anup Rao Ryan A. Rossi
+	Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifs	2019	Ryan A. Rossi Anup Rao Sungchul Kim Eunyee Koh Nesreen K. Ahmed Gang Wu
+	Efficient Second-Order Shape-Constrained Function Fitting	2019	David Durfee Yu Gao Anup Rao Sebastian Wild
+	Heterogeneous Network Motifs.	2019	Ryan A. Rossi Nesreen K. Ahmed Aldo Carranza David Arbour Anup Rao Sungchul Kim Eunyee Koh
+ PDF Chat	Efficient Second-Order Shape-Constrained Function Fitting	2019	David Durfee Yu Gao Anup Rao Sebastian Wild
+	Efficient Second-Order Shape-Constrained Function Fitting	2019	David Durfee Yu Gao Anup Rao Sebastian Wild
+	Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations	2018	Michael B. Cohen Jonathan A. Kelner Rasmus Kyng John Peebles Richard Peng Anup Rao Aaron Sidford
+ PDF Chat	Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations	2018	Michael B. Cohen Jonathan A. Kelner Rasmus Kyng John Peebles Richard Peng Anup Rao Aaron Sidford
+	New Insights into Bootstrapping for Bandits.	2018	Sharan Vaswani Branislav Kveton Zheng Wen Anup Rao Mark Schmidt Yasin Abbasi-Yadkori
+	Higher-order Graph Convolutional Networks	2018	John Boaz Lee Ryan A. Rossi Xiangnan Kong Sungchul Kim Eunyee Koh Anup Rao
+	Latent Network Summarization: Bridging Network Embedding and Summarization	2018	Di Jin Ryan A. Rossi Danai Koutra Eunyee Koh Sungchul Kim Anup Rao
+	Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations	2018	Michael B. Cohen Jonathan A. Kelner Rasmus Kyng John Peebles Richard Peng Anup Rao Aaron Sidford
+ PDF Chat	Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees	2017	David Durfee John Peebles Richard Peng Anup Rao
+	Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs	2017	Michael B. Cohen Jonathan A. Kelner John Peebles Richard Peng Anup Rao Aaron Sidford Adrian Vladu
+	Sampling random spanning trees faster than matrix multiplication	2017	David Durfee Rasmus Kyng John Peebles Anup Rao Sushant Sachdeva
+	Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees	2017	David Durfee John Peebles Richard Peng Anup Rao
+	Concave Flow on Small Depth Directed Networks	2017	Tung Mai Richard Peng Anup Rao Vijay V. Vazirani
+	Stochastic Low-Rank Bandits	2017	Branislav Kveton Csaba Szepesvári Anup Rao Zheng Wen Yasin Abbasi-Yadkori S. Muthukrishnan
+	Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees	2017	David Durfee John Peebles Richard Peng Anup Rao
+	Sampling Random Spanning Trees Faster than Matrix Multiplication	2016	David Durfee Rasmus Kyng John Peebles Anup Rao Sushant Sachdeva
+	Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs	2016	Michael B. Cohen Jonathan A. Kelner John Peebles Richard Peng Anup Rao Aaron Sidford Adrian Vladu
+ PDF Chat	Agnostic Estimation of Mean and Covariance	2016	Kevin A. Lai Anup Rao Santosh Vempala
+	Agnostic Estimation of Mean and Covariance	2016	Kevin A. Lai Anup Rao Santosh Vempala
+	Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem	2016	Jan Hązła Thomas Holenstein Anup Rao
+	Agnostic Estimation of Mean and Covariance	2016	Kevin A. Lai Anup Rao Santosh Vempala
+	Sampling Random Spanning Trees Faster than Matrix Multiplication	2016	David Durfee Rasmus Kyng John Peebles Anup Rao Sushant Sachdeva
+	Fast, provable algorithms for Isotonic regression in all ℓ- p -norms	2015	Rasmus Kyng Anup Rao Sushant Sachdeva
+	Algorithms for Lipschitz Learning on Graphs	2015	Rasmus Kyng Anup Rao Sushant Sachdeva Daniel A. Spielman
+	Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery	2015	Peter Chin Anup Rao Van Vu
+	Algorithms for Lipschitz Learning on Graphs	2015	Rasmus Kyng Anup Rao Sushant Sachdeva Daniel A. Spielman
+	Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery	2015	Peter Chin Anup Rao Van Vu
+	Fast, Provable Algorithms for Isotonic Regression in all $\ell_{p}$-norms	2015	Rasmus Kyng Anup Rao Sushant Sachdeva
+	Preconditioning in Expectation	2014	Michael B. Cohen Rasmus Kyng Jakub Pachocki Richard Peng Anup Rao
+	Linear algorithm for domatic number problem on interval graphs	1989	Anup Rao C. Pandu Rangan

Common Coauthors

Coauthor	Papers Together
Ryan A. Rossi	19
Tung Mai	17
John Peebles	12
Richard Peng	11
Rasmus Kyng	11
David Durfee	10
David Arbour	9
Sungchul Kim	8
Eunyee Koh	8
Sushant Sachdeva	7
Nesreen K. Ahmed	7
Michael B. Cohen	6
Drew Dimmery	6
Jonathan A. Kelner	5
Aaron Sidford	5
Aldo Carranza	4
Nedim Lipka	4
Cameron Musco	4
My V. T. Phan	4
Yasin Abbasi-Yadkori	3
Sebastian Wild	3
Kevin A. Lai	3
Santosh Vempala	3
Danai Koutra	3
Shuai Li	2
Alireza Farhadi	2
Saayan Mitra	2
Renzhi Wu	2
Adel Javanmard	2
Gang Wu	2
Branislav Kveton	2
Daniel A. Spielman	2
Zheng Wen	2
Csaba Szepesvári	2
Jiong Zhu	2
Yu Gao	2
Adrian Vladu	2
Yu Xia	2
Xu Liu	2
Tong Yu	2
Van Vu	2
Xiang Chen	2
Zhao Song	2
Peter Chin	2
S. Purushothaman Iyer	1
Georgios Theocharous	1
Vikas Maddukuri	1
Mohammad Mehrabi	1
Sudhanshu Chanpuriya	1
Mohamad Ali Mehrabi	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems	2014	Daniel A. Spielman Shang‐Hua Teng	8
+ PDF Chat	User-Friendly Tail Bounds for Sums of Random Matrices	2011	Joel A. Tropp	7
+	Learning Role-based Graph Embeddings	2018	Nesreen K. Ahmed Ryan A. Rossi John Boaz Lee Xiangnan Kong Theodore L. Willke Rong Zhou Hoda Eldardiry	6
+ PDF Chat	Fast Generation of Random Spanning Trees and the Effective Resistance Metric	2014	Aleksander Ma̧dry Damian Straszak Jakub Tarnawski	5
+ PDF Chat	Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems	2013	Yin Tat Lee Aaron Sidford	5
+ PDF Chat	A Nearly-m log n Time Solver for SDD Linear Systems	2011	Ioannis Koutis Gary L. Miller Richard Peng	5
+ PDF Chat	Graph Sparsification by Effective Resistances	2011	Daniel A. Spielman Nikhil Srivastava	5
+ PDF Chat	Efficient Graphlet Counting for Large Networks	2015	Nesreen K. Ahmed Jennifer Neville Ryan A. Rossi Nick Duffield	5
+ PDF Chat	Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems	2004	Daniel A. Spielman Shang‐Hua Teng	5
+	A nearly-mlogn time solver for SDD linear systems	2011	Ioannis Koutis Gary L. Miller Richard Peng	4
+ PDF Chat	DeepWalk	2014	Bryan Perozzi Rami Al‐Rfou Steven Skiena	4
+	Path Finding Methods for Linear Programming: Solving Linear Programs in &#x00D5;(vrank) Iterations and Faster Algorithms for Maximum Flow	2014	Yin Tat Lee Aaron Sidford	4
+ PDF Chat	A simple, combinatorial algorithm for solving SDD systems in nearly-linear time	2013	Jonathan A. Kelner Lorenzo Orecchia Aaron Sidford Zeyuan Allen Zhu	4
+ PDF Chat	Extension of range of functions	1934	E. J. McShane	4
+ PDF Chat	RAGE – A rapid graphlet enumerator for large networks	2011	Dror Marcus Yuval Shavitt	4
+	Sparsified Cholesky and multigrid solvers for connection laplacians	2016	Rasmus Kyng Yin Tat Lee Richard Peng Sushant Sachdeva Daniel A. Spielman	4
+	Community structure in social and biological networks	2002	Michelle Girvan M. E. J. Newman	3
+ PDF Chat	Uncovering the overlapping community structure of complex networks in nature and society	2005	Gergely Palla Imre Derényi Illés J. Farkas Tamás Vicsek	3
+	Fast generation of random spanning trees and the effective resistance metric	2015	Aleksander Ma̧dry Damian Straszak Jakub Tarnawski	3
+	Unranking and ranking spanning trees of a graph	1989	Charles J. Colbourn Robert P.J Day Louis H. Nel	3
+ PDF Chat	LINE	2015	Jian Tang Meng Qu Wang Ming-zhe Ming Zhang Jun Yan Qiaozhu Mei	3
+ PDF Chat	Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances	1993	Robert Burton Robin Pemantle	3
+	Sampling random spanning trees faster than matrix multiplication	2017	David Durfee Rasmus Kyng John Peebles Anup Rao Sushant Sachdeva	3
+ PDF Chat	Graphlet decomposition: framework, algorithms, and applications	2016	Nesreen K. Ahmed Jennifer Neville Ryan A. Rossi Nick Duffield Theodore L. Willke	3
+ PDF Chat	GREAT: GRaphlet Edge-based network AlignmenT	2015	Joseph Crawford Tijana Milenković	3
+	Concentration inequalities : a non asymptotic theory of independence	2013	Stéphane Boucheron Gábor Lugosi Pascal Massart	3
+ PDF Chat	An efficient parallel solver for SDD linear systems	2014	Richard Peng Daniel A. Spielman	3
+	Expanders via random spanning trees	2009	Navin Goyal Luis Rademacher Santosh Vempala	3
+	Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple	2016	Rasmus Kyng Sushant Sachdeva	3
+	The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph	1994	Svante Janson	3
+	Semi-Supervised Classification with Graph Convolutional Networks	2016	Thomas Kipf Max Welling	3
+	Generating random spanning trees	1989	Arndt Bröder	3
+ PDF Chat	Biological network comparison using graphlet degree distribution	2007	Nataša Pržulj	3
+ PDF Chat	Faster Generation of Random Spanning Trees	2009	Jonathan A. Kelner Aleksander Mądry	3
+	Connected Components in Random Graphs with Given Expected Degree Sequences	2002	Fan Chung Linyuan Lü	3
+	Faster approximate lossy generalized flow via interior point algorithms	2008	Samuel I. Daitch Daniel A. Spielman	3
+	Causal Inference Using Potential Outcomes	2005	Donald B. Rubin	3
+ PDF Chat	The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees	1990	David Aldous	3
+ PDF Chat	Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More	2016	Michael B. Cohen Jonathan A. Kelner John Peebles Richard Peng Aaron Sidford Adrian Vladu	3
+ PDF Chat	Spectral Sparsification of Graphs	2011	Daniel A. Spielman Shang‐Hua Teng	3
+ PDF Chat	Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems	2012	Sébastien Bubeck Nicolò Cesa‐Bianchi	2
+	Bias-robust estimators of multivariate scatter based on projections	1992	Ricardo A. Maronna Werner A. Stahel Vı́ctor J. Yohai	2
+	The optimal recovery of smooth functions	1976	Charles A. Micchelli T. J. Rivlin S. Winograd	2
+ PDF Chat	Robust Estimation of a Location Parameter	1964	Peter J. Huber	2
+	Robust Estimates of Location and Dispersion for High-Dimensional Datasets	2002	Ricardo A. Maronna Ruben H. Zamar	2
+	Robust Estimation of Dispersion Matrices and Principal Components	1981	Susan J. Devlin R. Gnanadesikan J. R. Kettenring	2
+	Defining and identifying communities in networks	2004	Filippo Radicchi Claudio Castellano Federico Cecconi Vittorio Loreto Domenico Parisi	2
+	Principal Component Analysis with Contaminated Data: The High Dimensional Case	2010	Huan Xu Constantine Caramanis Shie Mannor	2
+ PDF Chat	Breakdown Properties of Location Estimates Based on Halfspace Depth and Projected Outlyingness	1992	David L. Donoho Miriam Gasko	2
+ PDF Chat	Temporal motifs in time-dependent networks	2011	Lauri Kovanen Márton Karsai Kimmo Kaski János Kertész Jari Saramäki	2