Related papers: Improved error bounds for quantization based numer…
We elucidate the asymptotics of the L^s-quantization error induced by a sequence of L^r-optimal n-quantizers of a probability distribution P on R^d when s>r. In particular we show that under natural assumptions, the optimal rate is…
We propose new weak error bounds and expansion in dimension one for optimal quantization-based cubature formula for different classes of functions, such that piecewise affine functions, Lipschitz convex functions or differentiable function…
This paper is concerned with a kind of linear-quadratic (LQ) optimal control problem of backward stochastic differential equation (BSDE) with partial information. The cost functional includes cross terms between the state and control, and…
In this paper, we obtain a comparison theorem and a invariant representation theorem for backward stochastic differential equations (BSDEs) without any assumption on the second variable $z$. Using the two results, we further develop the…
We consider some certain nonlinear perturbations of the stochastic linear-quadratic optimization problems and study the connections between their solutions and the corresponding Markovian backward stochastic diferential equations (BSDEs).…
The problem of minimizing the maximum of $N$ convex, Lipschitz functions plays significant roles in optimization and machine learning. It has a series of results, with the most recent one requiring $O(N\epsilon^{-2/3} + \epsilon^{-8/3})$…
We study the optimal approximation of the solution of an operator equation by certain n-term approximations with respect to specific classes of frames. We study worst case errors and the optimal order of convergence and define suitable…
Randomized (dithered) quantization is a method capable of achieving white reconstruction error independent of the source. Dithered quantizers have traditionally been considered within their natural setting of uniform quantization. In this…
A novel approximate Bayesian filter based on backward stochastic differential equations is introduced. It uses a nonlinear Feynman--Kac representation of the filtering problem and the approximation of an unnormalized filtering density using…
Sequential quadratic optimization algorithms are proposed for solving smooth nonlinear optimization problems with equality constraints. The main focus is an algorithm proposed for the case when the constraint functions are deterministic,…
This paper is concerned with a linear-quadratic (LQ, for short) optimal control problem for backward stochastic differential equations (BSDEs, for short), where the coefficients of the backward control system and the weighting matrices in…
We adopt the integral definition of the fractional Laplace operator and analyze solution techniques for fractional, semilinear, and elliptic optimal control problems posed on Lipschitz polytopes. We consider two strategies of…
In this paper, we study the linear-quadratic control problem for mean-field backward stochastic differential equations (MF-BSDE) with random coefficients. We first derive a preliminary stochastic maximum principle to analyze the unique…
We refine the solvability of quadratic semimartingale BSDEs by employing a Lipschitz-quadratic regularization procedure. In the first step, we prove an existence and uniqueness result for a class of Lipschitz-quadratic BSDEs. A…
Distributed optimization plays an important role in modern large-scale machine learning and data processing systems by optimizing the utilization of computational resources. One of the classical and popular approaches is Local Stochastic…
We study numerical integration of Lipschitz functionals on a Banach space by means of deterministic and randomized (Monte Carlo) algorithms. This quadrature problem is shown to be closely related to the problem of quantization of the…
We extend the branching process based numerical algorithm of Bouchard et al. [3], that is dedicated to semilinear PDEs (or BSDEs) with Lipschitz nonlinearity, to the case where the nonlinearity involves the gradient of the solution. As in…
Unconstrained Online Linear Optimization (OLO) is a practical problem setting to study the training of machine learning models. Existing works proposed a number of potential-based algorithms, but in general the design of these potential…
We consider the problem of approximating optimal in the Minimum Mean Squared Error (MMSE) sense nonlinear filters in a discrete time setting, exploiting properties of stochastically convergent state process approximations. More…
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as Sigma Delta quantization schemes, employ coarse quantization coupled with oversampling. The standard mathematical model for the error accrued…