Amartya Sanyal

Orcid: 0000-0002-4190-0449

According to our database1, Amartya Sanyal authored at least 31 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
Provable Privacy with Non-Private Pre-Processing.
CoRR, 2024

On the Growth of Mistakes in Differentially Private Online Learning: A Lower Bound Perspective.
CoRR, 2024

Corrective Machine Unlearning.
CoRR, 2024

2023
How robust accuracy suffers from certified training with convex relaxations.
CoRR, 2023

PILLAR: How to make semi-private learning more effective.
CoRR, 2023

Sample-efficient private data release for Lipschitz functions under sparsity assumptions.
CoRR, 2023

Can semi-supervised learning use all the data effectively? A lower bound perspective.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Certifying Ensembles: A General Certification Theory with S-Lipschitzness.
Proceedings of the International Conference on Machine Learning, 2023

How robust is unsupervised representation learning to distribution shift?
Proceedings of the Eleventh International Conference on Learning Representations, 2023

A law of adversarial risk, interpolation, and label noise.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Do you pay for Privacy in Online learning?
CoRR, 2022

How robust are pre-trained models to distribution shift?
CoRR, 2022

Catastrophic overfitting is a bug but also a feature.
CoRR, 2022

Make Some Noise: Reliable and Efficient Single-Step Adversarial Training.
CoRR, 2022

How unfair is private learning?
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Make Some Noise: Reliable and Efficient Single-Step Adversarial Training.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Identifying and exploiting structures for reliable deep learning
PhD thesis, 2021

Identifying and Exploiting Structures for Reliable Deep Learning.
CoRR, 2021

How Benign is Benign Overfitting ?
Proceedings of the 9th International Conference on Learning Representations, 2021

Progressive Skeletonization: Trimming more fat from a network at initialization.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Identification and utilization of copy number information for correcting Hi-C contact map of cancer cell lines.
BMC Bioinform., 2020

Hierarchical discovery of large-scale and focal copy number alterations in low-coverage cancer genomes.
BMC Bioinform., 2020

Calibrating Deep Neural Networks using Focal Loss.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Stable Rank Normalization for Improved Generalization in Neural Networks and GANs.
Proceedings of the 8th International Conference on Learning Representations, 2020

2018
Optimizing non-decomposable measures with deep networks.
Mach. Learn., 2018

Low Rank Structure of Learned Representations.
CoRR, 2018

TAPAS: Tricks to Accelerate (encrypted) Prediction As a Service.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Agent based simulation of the evolution of society as an alternate maximization problem.
CoRR, 2017

Multiscale sequence modeling with a learned dictionary.
CoRR, 2017

Agent based simulation of the evolution of society as an alternate maximzation problem.
Proceedings of the 2017 International Conference on Behavioral, 2017

2016
A Hybrid Deep Architecture for Face Recognition in Real-Life Scenario.
Proceedings of the Computer Vision, Graphics, and Image Processing, 2016


  Loading...