default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvishek Ghosh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Avishek Ghosh
, Abishek Sankararaman, Kannan Ramchandran:
Model Selection for Generic Contextual Bandits. IEEE Trans. Inf. Theory 70(1): 656-675 (2024)- [j10]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran, Tara Javidi, Arya Mazumdar:
Competing Bandits in Non-Stationary Matching Markets. IEEE Trans. Inf. Theory 70(4): 2831-2850 (2024) - [j9]Harsh Vardhan, Avishek Ghosh, Arya Mazumdar:
An Improved Federated Clustering Algorithm with Model-based Clustering. Trans. Mach. Learn. Res. 2024 (2024) - [c28]Avishek Ghosh, Arya Mazumdar:
Agnostic Learning of Mixed Linear Regressions with EM and AM Algorithms. ICML 2024 - [c27]Lokesh Nagalapatti, Pranava Singhal, Avishek Ghosh, Sunita Sarawagi:
PairNet: Training with Observed Pairs to Estimate Individual Treatment Effect. ICML 2024 - [c26]Tejas Pagare, Avishek Ghosh:
Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets. ISIT 2024: 2092-2097 - [c25]Souvik Das, Avishek Ghosh, Debasish Chatterjee:
Detection of False Data Injection Attacks in Cyber-Physical Systems. ISIT 2024: 3249-3254 - [c24]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar:
DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized Newton. ISIT 2024: 3642-3647 - [i35]Avishek Ghosh, Arya Mazumdar:
Agnostic Learning of Mixed Linear Regressions with EM and AM Algorithms. CoRR abs/2406.01149 (2024) - [i34]Lokesh Nagalapatti, Pranava Singhal, Avishek Ghosh, Sunita Sarawagi:
PairNet: Training with Observed Pairs to Estimate Individual Treatment Effect. CoRR abs/2406.03864 (2024) - [i33]Tejas Pagare, Avishek Ghosh:
Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets. CoRR abs/2408.08690 (2024) - [i32]Satush Parikh, Soumya Basu, Avishek Ghosh, Abishek Sankararaman:
Competing Bandits in Decentralized Large Contextual Matching Markets. CoRR abs/2411.11794 (2024) - 2023
- [c23]Debangshu Banerjee, Avishek Ghosh, Sayak Ray Chowdhury, Aditya Gopalan:
Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference. AISTATS 2023: 8233-8262 - [c22]Heng Zhu, Avishek Ghosh, Arya Mazumdar:
Optimal Compression of Unit Norm Vectors in the High Distortion Regime. ISIT 2023: 719-724 - [i31]Heng Zhu, Avishek Ghosh, Arya Mazumdar:
Optimal Compression of Unit Norm Vectors in the High Distortion Regime. CoRR abs/2307.07941 (2023) - 2022
- [j8]Avishek Ghosh, Ashwin Pananjady, Adityanand Guntuboyina, Kannan Ramchandran:
Max-Affine Regression: Parameter Estimation for Gaussian Designs. IEEE Trans. Inf. Theory 68(3): 1851-1885 (2022) - [j7]Avishek Ghosh, Jichan Chung, Dong Yin, Kannan Ramchandran:
An Efficient Framework for Clustered Federated Learning. IEEE Trans. Inf. Theory 68(12): 8076-8091 (2022) - [c21]Avishek Ghosh, Abishek Sankararaman:
Breaking the $\sqrt{T}$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits. ICML 2022: 7531-7549 - [c20]Soumyabrata Pal, Arya Mazumdar, Rajat Sen, Avishek Ghosh:
On Learning Mixture of Linear Regressions in the Non-Realizable Setting. ICML 2022: 17202-17220 - [c19]Avishek Ghosh, Sayak Ray Chowdhury:
Model Selection in Reinforcement Learning with General Function Approximations. ECML/PKDD (4) 2022: 148-164 - [c18]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Multi-agent Heterogeneous Stochastic Linear Bandits. ECML/PKDD (4) 2022: 300-316 - [i30]Avishek Ghosh, Abishek Sankararaman:
Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits. CoRR abs/2205.09899 (2022) - [i29]Avishek Ghosh, Arya Mazumdar, Soumyabrata Pal, Rajat Sen:
On Learning Mixture of Linear Regressions in the Non-Realizable Setting. CoRR abs/2205.13166 (2022) - [i28]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran, Tara Javidi, Arya Mazumdar:
Decentralized Competing Bandits in Non-Stationary Matching Markets. CoRR abs/2206.00120 (2022) - [i27]Avishek Ghosh, Sayak Ray Chowdhury:
Model Selection in Reinforcement Learning with General Function Approximations. CoRR abs/2207.02992 (2022) - [i26]Debangshu Banerjee, Avishek Ghosh, Sayak Ray Chowdhury, Aditya Gopalan:
Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference. CoRR abs/2207.11597 (2022) - [i25]Harsh Vardhan, Avishek Ghosh, Arya Mazumdar:
An Improved Algorithm for Clustered Federated Learning. CoRR abs/2210.11538 (2022) - 2021
- [j6]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication-Efficient and Byzantine-Robust Distributed Learning With Error Feedback. IEEE J. Sel. Areas Inf. Theory 2(3): 942-953 (2021) - [c17]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits. AISTATS 2021: 1396-1404 - [c16]Vipul Gupta, Avishek Ghosh, Michal Derezinski, Rajiv Khanna, Kannan Ramchandran, Michael W. Mahoney:
LocalNewton: Reducing communication rounds for distributed learning. UAI 2021: 632-642 - [i24]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar, Kannan Ramchandran:
Escaping Saddle Points in Distributed Newton's Method with Communication efficiency and Byzantine Resilience. CoRR abs/2103.09424 (2021) - [i23]Vipul Gupta, Avishek Ghosh, Michal Derezinski, Rajiv Khanna, Kannan Ramchandran, Michael W. Mahoney:
LocalNewton: Reducing Communication Bottleneck for Distributed Learning. CoRR abs/2105.07320 (2021) - [i22]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Collaborative Learning and Personalization in Multi-Agent Stochastic Linear Bandits. CoRR abs/2106.08902 (2021) - [i21]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Model Selection for Generic Contextual Bandits. CoRR abs/2107.03455 (2021) - [i20]Avishek Ghosh, Sayak Ray Chowdhury, Kannan Ramchandran:
Model Selection with Near Optimal Rates for Reinforcement Learning with General Model Classes. CoRR abs/2107.05849 (2021) - 2020
- [c15]Avishek Ghosh, Kannan Ramchandran:
Alternating Minimization Converges Super-Linearly for Mixed Linear Regression. AISTATS 2020: 1093-1103 - [c14]Avishek Ghosh, Kannan Ramchandran:
Some Performance Guarantees of Global LASSO with Local Assumptions for Convolutional Sparse Design Matrices. ISIT 2020: 1391-1396 - [c13]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar, Kannan Ramchandran:
Communication Efficient Distributed Approximate Newton Method. ISIT 2020: 2539-2544 - [c12]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication Efficient and Byzantine Tolerant Distributed Learning. ISIT 2020: 2545-2550 - [c11]Avishek Ghosh, Ashwin Pananjady, Aditya Guntuboyina, Kannan Ramchandran:
Max-affine regression with universal parameter estimation for small-ball designs. ISIT 2020: 2706-2710 - [c10]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication-Efficient and Byzantine-Robust Distributed Learning. ITA 2020: 1-28 - [c9]Avishek Ghosh, Jichan Chung, Dong Yin, Kannan Ramchandran:
An Efficient Framework for Clustered Federated Learning. NeurIPS 2020 - [c8]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar:
Distributed Newton Can Communicate Less and Resist Byzantine Workers. NeurIPS 2020 - [i19]Avishek Ghosh, Kannan Ramchandran:
Alternating Minimization Converges Super-Linearly for Mixed Linear Regression. CoRR abs/2004.10914 (2020) - [i18]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits. CoRR abs/2006.02612 (2020) - [i17]Avishek Ghosh, Jichan Chung, Dong Yin, Kannan Ramchandran:
An Efficient Framework for Clustered Federated Learning. CoRR abs/2006.04088 (2020) - [i16]Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar:
Distributed Newton Can Communicate Less and Resist Byzantine Workers. CoRR abs/2006.08737 (2020)
2010 – 2019
- 2019
- [j5]Md Mahmud Sazzad, Md Samdani Azad, Avishek Ghosh:
Effects of Vertical Irregularity in Steel Frame with Shear Linked Steel Bracings. J. Adv. Eng. Comput. 3(4): 523-531 (2019) - [c7]Sinho Chewi, Forest Yang, Avishek Ghosh, Abhay Parekh, Kannan Ramchandran:
Matching Observations to Distributions: Efficient Estimation via Sparsified Hungarian Algorithm. Allerton 2019: 368-375 - [i15]Avishek Ghosh, Justin Hong, Dong Yin, Kannan Ramchandran:
Robust Federated Learning in a Heterogeneous Environment. CoRR abs/1906.06629 (2019) - [i14]Avishek Ghosh, Ashwin Pananjady, Adityanand Guntuboyina, Kannan Ramchandran:
Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical Estimation. CoRR abs/1906.09255 (2019) - [i13]Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication-Efficient and Byzantine-Robust Distributed Learning. CoRR abs/1911.09721 (2019) - 2018
- [j4]Arpan Chattopadhyay, Avishek Ghosh, Anurag Kumar:
Asynchronous Stochastic Approximation Based Learning Algorithms for As-You-Go Deployment of Wireless Relay Networks Along a Line. IEEE Trans. Mob. Comput. 17(5): 1004-1018 (2018) - [c6]Avishek Ghosh, Kannan Ramchandran:
Online Scoring with Delayed Information: A Convex Optimization Viewpoint. Allerton 2018: 454-461 - [c5]Avishek Ghosh, Kannan Ramchandran:
Faster Data-access in Large-scale Systems: Network-scale Latency Analysis under General Service-time Distributions. Allerton 2018: 757-764 - [i12]Sinho Chewi, Forest Yang, Avishek Ghosh, Abhay Parekh, Kannan Ramchandran:
Online Absolute Ranking with Partial Information: A Bipartite Graph Matching Approach. CoRR abs/1806.06766 (2018) - [i11]Avishek Ghosh, Kannan Ramchandran:
Faster Data-access in Large-scale Systems: Network-scale Latency Analysis under General Service-time Distributions. CoRR abs/1807.02253 (2018) - [i10]Avishek Ghosh, Kannan Ramchandran:
Online Scoring with Delayed Information: A Convex Optimization Viewpoint. CoRR abs/1807.03379 (2018) - 2017
- [j3]Avishek Ghosh, Arpan Chattopadhyay, Anish Arora, Anurag Kumar:
Measurement Based As-You-Go Deployment of Two-Connected Wireless Relay Networks. ACM Trans. Sens. Networks 13(3): 23:1-23:23 (2017) - [c4]Avishek Ghosh, Sayak Ray Chowdhury, Aditya Gopalan:
Misspecified Linear Bandits. AAAI 2017: 3761-3767 - [i9]Avishek Ghosh, Sayak Ray Chowdhury, Aditya Gopalan:
Misspecified Linear Bandits. CoRR abs/1704.06880 (2017) - [i8]Arpan Chattopadhyay, Avishek Ghosh, Anurag Kumar:
Asynchronous Stochastic Approximation Based Learning Algorithms for As-You-Go Deployment of Wireless Relay Networks along a Line. CoRR abs/1709.01566 (2017) - 2014
- [c3]Arpan Chattopadhyay, Avishek Ghosh, Akhila S. Rao, Bharat Dwivedi, S. V. R. Anand, Marceau Coupechoux, Anurag Kumar:
Impromptu Deployment of Wireless Relay Networks: Experiences Along a Forest Trail. MASS 2014: 232-236 - [i7]Arpan Chattopadhyay, Avishek Ghosh, Akhila Rao, Bharat Dwivedi, S. V. R. Anand, Marceau Coupechoux, Anurag Kumar:
Impromptu Deployment of Wireless Relay Networks: Experiences Along a Forest Trail. CoRR abs/1409.3940 (2014) - 2013
- [j2]Arkabandhu Chowdhury, Arnab Ghosh, Subhajit Sinha, Swagatam Das, Avishek Ghosh:
A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem. Int. J. Bio Inspired Comput. 5(5): 303-314 (2013) - 2012
- [c2]Avishek Ghosh, Arnab Ghosh, Arkabandhu Chowdhury, Amit Konar, Eunjin Kim, Atulya K. Nagar:
Linear phase low pass FIR filter design using Genetic Particle Swarm Optimization with dynamically varying neighbourhood technique. IEEE Congress on Evolutionary Computation 2012: 1-7 - [i6]Souvik Naskar, Avishek Ghosh, Pabitra Pal Choudhury:
Application of Integral Value Transformation (IVT) in a Specialized Computer Network Design. CoRR abs/1201.4329 (2012) - [i5]Arnab Ghosh, Avishek Ghosh, Arkabandhu Chowdhury, Amit Konar:
An Evolutionary Approach to Drug-Design Using a Novel Neighbourhood Based Genetic Algorithm. CoRR abs/1205.6412 (2012) - [i4]Avishek Ghosh, Arnab Ghosh, Arkabandhu Chowdhury, Jubin Hazra:
An Evolutionary Approach to Drug-Design Using Quantam Binary Particle Swarm Optimization Algorithm. CoRR abs/1206.4588 (2012) - [i3]Arnab Ghosh, Avishek Ghosh, Arkabandhu Chowdhury, Amit Konar, Ramadoss Janarthanan:
Multi-robot Cooperative Box-pushing problem using Multi-objective Particle Swarm Optimization Technique. CoRR abs/1206.5170 (2012) - 2011
- [i2]Avishek Ghosh, Joydeep Banerjee, Sarif Sk. Hassan, Pabitra Pal Choudhury:
Fractal String Generation and Its Application in Music Composition. CoRR abs/1109.6270 (2011) - [i1]Sarif Sk. Hassan, Pabitra Pal Choudhury, Birendra Kumar Nayak, Avishek Ghosh, Joydeep Banerjee:
Integral Value Transformations: A Class of Affine Discrete Dynamical Systems and an Application. CoRR abs/1110.0724 (2011)
2000 – 2009
- 2009
- [c1]Ananthakrishnan Ramanathan, Hansraj Choudhary, Avishek Ghosh, Pushpak Bhattacharyya:
Case markers and Morphology: Addressing the crux of the fluency problem in English-Hindi SMT. ACL/IJCNLP 2009: 800-808 - 2008
- [j1]Narendra S. Chaudhari, Avishek Ghosh:
Feature Extraction Using Fuzzy Rule Based System. Int. J. Comput. Sci. Appl. 5(3): 1-8 (2008)
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 2025-01-02 18:09 CET 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:
