2 code implementations • 21 Apr 2023 • Yanli Zhao, Andrew Gu, Rohan Varma, Liang Luo, Chien-chin Huang, Min Xu, Less Wright, Hamid Shojanazeri, Myle Ott, Sam Shleifer, Alban Desmaison, Can Balioglu, Pritam Damania, Bernard Nguyen, Geeta Chauhan, Yuchen Hao, Ajit Mathews, Shen Li
It is widely acknowledged that large models have the potential to deliver superior performance across a broad range of domains.
3 code implementations • 28 Jun 2020 • Shen Li, Yanli Zhao, Rohan Varma, Omkar Salpekar, Pieter Noordhuis, Teng Li, Adam Paszke, Jeff Smith, Brian Vaughan, Pritam Damania, Soumith Chintala
This paper presents the design, implementation, and evaluation of the PyTorch distributed data parallel module.
1 code implementation • 29 May 2019 • Rohan Varma, Harlin Lee, Jelena Kovačević, Yuejie Chi
This work studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued.
1 code implementation • 26 Sep 2018 • Rohan Varma, Jelena Kovačević
In this paper, we extend the sampling theory on graphs by constructing a framework that exploits the structure in product graphs for efficient sampling and recovery of bandlimited graph signals that lie on them.
no code implementations • 16 Dec 2015 • Siheng Chen, Rohan Varma, Aarti Singh, Jelena Kovačević
For each class, we provide an explicit definition of the graph signals and construct a corresponding graph dictionary with desirable properties.
no code implementations • 21 Jul 2015 • Siheng Chen, Rohan Varma, Aarti Singh, Jelena Kovačević
In this paper, we consider a statistical problem of learning a linear model from noisy samples.
no code implementations • 21 Apr 2015 • Siheng Chen, Rohan Varma, Aarti Singh, Jelena Kovačević
We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling.