Marek Petrik, Ph.D.
Affiliations: | 2010 | Computer Science | University of Massachusetts, Amherst, Amherst, MA |
Area:
Artificial Intelligence, Applied MathematicsGoogle:
"Marek Petrik"Parents
Sign in to add mentorShlomo Zilberstein | grad student | 2010 | U Mass Amherst | |
(Optimization-based approximate dynamic programming.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Liu B, Gemp I, Ghavamzadeh M, et al. (2018) Proximal Gradient Temporal Difference Learning: Stable Reinforcement Learning with Polynomial Sample Complexity Journal of Artificial Intelligence Research. 63: 461-494 |
Iancu DA, Petrik M, Subramanian D. (2015) Tight approximations of dynamic risk measures Mathematics of Operations Research. 40: 655-682 |
Marecki J, Petrik M, Subramanian D. (2013) Solution methods for constrained Markov decision process with continuous probability modulation Uncertainty in Artificial Intelligence - Proceedings of the 29th Conference, Uai 2013. 518-526 |
Petrik M, Zilberstein S. (2012) Learning feature-based heuristic functions Autonomous Search. 2147483647: 269-305 |
Petrik M. (2012) Approximate dynamic programming by minimizing distributionally robust bounds Proceedings of the 29th International Conference On Machine Learning, Icml 2012. 1: 497-504 |
Petrik M, Zilberstein S. (2011) Linear dynamic programs for resource management Proceedings of the National Conference On Artificial Intelligence. 2: 1377-1383 |
Petrik M, Zilberstein S. (2011) Robust approximate bilinear programming for value function approximation Journal of Machine Learning Research. 12: 3027-3063 |
Petrik M, Taylor G, Parr R, et al. (2010) Feature selection using regularization in approximate linear programs for markov decision processes Icml 2010 - Proceedings, 27th International Conference On Machine Learning. 871-878 |
Petrik M, Zilberstein S. (2009) A Bilinear programming approach for multiagent planning Journal of Artificial Intelligence Research. 35: 235-274 |
Petrik M, Zilberstein S. (2009) Constraint relaxation in approximate linear programs Acm International Conference Proceeding Series. 382 |