Aounon Kumar

According to our database1, Aounon Kumar authored at least 17 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards Safe and Aligned Large Language Models for Medicine.
CoRR, 2024

2023
Robustness of AI-Image Detectors: Fundamental Limits and Practical Attacks.
CoRR, 2023

Certifying LLM Safety against Adversarial Prompting.
CoRR, 2023

Provable Robustness for Streaming Models with a Sliding Window.
CoRR, 2023

Can AI-Generated Text be Reliably Detected?
CoRR, 2023

Provable Robustness against Wasserstein Distribution Shifts via Input Randomization.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Certifying Model Accuracy under Distribution Shifts.
CoRR, 2022

Policy Smoothing for Provably Robust Reinforcement Learning.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Center Smoothing for Certifiably Robust Vector-Valued Functions.
CoRR, 2021

Center Smoothing: Certified Robustness for Networks with Structured Outputs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Tight Second-Order Certificates for Randomized Smoothing.
CoRR, 2020

Detection as Regression: Certified Object Detection by Median Smoothing.
CoRR, 2020

Certifying Confidence via Randomized Smoothing.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Detection as Regression: Certified Object Detection with Median Smoothing.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
On the Cost of Essentially Fair Clusterings.
Proceedings of the Approximation, 2019

2016
Capacitated k-Center Problem with Vertex Weights.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016


  Loading...