Deep Karkhanis
Research Fellow | Microsoft Research
Computer Science
IIT Bombay, India
Internships
RWTH Aachen | Prof. Joost-Pieter Katoen
Summer 2019
Incorporated Counting-SAT to compute Bounded Reachability Probabilities in MDPs in one shot
Designed a succinct CNF representation for Markov Chains using the transition probabilities BDD to get a 10x faster algorithm
IST Austria | Prof. Krishnendu Chatterjee
Summer 2018
Improved the POMCP algorithm to create an online MEMDP algorithm and established its superiority over POMDP algorithms
Exploited the sparse transitions in MEMDPs to have faster belief updates [O(n) as opposed to O(n^2)] to get faster processing
Bachelor's Project
IIT Bombay | Prof. Shivaram Kalyanakrishnan
July 2019 - July 2020
Made POMDP policy iteration more efficient by improving the update of Directed Cyclic Graphs to get 20% higher rewards
Designed algorithms to handle multiple DCGs & improve arbitrary subsets of DCG-nodes while ensuring Policy Improvement