Muni Sreenivas Pydi

Orcid: 0000-0003-0311-150X

According to our database1, Muni Sreenivas Pydi authored at least 14 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Many Faces of Adversarial Risk: An Expanded Study.
IEEE Trans. Inf. Theory, January, 2024

Optimal Budgeted Rejection Sampling for Generative Models.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Differentially Private Gradient Flow based on the Sliced Wasserstein Distance for Non-Parametric Generative Modeling.
CoRR, 2023

Training Normalizing Flows with the Precision-Recall Divergence.
CoRR, 2023

Robust empirical risk minimization via Newton's method.
CoRR, 2023

Precision-Recall Divergence Optimization for Generative Modeling with GANs and Normalizing Flows.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Role of Randomization in Adversarially Robust Classification.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2021
Adversarial Risk via Optimal Transport and Optimal Couplings.
IEEE Trans. Inf. Theory, 2021

The Many Faces of Adversarial Risk.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2019
Active Learning with Importance Sampling.
CoRR, 2019

2018
On Consistency of Compressive Spectral Clustering.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Graph-Based Ascent Algorithms for Function Maximization.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Analytic Connectivity in General Hypergraphs.
CoRR, 2017

Random access retransmission scheme for power limited nodes.
Proceedings of the Twenty-third National Conference on Communications, 2017


  Loading...