49 citations · 263 across the 36 of their papers we have counts for
4 papers · 1 filter
Stochastic Low-Rank Bandits
Branislav Kveton, Csaba Szepesvari, Anup Rao +3
Many problems in computer vision and recommender systems involve low-rank matrices. In this work, we study the problem of finding the maximum entry of a stochastic low-rank matrix…
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees
David Durfee, John Peebles, Richard Peng +1
We show variants of spectral sparsification routines can preserve the total spanning tree counts of graphs, which by Kirchhoff's matrix-tree theorem, is equivalent to determinant o…
Concave Flow on Small Depth Directed Networks
Tung Mai, Richard Peng, Anup B. Rao +1
Small depth networks arise in a variety of network related applications, often in the form of maximum flow and maximum weighted matching. Recent works have generalized such methods…
A Theory of Market Efficiency
Anup Rao
We introduce a mathematical theory called market connectivity that gives concrete ways to both measure the efficiency of markets and find inefficiencies in large markets. The theor…