Euclidean k-Means with Center Proximity
Talk, INRIA Lille, Lille, France
Gave a talk at the INRIA Lille on our work on clustering Euclidean $ k $-Means with Center Proximity Link to the announcement.
Talks and Presentations
On Euclidean k-means with α-Center Proximity
Talk, ICTS-TIFR, Bangalore, India
Gave a poster talk and presented poster on our work (joint work with Dr Amit Deshpande and Dr Anand Louis) on Euclidean $k$-Means Clustering with $\alpha$-Center Proximity at Advances in Applied Probability workshop at ICTS-TIFR, Bangalore. Click here for the poster, here for the slides, and here for the 8 min talk video.
Igniting the AI fire in you (carefully)
Talk, CSA, IISc, Bangalore, India
This talk was a part of the orientation program for the pioneers of the Masters of Technology in Artificial Intelligence program. The aim of the talk was to introduce the new students to the area of ethical algorithms, by focusing mostly on fair algorithms. The material for this talk was taken from Aaron Roth’s talk on “The Ethical Algorithm”. Find the slides here.
On Euclidean k-means with α-Center Proximity
Poster, AISTATIS 2019, LOISIR Hotel, Naha, Okinawa, Japan
Presented our poster on our work (joint work with Dr Amit Deshpande and Dr Anand Louis) on Euclidean $k$-Means Clustering with $\alpha$-Center Proximity. Click here for the poster.
Clustering Perturbation Resilient Instances
Talk, IIIT-Bangalore, Bangalore, India
Gave a talk at the IIIT Bangalore Theory Club on our work on clustering with center proximity and min-max k-means problem. Link to the slides.
Gradient Descent Converges to Minimizers
Talk, Microsoft Research, Bangalore, India
Gave a talk in the Microsoft Research (MSR) - IISc theory reading group on the COLT 2016 paper by Lee et al., “Gradient Descent Converges to Minimizers”.