Marek Petrik

According to our database1, Marek Petrik authored at least 74 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Beyond discounted returns: Robust Markov decision processes with average and Blackwell optimality.
CoRR, 2023

A Convex Relaxation Approach to Bayesian Regret Minimization in Offline Bandits.
CoRR, 2023

On Dynamic Program Decompositions of Static Risk Measures.
CoRR, 2023

Solving multi-model MDPs by coordinate ascent and dynamic programming.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

On Dynamic Programming Decompositions of Static Risk Measures in Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Reducing Blackwell and Average Optimality to Discounted MDPs via the Blackwell Discount Factor.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Percentile Criterion Optimization in Offline Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Policy Gradient in Robust MDPs with Global Convergence Guarantee.
Proceedings of the International Conference on Machine Learning, 2023

Entropic Risk Optimization in Discounted MDPs.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
On the Convergence of Policy Gradient in Robust MDPs.
CoRR, 2022

On the convex formulations of robust Markov decision processes.
CoRR, 2022

RASR: Risk-Averse Soft-Robust MDPs with EVaR and Entropic Risk.
CoRR, 2022

Data poisoning attacks on off-policy policy evaluation methods.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Robust $\phi$-Divergence MDPs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Partial Policy Iteration for L1-Robust Markov Decision Processes.
J. Mach. Learn. Res., 2021

Robust Maximum Entropy Behavior Cloning.
CoRR, 2021

Fast Algorithms for $L_\infty$-constrained S-rectangular Robust MDPs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Robust Behavior Cloning with Adversarial Demonstration Detection.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

Policy Gradient Bayesian Robust Optimization for Imitation Learning.
Proceedings of the 38th International Conference on Machine Learning, 2021

Optimizing Percentile Criterion using Robust MDPs.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Soft-Robust Algorithms for Handling Model Misspecification.
CoRR, 2020

Finite-Sample Analysis of GTD Algorithms.
CoRR, 2020

Entropic Risk Constrained Soft-Robust Policy Optimization.
CoRR, 2020

Bayesian Robust Optimization for Imitation Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Optimizing Norm-Bounded Weighted Ambiguity Sets for Robust MDPs.
CoRR, 2019

High-Confidence Policy Optimization: Reshaping Ambiguity Sets in Robust MDPs.
CoRR, 2019

Robust Exploration with Tight Bayesian Plausibility Sets.
CoRR, 2019

Beyond Confidence Regions: Tight Bayesian Ambiguity Sets for Robust MDPs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Inverse Reinforcement Learning of Interaction Dynamics from Demonstrations.
Proceedings of the International Conference on Robotics and Automation, 2019

Fast Feature Selection for Linear Value Function Approximation.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Real-Time Planning as Decision-Making under Uncertainty.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Proximal Gradient Temporal Difference Learning: Stable Reinforcement Learning with Polynomial Sample Complexity.
J. Artif. Intell. Res., 2018

Tight Bayesian Ambiguity Sets for Robust MDPs.
CoRR, 2018

Interpretable Reinforcement Learning with Ensemble Methods.
CoRR, 2018

Policy-Conditioned Uncertainty Sets for Robust Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Low-rank Feature Selection for Reinforcement Learning.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

Fast Bellman Updates for Robust MDPs.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
A Practical Method for Solving Contextual Bandit Problems Using Decision Trees.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Value Directed Exploration in Multi-Armed Bandits with Structured Priors.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Robust Partially-Compressed Least-Squares.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Building an Interpretable Recommender via Loss-Preserving Transformation.
CoRR, 2016

Interpretable Policies for Dynamic Product Recommendations.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

Safe Policy Improvement by Minimizing Robust Baseline Regret.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Proximal Gradient Temporal Difference Learning Algorithms.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Tight Approximations of Dynamic Risk Measures.
Math. Oper. Res., 2015

Robust Partially-Compressed Least-Squares.
CoRR, 2015

Optimal Threshold Control for Energy Arbitrage with Degradable Battery Storage.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Finite-Sample Analysis of Proximal Gradient TD Algorithms.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

2014
Efficient and accurate methods for updating generalized linear models with multiple feature additions.
J. Mach. Learn. Res., 2014

Social media and customer behavior analytics for personalized customer engagements.
IBM J. Res. Dev., 2014

RAAM: The Benefits of Robustness in Approximating Aggregated MDPs in Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Agile logistics simulation and optimization for managing disaster responses.
Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013

Solution Methods for Constrained Markov Decision Process with Continuous Probability Modulation.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

2012
An Approximate Solution Method for Large Risk-Averse Markov Decision Processes.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds.
Proceedings of the 29th International Conference on Machine Learning, 2012

Learning Feature-Based Heuristic Functions.
Proceedings of the Autonomous Search, 2012

2011
Robust Approximate Bilinear Programming for Value Function Approximation.
J. Mach. Learn. Res., 2011

Linear Dynamic Programs for Resource Management.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Global Optimization for Value Function Approximation
CoRR, 2010

Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes.
Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

2009
Hybrid least-squares algorithms for approximate policy evaluation.
Mach. Learn., 2009

A Bilinear Programming Approach for Multiagent Planning.
J. Artif. Intell. Res., 2009

Robust Value Function Approximation Using Bilinear Programming.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Constraint relaxation in approximate linear programs.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

2008
Biasing Approximate Dynamic Programming with a Lower Discount Factor.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

A Successive Approximation Algorithm for Coordination Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Learning Heuristic Functions through Approximate Linear Programming.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

Interaction Structure and Dimensionality Reduction in Decentralized MDPs.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Average-Reward Decentralized Markov Decision Processes.
Proceedings of the IJCAI 2007, 2007

An Analysis of Laplacian Methods for Value Function Approximation in MDPs.
Proceedings of the IJCAI 2007, 2007

Anytime Coordination Using Separable Bilinear Programs.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Learning parallel portfolios of algorithms.
Ann. Math. Artif. Intell., 2006

Learning Static Parallel Portfolios of Algorithms.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006


  Loading...