Ashwinkumar Badanidiyuru

According to our database, Ashwinkumar Badanidiyuru authored at least 34 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions.

Adel Javanmard, Lin Chen, Vahab Mirrokni, Ashwinkumar Badanidiyuru, Gang Fu

CoRR, 2024

2023

Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization.

Rad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan, Ashwinkumar Badanidiyuru

Manag. Sci., July, 2023

Learning to Bid in Contextual First Price Auctions✱.

Ashwinkumar Badanidiyuru, Zhe Feng, Guru Guruganesh

Proceedings of the ACM Web Conference 2023, 2023

Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts.

Chaoqi Wang, Ziyu Ye, Zhe Feng, Ashwinkumar Badanidiyuru Varadaraja, Haifeng Xu

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimal Unbiased Randomizers for Regression with Label Differential Privacy.

Ashwinkumar Badanidiyuru Varadaraja, Badih Ghazi, Pritish Kamath, Ravi Kumar, Ethan Leeman, Pasin Manurangsi, Avinash V. Varadarajan, Chiyuan Zhang

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Incrementality Bidding via Reinforcement Learning under Mixed and Delayed Rewards.

Ashwinkumar Badanidiyuru Varadaraja, Zhe Feng, Tianxi Li, Haifeng Xu

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Auctioning with Strategically Reticent Bidders.

Jibang Wu, Ashwinkumar Badanidiyuru, Haifeng Xu

CoRR, 2021

Handling many conversions per click in modeling delayed feedback.

Ashwinkumar Badanidiyuru, Andrew Evdokimov, Vinodh Krishnan, Pan Li, Wynn Vonnegut, Jayden Wang

CoRR, 2021

2020

Submodular Maximization Through Barrier Functions.

Ashwinkumar Badanidiyuru, Amin Karbasi, Ehsan Kazemi, Jan Vondrák

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Optimization with Demand Oracles.

Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren

Algorithmica, 2019

Response Prediction for Low-Regret Agents.

Saeed Alaei, Ashwinkumar Badanidiyuru, Mohammad Mahdian, Sadra Yazdanbod

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Autobidding with Constraints.

Gagan Aggarwal, Ashwinkumar Badanidiyuru, Aranyak Mehta

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

2018

Bandits with Knapsacks.

Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins

J. ACM, 2018

Targeting and Signaling in Ad Auctions.

Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2016

Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions.

Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Fast Constrained Submodular Maximization: Personalized Data Summarization.

Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Distributed Submodular Cover: Succinctly Summarizing Massive Data.

Baharan Mirzasoleiman, Amin Karbasi, Ashwinkumar Badanidiyuru, Andreas Krause

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Lazier Than Lazy Greedy.

Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, Andreas Krause

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Sequential Decision Making With Resource Constraints.

Ashwinkumar Badanidiyuru

PhD thesis, 2014

Fast algorithms for maximizing submodular functions.

Ashwinkumar Badanidiyuru, Jan Vondrák

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Streaming submodular maximization: massive data summarization on the fly.

Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Amin Karbasi, Andreas Krause

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Resourceful Contextual Bandits.

Ashwinkumar Badanidiyuru, John Langford, Aleksandrs Slivkins

Proceedings of The 27th Conference on Learning Theory, 2014

Robust Multi-objective Learning with Mentor Feedback.

Alekh Agarwal, Ashwinkumar Badanidiyuru, Miroslav Dudík, Robert E. Schapire, Aleksandrs Slivkins

Proceedings of The 27th Conference on Learning Theory, 2014

2012

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.

Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan

J. ACM, 2012

Sketching valuation functions.

Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Learning on a budget: posted price mechanisms for online procurement.

Ashwinkumar Badanidiyuru, Robert Kleinberg, Yaron Singer

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Approximating low-dimensional coverage problems.

Ashwinkumar Badanidiyuru, Robert Kleinberg, Hooyeon Lee

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Secure message transmission in asynchronous networks.

Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan

J. Parallel Distributed Comput., 2011

Buyback Problem - Approximate Matroid Intersection with Cancellation Costs.

Ashwinkumar Badanidiyuru Varadaraja

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2009

Randomized Online Algorithms for the Buyback Problem.

B. V. Ashwinkumar, Robert Kleinberg

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.

Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008

Perfectly Secure Message Transmission Tolerating Mixed Adversary.

Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan

IACR Cryptol. ePrint Arch., 2008

On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.

B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.

Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan

Proceedings of the Information Theoretic Security, Third International Conference, 2008