Related papers: Tractability of Multi-Parametric Euler and Wiener …
The aim of this paper is to present an elementary computable theory of probability, random variables and stochastic processes. The probability theory is baed on existing approaches using valuations and lower integrals. Various approaches to…
The k-Tree algorithm [Wagner 02] is a non-trivial algorithm for the average-case k-SUM problem that has found widespread use in cryptanalysis. Its input consists of k lists, each containing n integers from a range of size m. Wagner's…
Distributionally Favorable Optimization (DFO) is an important framework for decision-making under uncertainty, with applications across fields such as reinforcement learning, online learning, robust statistics, chance-constrained…
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…
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…
Probabilistic models based on continuous latent spaces, such as variational autoencoders, can be understood as uncountable mixture models where components depend continuously on the latent code. They have proven to be expressive tools for…
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…
We consider a sequence of approximate solutions to the compressible Euler system admitting uniform energy bounds and/or satisfying the relevant field equations modulo an error vanishing in the asymptotic limit. We show that such a sequence…
We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…
We introduce a novel method for systems of conservation laws coupled at a sharp interface based on generalized Riemann problems. This method yields a piecewise-linear in time approximation of the solution at the interface, thus,…
An iterative randomness extraction algorithm which generalized the Von Neumann's extraction algorithm is detailed, analyzed and implemented in standard C++. Given a sequence of independently and identically distributed biased Bernoulli…
We consider the problem of under and over-approximating the image of general vector-valued functions over bounded sets, and apply the proposed solution to the estimation of reachable sets of uncertain non-linear discrete-time dynamical…
We establish exponential laws for certain spaces of differentiable functions over a valued field K. For example, we show that the topological vector spaces C^{r,s}(U x V,E) and C^r(U,C^s(V,E)) are isomorphic if U and V are open subsets of…
Mathematical modeling is a standard approach to solve many real-world problems and {\em diversity} of solutions is an important issue, emerging in applying solutions obtained from mathematical models to real-world problems. Many studies…
The paper presents new and known results on estimates of important linear and nonlinear approximation characteristics of generalized Wiener classes of functions of several variables in different metrics.
Variational Bayes (VB) is rapidly becoming a popular tool for Bayesian inference in statistical modeling. However, the existing VB algorithms are restricted to cases where the likelihood is tractable, which precludes the use of VB in many…
We study the Euler scheme for a stochastic differential equation driven by a Levy process Y. More precisely, we look at the asymptotic behavior of the normalized error process u_n(X^n-X), where X is the true solution and X^n is its Euler…
Given a graph~$G$ and integers $k_1$, $k_2$, and~$k_3$, the unit interval editing problem asks whether $G$ can be transformed into a unit interval graph by at most $k_1$ vertex deletions, $k_2$ edge deletions, and $k_3$ edge additions. We…
We introduce a notion of complexity for systems of linear forms, called sequential Cauchy-Schwarz complexity, which is parametrized by two positive integers $k,\ell$ and refines the notion of Cauchy-Schwarz complexity introduced by Green…