Related papers: Optimistic optimization of a Brownian
We consider the problem of chance constrained optimization where it is sought to optimize a function and satisfy constraints, both of which are affected by uncertainties. The real world declinations of this problem are particularly…
We study the problem of global maximization of a function f given a finite number of evaluations perturbed by noise. We consider a very weak assumption on the function, namely that it is locally smooth (in some precise sense) with respect…
Consider an oracle which takes a point $x$ and returns the minimizer of a convex function $f$ in an $\ell_2$ ball of radius $r$ around $x$. It is straightforward to show that roughly $r^{-1}\log\frac{1}{\epsilon}$ calls to the oracle…
The strong $L^2$-approximation of occupation time functionals is studied with respect to discrete observations of a $d$-dimensional c\`adl\`ag process. Upper bounds on the error are obtained under weak assumptions, generalizing previous…
We study an optimization problem in which the objective is given as a sum of logarithmic-polynomial functions. This formulation is motivated by statistical estimation principles such as maximum likelihood estimation, and by loss functions…
We propose an algorithm for Bayesian functional optimisation - that is, finding the function to optimise a process - guided by experimenter beliefs and intuitions regarding the expected characteristics (length-scale, smoothness, cyclicity…
Optimization algorithms appear in the core calculations of numerous Artificial Intelligence (AI) and Machine Learning methods, as well as Engineering and Business applications. Following recent works on the theoretical deficiencies of AI, a…
A stochastic leap-frog algorithm for the numerical integration of Brownian motion stochastic differential equations with multiplicative noise is proposed and tested. The algorithm has a second-order convergence of moments in a finite time…
We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that…
The task of maximizing a monotone submodular function under a cardinality constraint is at the core of many machine learning and data mining applications, including data summarization, sparse regression and coverage problems. We study this…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
The main goal of this work is to provide sample-path estimates for the solution of slowly time-dependent SPDEs perturbed by a cylindrical fractional Brownian motion. Our strategy is similar to the approach by Berglund and Nader for…
In this short note we will provide a sufficient and necessary condition to have uniqueness of the location of the maximum of a stochastic process over an interval. The result will also express the mean value of the location in terms of the…
Motion planning under differential constraints is a classic problem in robotics. To date, the state of the art is represented by sampling-based techniques, with the Rapidly-exploring Random Tree algorithm as a leading example. Yet, the…
Brownian motion near soft surfaces is a situation widely encountered in nanoscale and biological physics. However, a complete theoretical description is lacking to date. Here, we theoretically investigate the dynamics of a two-dimensional…
The system consists of a Brownian particle immersed in a heat bath trapped in optical tweezers with a time-dependent strength acting as an external protocol. In [Phys. Rev. Letts., 98:108301, 2007] the optimal mean work in the overdamped…
We consider minimization of a smooth nonconvex function with inexact oracle access to gradient and Hessian (without assuming access to the function value) to achieve approximate second-order optimality. A novel feature of our method is that…
Bayesian Optimization (BO) is a sample-efficient optimization algorithm widely employed across various applications. In some challenging BO tasks, input uncertainty arises due to the inevitable randomness in the optimization process, such…
The acceleration of gradient-based optimization methods is a subject of significant practical and theoretical importance, particularly within machine learning applications. While much attention has been directed towards optimizing within…
The purpose of this note is to collect in one place a few results about simple random walk and Brownian motion which are often useful. These include standard results such as Beurling estimates, large deviation estimates, and a method for…