Related papers: Balancing domain decomposition by constraints asso…
We consider multilevel decompositions of piecewise constants on simplicial meshes that are stable in $H^{-s}$ for $s\in (0,1)$. Proofs are given in the case of uniformly and locally refined meshes. Our findings can be applied to define…
Given a prediction task, understanding when one can and cannot design a consistent convex surrogate loss, particularly a low-dimensional one, is an important and active area of machine learning research. The prediction task may be given as…
In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…
We consider the problem of estimating the support size of a distribution $D$. Our investigations are pursued through the lens of distribution testing and seek to understand the power of conditional sampling (denoted as COND), wherein one is…
We modify the well-known interior penalty finite element discretization method so that it allows for element-by-element assembly. This is possible due to the introduction of additional unknowns associated with the interfaces between…
A subset $A$ of a commutative semigroup $X$ is called a $B_h$ set in $X$ if the only solutions to $a_1+\dots+a_h = b_1 + \cdots +b_h$ (with $a_i,b_i \in A$) are the trivial solutions $\{a_1,\dots,a_h\} = \{b_1,\dots,b_h\}$ (as multisets).…
We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability,…
This work aims to accelerate the convergence of proximal gradient methods used to solve regularized linear inverse problems. This is achieved by designing a polynomial-based preconditioner that targets the eigenvalue spectrum of the normal…
Purpose: Design of a preconditioner for fast and efficient parallel imaging and compressed sensing reconstructions. Theory: Parallel imaging and compressed sensing reconstructions become time consuming when the problem size or the number of…
We introduce the notion of conditional Lipschitz shadowing, which does not aim to shadow every pseudo-orbit, but only those which belong to a certain prescribed set. We establish two types of sufficient conditions under which certain…
This paper explores a family of generalized sweeping preconditionners for Helmholtz problems with non-overlapping checkerboard partition of the computational domain. The domain decomposition procedure relies on high-order transmission…
Consistency of case bases is a way to avoid the problem of retrieving conflicting constraining precedents for new cases to be decided. However, in legal practice the consistency requirements for case bases may not be satisfied. As pointed…
The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A binary CSP instance can be presented as a labelled…
We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…
We investigate fast and communication-efficient algorithms for the classic problem of minimizing a sum of strongly convex and smooth functions that are distributed among $n$ different nodes, which can communicate using a limited number of…
In this paper, we study continuous properties of adapted solutions for backward stochastic differential equations with constraints (CBSDEs in short). Comparing with many existing literatures about this topic, our case is very general in the…
For a wide family of multivariate Hausdorff operators, a new stronger condition for the boundedness of an operator from this family on the real Hardy space $H^1$ by means of atomic decomposition.
We consider the mixed problem for $L$ the Lam\'e system of elasticity in a bounded Lipschitz domain $ \Omega\subset\reals ^2$. We suppose that the boundary is written as the union of two disjoint sets, $\partial\Omega =D\cup N$. We take…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
Model transformations operate on models conforming to precisely defined metamodels. Consequently, it often seems relatively easy to chain them: the output of a transformation may be given as input to a second one if metamodels match.…