Aditya Gangrade

According to our database1, Aditya Gangrade authored at least 17 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
Label Noise: Ignorance Is Bliss.
CoRR, 2024

Testing the Feasibility of Linear Programs with Bandit Feedback.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Safe Linear Bandits over Unknown Polytopes.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Counterfactually Comparing Abstaining Classifiers.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Efficient Edge Inference by Selective Query.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Scaffolding a Student to Instill Knowledge.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
A Doubly Optimistic Strategy for Safe Linear Bandits.
CoRR, 2022

Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and Risk.
Proceedings of the International Conference on Machine Learning, 2022

2021
Online Selective Classification with Limited Feedback.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Selective Classification via One-Sided Prediction.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Limits on Testing Structural Changes in Ising Models.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Piecewise Linear Regression via a Difference of Convex Functions.
Proceedings of the 37th International Conference on Machine Learning, 2020

Budget Learning via Bracketing.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Efficient Near-Optimal Testing of Community Changes in Balanced Stochastic Block Models.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Testing Changes in Communities for the Stochastic Block Model.
CoRR, 2018

Two-Sample Testing can be as Hard as Structure Learning in Ising Models: Minimax Lower Bounds.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

2017
Lower bounds for two-sample structural change detection in ising and Gaussian models.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017


  Loading...