Related papers: A general criterion for jump set slicing and appli…
Derivations extend the concept of differentiation from functions to algebraic structures as linear operators satisfying the Leibniz rule. In Lie algebras, derivations form a Lie algebra via the commutator bracket of linear endomorphisms.…
We study gapped scale-sensitive dimensions of a function class in both sequential and non-sequential settings. We demonstrate that covering numbers for any uniformly bounded class are controlled above by these gapped dimensions,…
When proving the correctness of a method for slicing probabilistic programs, it was previously discovered by the authors that for a fixed point iteration to work one needs a non-standard starting point for the iteration. This paper presents…
Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in a Euclidean space.…
Sleeve functions are generalizations of the well-established ridge functions that play a major role in the theory of partial differential equation, medical imaging, statistics, and neural networks. Where ridge functions are non-linear,…
We formulate and prove a combinatorial criterion to decide if an A-hypergeometric system of differential equations has a full set of algebraic solutions or not. This criterion generalises the so-called interlacing criterion in the case of…
Many features of dimensional reduction schemes are determined by the breaking of higher dimensional general covariance associated with the selection of a particular subset of coordinates. By investigating residual covariance we introduce…
An analogue of the total variation prior for the normal vector field along the boundary of piecewise flat shapes in 3D is introduced. A major class of examples are triangulated surfaces as they occur for instance in finite element…
We consider the problem of slicing a compact metric space \Omega with sets of the form \pi_{\lambda}^{-1}\{t\}, where the mappings \pi_{\lambda} \colon \Omega \to \R, \lambda \in \R, are \emph{generalized projections}, introduced by Yuval…
The aim of this paper is to study a whole class of first order differential inclusions, which fit into the framework of perturbed sweeping process by uniformly prox-regular sets. After obtaining well-posedness results, we propose a…
Since its inception, Benders Decomposition (BD) has been successfully applied to a wide range of large-scale mixed-integer (linear) problems. The key element of BD is the derivation of Benders cuts, which are often not unique. In this…
This paper presents a decomposition method for solving elliptic boundary value problems in one-dimension. The method is an improvement to an existing technique for approximating elliptic systems. It is demonstrated to be computationally…
The aim of this paper is to introduce new statistical criterions for estimation, suitable for inference in models with common continuous support. This proposal is in the direct line of a renewed interest for divergence based inference tools…
The development of a metric for structural data is a long-term problem in pattern recognition and machine learning. In this paper, we develop a general metric for comparing nonlinear dynamical systems that is defined with Perron-Frobenius…
A new classification of real functions and other related real objects defined within a compact interval is proposed. The scope of the classification includes normal real functions and distributions in the sense of Schwartz, referred to…
The generalized partially linear models on Riemannian manifolds are introduced. These models, like ordinary generalized linear models, are a generalization of partially linear models on Riemannian manifolds that allow for response variables…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
In this paper we consider adjoint restriction estimates for space curves with respect to general measures and obtain optimal estimates when the curves satisfy a finite type condition. The argument here is new in that it doesn't rely on the…
Covariance matrices have attracted attention for machine learning applications due to their capacity to capture interesting structure in the data. The main challenge is that one needs to take into account the particular geometry of the…
Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods as blocking sets) and zero forcing irredundance (which uses…