Related papers: Optimal replication of random vectors by ordinary …
By the classical Martingale Representation Theorem, replication of random vectors can be achieved via stochastic integrals or solutions of stochastic differential equations. We introduce a new approach to replication of random vectors via…
In this paper, we study a sampling problem where a source takes samples from a Wiener process and transmits them through a wireless channel to a remote estimator. Due to channel fading, interference, and potential collisions, the packet…
This paper presents a numerical model to solve the problem of cash accumulation strategies for products with an unknown future price, like assets. Stock prices are modeled by a discretized Wiener Process, and by the means of ordinary…
We investigate the optimal rate of convergence in the multidimensional normal approximation of vector-valued Wiener-Ito integrals of which components all belong to the same fixed Wiener chaos. Combining Malliavin calculus, Stein's method…
We investigate Wiener-transformable markets, where the driving process is given by an adapted transformation of a Wiener process. This includes processes with long memory, like fractional Brownian motion and related processes, and, in…
In this paper, we consider a problem of sampling a Wiener process, with samples forwarded to a remote estimator over a channel that is modeled as a queue. The estimator reconstructs an estimate of the real-time signal value from causally…
We compute the integral of a function or the expectation of a random variable with minimal cost and use, for our new algorithm and for upper bounds of the complexity, i.i.d. samples. Under certain assumptions it is possible to select a…
We address the optimal sampling of a Wiener process under sampling and transmission costs, with the samples being forwarded to a remote estimator over a channel with IID delay. The goal of the estimator is to reconstruct the real-time…
In this paper, we consider a problem of sampling a Wiener process, with samples forwarded to a remote estimator via a channel that consists of a queue with random delay. The estimator reconstructs a real-time estimate of the signal from…
A method for generating random $U(1)$ variables with Boltzmann distribution is presented. It is based on the rejection method with transformation of variables. High efficiency is achieved for all range of temparatures or coupling…
We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems,…
We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…
When attempting to recover functions from observational data, one naturally seeks to do so in an optimal manner with respect to some modeling assumption. With a focus put on the worst-case setting, this is the standard goal of Optimal…
Diverse inverse problems in imaging can be cast as variational problems composed of a task-specific data fidelity term and a regularization term. In this paper, we propose a novel learnable general-purpose regularizer exploiting recent…
In this paper we present the solution to the problem of recovering rather arbitrary integral operator based on incomplete information with error. We apply the main result to obtain optimal methods of recovery and compute the optimal error…
The problem of approximating/tracking the value of a Wiener process is considered. The discretization points are placed at times when the value of the process differs from the approximation by some amount, here denoted by eta. It is found…
Random features are a powerful technique for rewriting positive-definite kernels as linear products. They bring linear tools to bear in important nonlinear domains like KNNs and attention. Unfortunately, practical implementations require…
While the theory of operator approximation with any given accuracy is well elaborated, the theory of {best constrained} constructive operator approximation is still not so well developed. Despite increasing demands from applications this…
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a…