Related papers: Approximating Weak Bisimilarity of Basic Parallel …
Bayesian models quantify uncertainty and facilitate optimal decision-making in downstream applications. For most models, however, practitioners are forced to use approximate inference techniques that lead to sub-optimal decisions due to…
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…
We study the problem of minimizing a $m$-weakly convex and possibly nonsmooth function. Weak convexity provides a broad framework that subsumes convex, smooth, and many composite nonconvex functions. In this work, we propose a…
We introduce a maximal inequality for a local empirical process under strongly mixing data. Local empirical processes are defined as the (local) averages $\frac{1}{nh}\sum_{i=1}^n \mathbf{1}\{x - h \leq X_i \leq x+h\}f(Z_i)$, where $f$…
We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…
It is known that for a sequence of independent and identically distributed random variables $(X_{n})$ the regular variation condition is equivalent to weak convergence of partial maxima $M_{n}= \max\{X_{1}, \ldots, X_{n}\}$, appropriately…
We study functions of least gradient as well as related superminimizers and solutions of obstacle problems in metric spaces that are equipped with a doubling measure and support a Poincar\'e inequality. We show a standard weak Harnack…
The objective Bayesian treatment of a model representing two independent Poisson processes, labelled as "signal" and "background" and both contributing additively to the total number of counted events, is considered. It is shown that the…
A classical counterexample due to E. De Giorgi, shows that the weak maximum principle does not remain true for general linear elliptic differential systems. After that, there are some efforts to establish the weak maximum principle for…
In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or…
The work described in this paper builds on the polyhedral semantics of the Spatial Logic for Closure Spaces (SLCS) and the geometric spatial model checker PolyLogicA. Polyhedral models are central in domains that exploit mesh processing,…
Weak measurement is a novel quantum measurement scheme, which is usually characterized by the weak value formalism. To guarantee the validity of the weak value formalism, the fidelity between the pre-selection and the post-selection should…
Estimating hyperparameters has been a long-standing problem in machine learning. We consider the case where the task at hand is modeled as the solution to an optimization problem. Here the exact gradient with respect to the hyperparameters…
This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence…
Looking at bivariate copulas from the perspective of conditional distributions and considering weak convergence of almost all conditional distributions yields the notion of weak conditional convergence. At first glance, this notion of…
In this paper, we introduce a new class of optimization problems whose objective functions are weakly homogeneous relative to the constraint sets. By using the normalization argument in asymptotic analysis, we prove two criteria for the…
Comparison to traditionally accurate computing, approximate computing focuses on the rapidity of the satisfactory solution, but not the unnecessary accuracy of the solution. Approximate bisimularity is the approximate one corresponding to…
Nonparametric mixture models based on the Dirichlet process are an elegant alternative to finite models when the number of underlying components is unknown, but inference in such models can be slow. Existing attempts to parallelize…
Submodular optimization finds applications in machine learning and data mining. In this paper, we study the problem of maximizing functions of the form $h = f-c$, where $f$ is a monotone, non-negative, weakly submodular set function and $c$…
The article is devoted to the development of numerical methods for solving variational inequalities with relatively strongly monotone operators. We consider two classes of variational inequalities related to some analogs of the Lipschitz…