Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2022
Asymptotic Convergence Rate of Dropout on Shallow Linear Neural Networks
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), Volume 6, Issue 2Article No.: 32, Pages 1–53https://doi.org/10.1145/3530898We analyze the convergence rate of gradient flows on objective functions induced by Dropout and Dropconnect, when applying them to shallow linear Neural Networks(NN) ---which can also be viewed as doing matrix factorization using a particular ...
- research-articleJune 2020
Fundamental Limits on the Regret of Online Network-Caching
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), Volume 4, Issue 2Article No.: 25, Pages 1–31https://doi.org/10.1145/3392143Optimal caching of files in a content distribution network (CDN) is a problem of fundamental and growing commercial interest. Although many different caching algorithms are in use today, the fundamental performance limits of network caching algorithms ...
- research-articleMay 2020
Fiedler Vector Approximation via Interacting Random Walks
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), Volume 4, Issue 1Article No.: 01, Pages 1–28https://doi.org/10.1145/3379502The Fiedler vector of a graph, namely the eigenvector corresponding to the second smallest eigenvalue of a graph Laplacian matrix, plays an important role in spectral graph theory with applications in problems such as graph bi-partitioning and envelope ...
- research-articleMarch 2019
Non-Markovian Monte Carlo on Directed Graphs
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), Volume 3, Issue 1Article No.: 15, Pages 1–31https://doi.org/10.1145/3322205.3311086Markov Chain Monte Carlo (MCMC) has been the de facto technique for sampling and inference of large graphs such as online social networks. At the heart of MCMC lies the ability to construct an ergodic Markov chain that attains any given stationary ...
- research-articleJune 2018
Dandelion++: Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees
- Giulia Fanti,
- Shaileshh Bojja Venkatakrishnan,
- Surya Bakshi,
- Bradley Denby,
- Shruti Bhargava,
- Andrew Miller,
- Pramod Viswanath
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), Volume 2, Issue 2Article No.: 29, Pages 1–35https://doi.org/10.1145/3224424Recent work has demonstrated significant anonymity vulnerabilities in Bitcoin's networking stack. In particular, the current mechanism for broadcasting Bitcoin transactions allows third-party observers to link transactions to the IP addresses that ...
- research-articleDecember 2017
The PDE Method for the Analysis of Randomized Load Balancing Networks
Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), Volume 1, Issue 2Article No.: 38, Pages 1–28https://doi.org/10.1145/3154497We introduce a new framework for the analysis of large-scale load balancing networks with general service time distributions, motivated by applications in server farms, distributed memory machines, cloud computing and communication systems. For a ...