default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAounon Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i15]Martin Pawelczyk, Lillian Sun, Zhenting Qi, Aounon Kumar, Himabindu Lakkaraju:
Generalizing Trust: Weak-to-Strong Trustworthiness in Language Models. CoRR abs/2501.00418 (2025)- 2024
- [c10]Mehrdad Saberi, Vinu Sankar Sadasivan, Keivan Rezaei, Aounon Kumar, Atoosa Malemir Chegini, Wenxiao Wang, Soheil Feizi:
Robustness of AI-Image Detectors: Fundamental Limits and Practical Attacks. ICLR 2024 - [c9]Tessa Han, Aounon Kumar, Chirag Agarwal, Himabindu Lakkaraju:
MedSafetyBench: Evaluating and Improving the Medical Safety of Large Language Models. NeurIPS 2024 - [i14]Tessa Han, Aounon Kumar, Chirag Agarwal, Himabindu Lakkaraju:
Towards Safe and Aligned Large Language Models for Medicine. CoRR abs/2403.03744 (2024) - [i13]Aounon Kumar, Himabindu Lakkaraju:
Manipulating Large Language Models to Increase Product Visibility. CoRR abs/2404.07981 (2024) - 2023
- [b1]Aounon Kumar:
Extending the Scope of Provable Adversarial Robustness in Machine Learning. University of Maryland, College Park, MD, USA, 2023 - [c8]Aounon Kumar, Alexander Levine, Tom Goldstein, Soheil Feizi:
Provable Robustness against Wasserstein Distribution Shifts via Input Randomization. ICLR 2023 - [i12]Vinu Sankar Sadasivan, Aounon Kumar, Sriram Balasubramanian, Wenxiao Wang, Soheil Feizi:
Can AI-Generated Text be Reliably Detected? CoRR abs/2303.11156 (2023) - [i11]Aounon Kumar, Vinu Sankar Sadasivan, Soheil Feizi:
Provable Robustness for Streaming Models with a Sliding Window. CoRR abs/2303.16308 (2023) - [i10]Aounon Kumar, Chirag Agarwal, Suraj Srinivas, Soheil Feizi, Hima Lakkaraju:
Certifying LLM Safety against Adversarial Prompting. CoRR abs/2309.02705 (2023) - [i9]Mehrdad Saberi, Vinu Sankar Sadasivan, Keivan Rezaei, Aounon Kumar, Atoosa Malemir Chegini, Wenxiao Wang, Soheil Feizi:
Robustness of AI-Image Detectors: Fundamental Limits and Practical Attacks. CoRR abs/2310.00076 (2023) - 2022
- [c7]Aounon Kumar, Alexander Levine, Soheil Feizi:
Policy Smoothing for Provably Robust Reinforcement Learning. ICLR 2022 - [i8]Aounon Kumar, Alexander Levine, Tom Goldstein, Soheil Feizi:
Certifying Model Accuracy under Distribution Shifts. CoRR abs/2201.12440 (2022) - 2021
- [c6]Aounon Kumar, Tom Goldstein:
Center Smoothing: Certified Robustness for Networks with Structured Outputs. NeurIPS 2021: 5560-5575 - [i7]Aounon Kumar, Tom Goldstein:
Center Smoothing for Certifiably Robust Vector-Valued Functions. CoRR abs/2102.09701 (2021) - [i6]Aounon Kumar, Alexander Levine, Soheil Feizi:
Policy Smoothing for Provably Robust Reinforcement Learning. CoRR abs/2106.11420 (2021) - 2020
- [c5]Aounon Kumar, Alexander Levine, Tom Goldstein, Soheil Feizi:
Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness. ICML 2020: 5458-5467 - [c4]Ping-yeh Chiang, Michael J. Curry, Ahmed Abdelkader, Aounon Kumar, John Dickerson, Tom Goldstein:
Detection as Regression: Certified Object Detection with Median Smoothing. NeurIPS 2020 - [c3]Aounon Kumar, Alexander Levine, Soheil Feizi, Tom Goldstein:
Certifying Confidence via Randomized Smoothing. NeurIPS 2020 - [i5]Aounon Kumar, Alexander Levine, Tom Goldstein, Soheil Feizi:
Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness. CoRR abs/2002.03239 (2020) - [i4]Ping-yeh Chiang, Michael J. Curry, Ahmed Abdelkader, Aounon Kumar, John P. Dickerson, Tom Goldstein:
Detection as Regression: Certified Object Detection by Median Smoothing. CoRR abs/2007.03730 (2020) - [i3]Aounon Kumar, Alexander Levine, Soheil Feizi, Tom Goldstein:
Certifying Confidence via Randomized Smoothing. CoRR abs/2009.08061 (2020) - [i2]Alexander Levine, Aounon Kumar, Thomas A. Goldstein, Soheil Feizi:
Tight Second-Order Certificates for Randomized Smoothing. CoRR abs/2010.10549 (2020)
2010 – 2019
- 2019
- [c2]Ioana Oriana Bercea
, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the Cost of Essentially Fair Clusterings. APPROX-RANDOM 2019: 18:1-18:22 - 2018
- [i1]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the cost of essentially fair clusterings. CoRR abs/1811.10319 (2018) - 2016
- [c1]Aounon Kumar:
Capacitated k-Center Problem with Vertex Weights. FSTTCS 2016: 8:1-8:14
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-02-08 00:51 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:
