Related papers: Optimistic optimization of a Brownian
Maximizing submodular functions under cardinality constraints lies at the core of numerous data mining and machine learning applications, including data diversification, data summarization, and coverage problems. In this work, we study this…
In this paper we propose a general framework to characterize and solve the stochastic optimization problems with multiple objectives underlying many real world learning applications. We first propose a projection based algorithm which…
An adaptive regularization algorithm using inexact function and derivatives evaluations is proposed for the solution of composite nonsmooth nonconvex optimization. It is shown that this algorithm needs at most…
We present an algorithm to efficiently sample first-passage times for fractional Brownian motion. To increase the resolution, an initial coarse lattice is successively refined close to the target, by adding exactly sampled midpoints, where…
This paper presents a novel formula for the transition density of the Brownian motion on a sphere of any dimension and discusses an algorithm for the simulation of the increments of the spherical Brownian motion based on this formula. The…
We formalize a new paradigm for optimality of algorithms, that generalizes worst-case optimality based only on input-size to problem-dependent parameters including implicit ones. We re-visit some existing sorting algorithms from this…
This paper is concerned with Random walk approximations of the Brownian motion on the Affine group Aff(R). We are in particular interested in the case where the innovations are discrete. In this framework, the return probability of the walk…
An algorithm for unconstrained non-convex optimization is described, which does not evaluate the objective function and in which minimization is carried out, at each iteration, within a randomly selected subspace. It is shown that this…
We study extreme-value statistics of Brownian trajectories in one dimension. We define the maximum as the largest position to date and compare maxima of two particles undergoing independent Brownian motion. We focus on the probability P(t)…
A number of optimization algorithms have been inspired by the physics of Newtonian motion. Here, we ask the question: do algorithms themselves obey some ``natural laws of motion,'' and can they be derived by an application of these laws? We…
We consider the problem of efficient estimation for the drift of fractional Brownian motion $B^H:=(B^H_t)_{t\in[0,T]}$ with hurst parameter $H$ less than 1/2. We also construct superefficient James-Stein type estimators which dominate,…
A solution that is only reliable under favourable conditions is hardly a safe solution. Min Max Optimization is an approach that returns optima that are robust against worst case conditions. We propose algorithms that perform Min Max…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
The ultimate goal of optimization is to find the minimizer of a target function.However, typical criteria for active optimization often ignore the uncertainty about the minimizer. We propose a novel criterion for global optimization and an…
We prove an invariance principle for Brownian motion in Gaussian or Poissonian random scenery by the method of characteristic functions. Annealed asymptotic limits are derived in all dimensions, with a focus on the case of dimension $d=2$,…
Given a standard Brownian motion $B^{\mu}=(B_t^{\mu})_{0\le t\le T}$ with drift $\mu \in \mathbb{R}$ and letting $S_t^{\mu}=\max_{0\le s\le t}B_s^{\mu}$ for $0\le t\le T$, we consider the optimal prediction problem: \[V=\inf_{0\le \tau \le…
Approximations of fractional Brownian motion using Poisson processes whose parameter sets have the same dimensions as the approximated processes have been studied in the literature. In this paper, a special approximation to the…
We show that with probability 1, the trace B[0,1] of Brownian motion in space, has positive capacity with respect to exactly the same kernels as the unit square. More precisely, the energy of occupation measure on B[0,1] in the kernel…
We study the statistics of near-extreme events of Brownian motion (BM) on the time interval [0,t]. We focus on the density of states (DOS) near the maximum \rho(r,t) which is the amount of time spent by the process at a distance r from the…
In this paper we examine the rate of convergence of one of the standard algorithms for emulating exit probabilities of Brownian motion, the Walk on Spheres (WoS) algorithm. We obtain the complete characterization of the rate of convergence…