Ayan Acharya

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Kayhan Behdin

> Home > Persons > Ayan Acharya

Publications

2023
[i14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2302-09693
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2302-09693
Kayhan Behdin, Qingquan Song, Aman Gupta, Ayan Acharya, David Durfee, Borja Ocejo, S. Sathiya Keerthi, Rahul Mazumder:
mSAM: Micro-Batch-Averaged Sharpness-Aware Minimization. CoRR abs/2302.09693 (2023)
[i13]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-01885
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-01885
Kayhan Behdin, Ayan Acharya, Aman Gupta, Sathiya Keerthi Selvaraj, Rahul Mazumder:
QuantEase: Optimization-based Quantization for Language Models - An Efficient and Intuitive Algorithm. CoRR abs/2309.01885 (2023)
2022
[i12]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2212-04343
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2212-04343
Kayhan Behdin, Qingquan Song, Aman Gupta, David Durfee, Ayan Acharya, S. Sathiya Keerthi, Rahul Mazumder:
Improved Deep Neural Network Generalization Using m-Sharpness-Aware Minimization. CoRR abs/2212.04343 (2022)

a service of

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.