Esteban Leiva | Searcharxiv

arXiv2026

Computational Framework for B\'ezier Distributions

Flexible continuous univariate distributions with bounded support are essential for accurate input modeling in stochastic simulation and decision analysis. Although B\'ezier distributions provide a powerful family capable of representing complex shapes, their adoption has been hindered by the lack of efficient fitting procedures and modern software implementations. This paper develops a computational framework for fitting B\'ezier distributions to empirical data via both minimum error and maximum likelihood estimation, leveraging first-order optimization methods and exploiting the geometry of the parameter space. We identify provably (asymptotically) lossless convex restrictions of the feasible set that enable efficient projection operators based on isotonic regression and develop first-order algorithms that reduce computational runtime by three to four orders of magnitude compared to traditional derivative-free methods, while delivering consistent fits across real-world data. When benchmarked against the nonlinear solver IPOPT, our methods prove three orders of magnitude faster on average and more robust, while achieving comparable accuracy. To bridge the gap between theory and practice, we introduce bezierv, an open-source Python package providing a unified interface for fitting, analyzing, and convolving B\'ezier distributions.

math.OC↗

arXiv2026

Apprenticeship learning with prior beliefs using inverse optimization

The relationship between inverse reinforcement learning (IRL) and inverse optimization (IO) for Markov decision processes (MDPs) has been relatively underexplored in the literature, despite addressing the same problem. In this work, we revisit the relationship between the IO framework for MDPs, IRL, and apprenticeship learning (AL). We incorporate prior beliefs on the structure of the cost function into the IRL and AL problems, and demonstrate that the convex-analytic view of the AL formalism emerges as a relaxation of our framework. Notably, the AL formalism is a special case in our framework when the regularization term is absent. Focusing on the suboptimal expert setting, we formulate the AL problem as a regularized min-max problem. The regularizer plays a key role in addressing the ill-posedness of IRL by guiding the search for plausible cost functions. To solve the resulting regularized-convex-concave-min-max problem, we use stochastic mirror descent (SMD) and establish convergence bounds for the proposed method. Numerical experiments highlight the critical role of regularization in learning cost vectors and apprentice policies.

cs.LG↗