Our reading group meets from 3 to 5 in MCS B08. Email Babis (tsourolampis at gmail.com) if you want to present a paper, or for any questions.
- 7/27: (Part I) Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
Adrian Vladu - 8/11: (Part II) Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
Adrian Vladu - 8/17: Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees
Chris Musco - 8/31: Minimizing Effective Resistance of a Graph, Subgraph Sparsification and Nearly Optimal Ultrasparsifiers Babis Tsourakakis
- Assessing significance in a Markov Chain without mixing by Chikina, Frieze, Pegden
- Testing from One Sample: Is the casino really using a riffle shuffle? by Daskalakis, Dikkala, Gravin
- Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs by Cohen, Kelner, Peebles, Peng, Rao, Sidford, Vladu
- Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees by Chichik, Cohen, Kaplan
- Graph Sparsification by Effective Resistances by Spielman, Srivastava
- Twice-Ramanujan Sparsifiers by Batson, Spielman, Srivastava
- Capacity Releasing Diffusion for Speed and Locality by Wang, Fountoulakis, Henzinger, Mahoney, Rao
- Algorithms for Lipschitz Learning on Graphs by Kyng, Rao, Sachdeva, Spielman
- Towards Deep Learning Models Resistant to Adversarial Attacks by Madry, Makelov, Schmidt, Tsipras, Vladu
- Efficiently learning Ising models on arbitrary graphs by G. Bresler
- Sketching and Neural Networks by Daniely, Lazic, Singer, Talwar
- Semi-Supervised Learning on Graphs through Reach and Distance Diffusion by Edith Cohen
- Hashing Hyperplane Queries to Near Pointswith Applications to Large-Scale Active Learning by Jain, Vijayanarasimhan, Grauman
- Efficient massively parallel methods for dynamic programming by Im, Moseley, Sun
- Set similarity search beyond MinHash by Christiani, Pagh
- Distance-sensitive hashing by Aumüller, Christiani, Pagh, Silvestri
- Jelena Diakonikolas (BU)
- Cameron Musco (MIT)
- Chris Musco (MIT)
- Lorenzo Orecchia (BU/MIT)
- Babis Tsourakakis (BU/Harvard)
- Adrian Vladu (BU/MIT)