I will be joining the Ms/PhD program at the College of Information and Computer Sciences, University of Massachusetts Amherst in Fall 2017.

I am interested in Machine Learning Theory, Multi-Armed Bandits, Reinforcement Learning and Optimization.

I have been trying to prove that Euclidean Distance Matrix Completion has No Spurious Local Minima, using the technique presented in this paper by Rong Ge et.al. Currently this proof is incomplete. Here is a rough draft of where my proof stands and a document outlining the Similarities between Euclidean Distance Matrix Completion and PSD Matrix Completion.

I was a Budding Scientist at Conduent Labs/Xerox Research Center India from 2016 to 2017. I graduted from the Indian Institute of Technology, Kharagpur with a Bachelor’s degree in Computer Science and Engineering in 2016. You can find my CV here :CV

I also write a blog about some of the things I encounter during my research.

## Publications

### 2017

- Pure Exploration in Episodic Fixed-Horizon Markov Decision Processes
**Sudeep Raja Putta**, Theja Tulabandhula

AAMAS 2017. Short paper. - Efficient Reinforcement Learning via Initial Pure Exploration
**Sudeep Raja Putta**, Theja Tulabandhula

RLDM 2017.

Some old projects I did in my undergrad: Projects