default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAritra Dutta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]El Houcine Bergou
, Soumia Boucherouite, Aritra Dutta, Xin Li, Anna Ma:
A Note on the Randomized Kaczmarz Algorithm for Solving Doubly Noisy Linear Systems. SIAM J. Matrix Anal. Appl. 45(2): 992-1006 (2024)- [c14]Aritra Dutta, Srijan Das, Jacob Nielsen, Rajatsubhra Chakraborty, Mubarak Shah:
Multiview Aerial Visual Recognition (MAVREC): Can Multi-View Improve Aerial Visual Perception? CVPR 2024: 22678-22690 - [i18]Guangyu Sun, Matías Mendieta, Aritra Dutta, Xin Li, Chen Chen:
Towards Multi-modal Transformers in Federated Learning. CoRR abs/2404.12467 (2024) - [i17]Ali Khaleghi Rahimian, Manish Kumar Govind, Subhajit Maity, Dominick Reilly, Christian Kümmerle, Srijan Das, Aritra Dutta:
Fibottention: Inceptive Visual Representation Learning with Diverse Attention Across Heads. CoRR abs/2406.19391 (2024) - 2023
- [j5]El Houcine Bergou, Konstantin Burlachenko, Aritra Dutta, Peter Richtárik:
Personalized Federated Learning with Communication Compression. Trans. Mach. Learn. Res. 2023 (2023) - [i16]El Houcine Bergou, Soumia Boucherouite, Aritra Dutta, Xin Li, Anna Ma:
A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems. CoRR abs/2308.16904 (2023) - [i15]Aritra Dutta, El Houcine Bergou, Soumia Boucherouite, Nicklas Werge, Melih Kandemir, Xin Li:
Demystifying the Myths and Legends of Nonconvex Convergence of SGD. CoRR abs/2310.12969 (2023) - [i14]Aritra Dutta, Srijan Das, Jacob Nielsen, Rajatsubhra Chakraborty, Mubarak Shah:
Multiview Aerial Visual Recognition (MAVREC): Can Multi-view Improve Aerial Visual Perception? CoRR abs/2312.04548 (2023) - [i13]Aritra Dutta, G. Suseela, Asmita Sood:
Robust Multi-Modal Image Stitching for Improved Scene Understanding. CoRR abs/2312.17010 (2023) - 2022
- [j4]Aritra Dutta, El Houcine Bergou, Yunming Xiao, Marco Canini, Peter Richtárik:
Direct nonlinear acceleration. EURO J. Comput. Optim. 10: 100047 (2022) - [i12]El Houcine Bergou, Konstantin Burlachenko, Aritra Dutta, Peter Richtárik:
Personalized Federated Learning with Communication Compression. CoRR abs/2209.05148 (2022) - 2021
- [c13]Hang Xu, Chen-Yu Ho, Ahmed M. Abdelmoniem, Aritra Dutta, El Houcine Bergou, Konstantinos Karatsenidis, Marco Canini, Panos Kalnis:
GRACE: A Compressed Communication Framework for Distributed Machine Learning. ICDCS 2021: 561-572 - [c12]Aritra Dutta, Rwitam Jana, Arup Kumar Das:
On Column Competent Matrices and Linear Complementarity Problem. ICMC 2021: 615-625 - [c11]Atal Narayan Sahu, Aritra Dutta, Ahmed M. Abdelmoniem, Trambak Banerjee, Marco Canini, Panos Kalnis:
Rethinking gradient sparsification as total error minimization. NeurIPS 2021: 8133-8146 - [c10]Hang Xu, Kelly Kostopoulou, Aritra Dutta, Xin Li, Alexandros Ntoulas, Panos Kalnis:
DeepReduce: A Sparse-tensor Communication Framework for Federated Deep Learning. NeurIPS 2021: 21150-21163 - [i11]Kelly Kostopoulou, Hang Xu, Aritra Dutta, Xin Li, Alexandros Ntoulas, Panos Kalnis:
DeepReduce: A Sparse-tensor Communication Framework for Distributed Deep Learning. CoRR abs/2102.03112 (2021) - [i10]Atal Narayan Sahu, Aritra Dutta, Ahmed M. Abdelmoniem, Trambak Banerjee, Marco Canini, Panos Kalnis:
Rethinking gradient sparsification as total error minimization. CoRR abs/2108.00951 (2021) - 2020
- [j3]Aritra Dutta, Filip Hanzely, Jingwei Liang, Peter Richtárik:
Best Pair Formulation & Accelerated Scheme for Non-Convex Principal Component Pursuit. IEEE Trans. Signal Process. 68: 6128-6141 (2020) - [c9]Aritra Dutta, El Houcine Bergou, Ahmed M. Abdelmoniem, Chen-Yu Ho, Atal Narayan Sahu, Marco Canini, Panos Kalnis:
On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learning. AAAI 2020: 3817-3824 - [c8]Rishikesh R. Gajjala, Shashwat Banchhor, Ahmed M. Abdelmoniem, Aritra Dutta, Marco Canini, Panos Kalnis:
Huffman Coding Based Encoding Techniques for Fast Distributed Deep Learning. DistributedML@CoNEXT 2020: 21-27 - [i9]Atal Narayan Sahu, Aritra Dutta, Aashutosh Tiwari, Peter Richtárik:
On the Convergence Analysis of Asynchronous SGD for Solving Consistent Linear Systems. CoRR abs/2004.02163 (2020)
2010 – 2019
- 2019
- [c7]Aritra Dutta, Filip Hanzely, Peter Richtárik:
A Nonconvex Projection Method for Robust PCA. AAAI 2019: 1468-1476 - [c6]Aritra Dutta, Peter Richtárik:
Online and Batch Supervised Background Estimation Via L1 Regression. WACV 2019: 541-550 - [i8]Aritra Dutta, Filip Hanzely, Jingwei Liang, Peter Richtárik:
Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit. CoRR abs/1905.10598 (2019) - [i7]Aritra Dutta, El Houcine Bergou, Yunming Xiao, Marco Canini, Peter Richtárik:
Direct Nonlinear Acceleration. CoRR abs/1905.11692 (2019) - [i6]Aritra Dutta, El Houcine Bergou, Ahmed M. Abdelmoniem, Chen-Yu Ho, Atal Narayan Sahu, Marco Canini, Panos Kalnis:
On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learning. CoRR abs/1911.08250 (2019) - 2018
- [c5]Aritra Dutta, Xin Li:
A Fast Weighted SVT Algorithm. ICSAI 2018: 1022-1026 - [i5]Aritra Dutta, Xin Li, Peter Richtárik:
Weighted Low-Rank Approximation of Matrices and Background Modeling. CoRR abs/1804.06252 (2018) - [i4]Aritra Dutta, Filip Hanzely, Peter Richtárik:
A Nonconvex Projection Method for Robust PCA. CoRR abs/1805.07962 (2018) - 2017
- [j2]Aritra Dutta, Xin Li:
On a Problem of Weighted Low-Rank Approximation of Matrices. SIAM J. Matrix Anal. Appl. 38(2): 530-553 (2017) - [j1]Brian Millikan, Aritra Dutta, Qiyu Sun, Hassan Foroosh:
Fast Detection of Compressively Sensed IR Targets Using Stochastically Trained Least Squares and Compressed Quadratic Correlation Filters. IEEE Trans. Aerosp. Electron. Syst. 53(5): 2449-2461 (2017) - [c4]Xin Li, Aritra Dutta, Peter Richtárik:
A Batch-Incremental Video Background Estimation Model Using Weighted Low-Rank Approximation of Matrices. ICCV Workshops 2017: 1835-1843 - [c3]Xin Li, Aritra Dutta:
Weighted Low Rank Approximation for Background Estimation Problems. ICCV Workshops 2017: 1853-1861 - [c2]Aritra Dutta, Xin Li:
A fast algorithm for a weighted low rank approximation. MVA 2017: 93-96 - [i3]Aritra Dutta, Xin Li, Peter Richtárik:
A Batch-Incremental Video Background Estimation Model using Weighted Low-Rank Approximation of Matrices. CoRR abs/1707.00281 (2017) - [i2]Aritra Dutta, Xin Li:
Weighted Low Rank Approximation for Background Estimation Problems. CoRR abs/1707.01753 (2017) - [i1]Aritra Dutta, Peter Richtárik:
Online and Batch Supervised Background Estimation via L1 Regression. CoRR abs/1712.02249 (2017) - 2015
- [c1]Brian Millikan, Aritra Dutta, Nazanin Rahnavard, Qiyu Sun, Hassan Foroosh:
Initialized iterative reweighted least squares for automatic target recognition. MILCOM 2015: 506-510
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
