Several approaches for subset recovery and improved forecasting accuracy have been proposed and studied. One way is to apply a regularization strategy and solve the model selection task as a continuous optimization problem. One of the most popular approaches in this research field is given by...

This paper focuses on finding starting-values for the estimation of Vector STAR models. Based on a Monte Carlo study, different procedures are evaluated. Their performance is assessed with respect to model fit and computational effort. I employ (i) grid search algorithms and (ii) heuristic...

In the economics of joint production one often distinguishes between the two cases: the one in which a firm produces multiple products each produced under separate production process, and the other "true joint production" where a number of outputs are produced from a single production process,...

A new algorithm for calibrating agent-based models is proposed, which employs a popular gradient boosting framework. Machine learning techniques are not used to develop a surrogate model, but rather assist in narrowing down the parameter space during the search for optimal parameters. Our...

This note is intended to demonstrate that median (a well-known measure of central tendency) is a weighted arithmetic mean of all sample observations and such (non-trivial) weights may be computed by an optimization method such as the host-parasite co-evolutionary algorithm

In this paper, we introduce and develop the theory of semimartingale optimal transport in a path dependent setting. Instead of the classical constraints on marginal distributions, we consider a general framework of path dependent constraints. Duality results are established, representing the...

We provide a survey of recent results on model calibration by Optimal Transport. We present the general framework and then discuss the calibration of local, and local-stochastic, volatility models to European options, the joint VIX/SPX calibration problem as well as calibration to some...

We study the out-of-sample properties of robust empirical optimization problems with smooth φ-divergence penalties and smooth concave objective functions, and develop a theory for data-driven calibration of the non-negative “robustness parameter” δ that controls the size of the deviations...

In this paper, we study the out-of-sample properties of robust empirical optimization and develop a theory for data-driven calibration of the “robustness parameter” for worst-case maximization problems with concave reward functions. Building on the intuition that robust optimization reduces...