Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Choudhury, Anamitra"'
Autor:
Chakaravarthy, Venkatesan T., Seshadri, Padmanabha V., Aggarwal, Pooja, Choudhury, Anamitra R., Kumar, Ashok Pon, Sabharwal, Yogish, Singhee, Amith
In conventional public clouds, designing a suitable initial cluster for a given application workload is important in reducing the computational foot-print during run-time. In edge or on-premise clouds, cold-start rightsizing the cluster at the time o
Externí odkaz:
http://arxiv.org/abs/2112.11597
Autor:
Goyal, Saurabh, Choudhury, Anamitra R., Raje, Saurabh M., Chakaravarthy, Venkatesan T., Sabharwal, Yogish, Verma, Ashish
We develop a novel method, called PoWER-BERT, for improving the inference time of the popular BERT model, while maintaining the accuracy. It works by: a) exploiting redundancy pertaining to word-vectors (intermediate encoder outputs) and eliminating
Externí odkaz:
http://arxiv.org/abs/2001.08950
Autor:
Vooturi, Dharma Teja, Goyal, Saurabh, Choudhury, Anamitra R., Sabharwal, Yogish, Verma, Ashish
Large number of weights in deep neural networks makes the models difficult to be deployed in low memory environments such as, mobile phones, IOT edge devices as well as "inferencing as a service" environments on cloud. Prior work has considered reduc
Externí odkaz:
http://arxiv.org/abs/1711.00244
Publikováno v:
In Discrete Optimization November 2020 38
Online algorithms are usually analyzed using the notion of competitive ratio which compares the solution obtained by the algorithm to that obtained by an online adversary for the worst possible input sequence. Often this measure turns out to be too p
Externí odkaz:
http://arxiv.org/abs/1410.1839
Autor:
Agarwal, Archita, Chakaravarthy, Venkatesan T., Choudhury, Anamitra R., Roy, Sambuddha, Sabharwal, Yogish
In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval
Externí odkaz:
http://arxiv.org/abs/1312.7217
We describe a primal-dual framework for the design and analysis of online convex optimization algorithms for {\em drifting regret}. Existing literature shows (nearly) optimal drifting regret bounds only for the $\ell_2$ and the $\ell_1$-norms. Our wo
Externí odkaz:
http://arxiv.org/abs/1309.5904
Publikováno v:
In Journal of Computer and System Sciences February 2018 91:42-68
Autor:
Saurabh Gupta, Choudhury, Anamitra R., Raje, Saurabh M., Chakaravarthy, Venkatesan T., Sabharwal, Yogish, Verma, Ashish
Publikováno v:
Web of Science
We develop a novel method, called PoWER-BERT, for improving the inference time of the popular BERT model, while maintaining the accuracy. It works by: a) exploiting redundancy pertaining to word-vectors (intermediate encoder outputs) and eliminating
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::103c9343bff40488551cfe811c081faa
Autor:
Chakaravarthy, Venkatesan1 vechakra@in.ibm.com, Choudhury, Anamitra1 anamchou@in.ibm.com, Garg, Vijay2 garg@ece.utexas.edu, Sabharwal, Yogish1 ysabharwal@in.ibm.com
Publikováno v:
Theory of Computing Systems. Nov2012, Vol. 51 Issue 4, p447-473. 27p. 2 Diagrams, 1 Chart.