Related papers: Optimistic optimization of a Brownian
We propose a practical Bayesian optimization method using Gaussian process regression, of which the marginal likelihood is maximized where the number of model selection steps is guided by a pre-defined threshold. Since Bayesian optimization…
Bayesian optimization is a sequential method for minimizing objective functions that are expensive to evaluate and about which few assumptions can be made. By using all gathered data to train a Gaussian process model for the function and…
In this paper, we consider an unconstrained optimization model where the objective is a sum of a large number of possibly nonconvex functions, though overall the objective is assumed to be smooth and convex. Our bid to solving such model…
A new stochastic primal--dual algorithm for solving a composite optimization problem is proposed. It is assumed that all the functions/operators that enter the optimization problem are given as statistical expectations. These expectations…
An innovative extension of Geometric Brownian Motion model is developed by incorporating a weighting factor and a stochastic function modelled as a mixture of power and trigonometric functions. Simulations based on this Modified Brownian…
Bayesian Reinforcement Learning (RL) is capable of not only incorporating domain knowledge, but also solving the exploration-exploitation dilemma in a natural way. As Bayesian RL is intractable except for special cases, previous work has…
We study the problem of optimizing a function under a \emph{budgeted number of evaluations}. We only assume that the function is \emph{locally} smooth around one of its global optima. The difficulty of optimization is measured in terms of…
This paper considers data-driven chance-constrained stochastic optimization problems in a Bayesian framework. Bayesian posteriors afford a principled mechanism to incorporate data and prior knowledge into stochastic optimization problems.…
At fast timescales, the self-similarity of random Brownian motion is expected to break down and be replaced by ballistic motion. So far, an experimental verification of this prediction has been out of reach due to a lack of instrumentation…
We consider the problem of pricing discretely monitored Asian options over $T$ monitoring points where the underlying asset is modeled by a geometric Brownian motion. We provide two quantum algorithms with complexity poly-logarithmic in $T$…
We propose an algorithm for a family of optimization problems where the objective can be decomposed as a sum of functions with monotonicity properties. The motivating problem is optimization of hyperparameters of machine learning…
Bayesian optimization is a popular formalism for global optimization, but its computational costs limit it to expensive-to-evaluate functions. A competing, computationally more efficient, global optimization framework is optimistic…
We establish high probability estimates on the eigenvalue locations of Brownian motion on the $N$-dimensional unitary group, as well as estimates on the number of eigenvalues lying in any interval on the unit circle. These estimates are…
Submodular optimization generalizes many classic problems in combinatorial optimization and has recently found a wide range of applications in machine learning (e.g., feature engineering and active learning). For many large-scale…
In this paper, we consider the portfolio optimization problem in a financial market where the underlying stochastic volatility model is driven by n-dimensional Brownian motions. At first, we derive a Hamilton-Jacobi-Bellman equation…
Brownian motion is a central scientific paradigm. Recently, due to increasing efforts and interests towards miniaturization and small-scale physics or biology, the effects of confinement on such a motion have become a key topic of…
We consider the minimization over probability measures of the expected value of a random variable, regularized by relative entropy with respect to a given probability distribution. In the general setting we provide a complete…
We consider the path approximation of Bessel processes and develop a new and efficient algorithm. This study is based on a recent work by the authors, on the path approximation of the Brownian motion, and on the construction of specific own…
This article deals with the numerical resolution of backward stochastic differential equations. Firstly, we consider a rather general case where the filtration is generated by a Brownian motion and a Poisson random measure. We provide a…
Real world experiments are expensive, and thus it is important to reach a target in minimum number of experiments. Experimental processes often involve control variables that changes over time. Such problems can be formulated as a…