I am a second year Ph.D. student in Computer Science at University of Maryland. I work on Machine Learning and Optimization. I am interested in fast, low-complexity solutions to real-world problems.

I did my undergraduate studies in Software Engineering at Sharif University of Technology. I also co-founded and managed an educational center for helping high school students prepare for Olympiads while I was doing my undergrad.


Recent News and updates (View all)

April 23, 2017 - Paper Acceptance

Our paper titled "Learning a Classifier for False Positive Error Reports Emitted by Static Code Analysis Tools" has been accepted into MAPL 2017.

Feb. 16, 2017 - Internship Offer

I'm pleased to announce that I have accepted an internship offer from Comcast Research Labs. I will be working with Comcast Labs DC Research Team during this summer.

View All

Select Honors & Awards

Recipient of University of Maryland Dean’s Fellowship

Gold Medal in Iranian National Olympiad in Informatics

Selected as Outstanding Student - Sharif University of Technology

Selected as Iranian National Scientific Elite

Recent Publications (View all)

Learning a Classifier for False Positive Error Reports emitted by Static Code Analysis Tools

Ugur Koc, Parsa Saadatpanah, Jeffrey S. Foster, and Adam A. Porter

MAPL 2017 - PLDI 2017

View All

Recent Projects (View all)

Inverse Reinforcement Learning with Suboptimal Experts

Existing works in Reinforcement Learning field either explicitly assume the expert trajectories are all optimal, or their algorithms tend to work poorly for sub-optimal expert trajectories. We propose a new algorithm which is much more resilient to sub-optimal trajectories.

Variance Reduction for Kacsmarz methods

Kacsmarz methods are very popular optimization methods but they are prone to non existence of optimal solution and noise in the data. My research focused on utilizing Variance Reduction algorithms to make Kacsmarz methods more robust.


Flipping is a local and efficient operation to construct the convex hull in an incremental fashion. However, it is known that the traditional flip algorithm is not able to compute the convex hull when applied to a polyhedron in R3. Our novel Flip-Flop algorithm is a variant of the flip algorithm. It overcomes the deficiency of the traditional one to always compute the convex hull of a given star-shaped polyhedron with provable correctness.

View All


Send me an email at [My First Name]@cs.umd[dot]edu