Optimization and Regularization Under Arbitrary Objectives
Jared N. Lakhani, Etienne Pienaar

TL;DR
This paper explores how the sharpness of likelihood functions influences the performance and regularization capabilities of two-block MCMC methods applied to arbitrary objectives, with empirical tests in reinforcement learning and game scenarios.
Contribution
It introduces a sharpness parameter for likelihood functions and analyzes their impact on MCMC performance and regularization, providing insights into the behavior of hybrid optimization-MCMC methods.
Findings
Likelihood curvature controls in-sample performance.
Extreme likelihood sharpness collapses posterior to a single mode.
Hybrid approach with iterative optimization matches MCMC performance.
Abstract
This study investigates the limitations of applying Markov Chain Monte Carlo (MCMC) methods to arbitrary objective functions, focusing on a two-block MCMC framework which alternates between Metropolis-Hastings and Gibbs sampling. While such approaches are often considered advantageous for enabling data-driven regularization, we show that their performance critically depends on the sharpness of the employed likelihood form. By introducing a sharpness parameter and exploring alternative likelihood formulations proportional to the target objective function, we demonstrate how likelihood curvature governs both in-sample performance and the degree of regularization inferred by the training data. Empirical applications are conducted on reinforcement learning tasks: including a navigation problem and the game of tic-tac-toe. The study concludes with a separate analysis examining the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Stochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods
