相关论文: Indistinguishable sceneries on the Boolean hypercu…

We investigate to what extent it is possible to solve linear inverse problems with $ReLu$ networks. Due to the scaling invariance arising from the linearity, an optimal reconstruction function $f$ for such a problem is positive homogeneous,…

We develop a linearized boundary control method for the inverse boundary value problem of determining a density in the acoustic wave equation. The objective is to reconstruct an unknown perturbation in a known background density from the…

Recently, neural implicit surfaces have become popular for multi-view reconstruction. To facilitate practical applications like scene editing and manipulation, some works extend the framework with semantic masks input for the…

We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent $\tau\in (2,3)$. In this model two colors spread with a fixed and…

we consider a system with homoclinic orbit, We decompose the corresponding variational equation on the space of solutions and provide sufficient conditions for the permanency of homoclinic in the space of $C^1$ vector fields. We also…

For graphs $G$ and $H$, an $H$-coloring of $G$ is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colorings encode graph theory notions such as independent sets and proper colorings, and are a…

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

We introduce a method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a finite number of its samples with respect to any Riesz basis. As we…

We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus…

We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

In the context of 'infinite-volume mixing' we prove global-local mixing for the Boole map, a.k.a. Boole transformation, which is the prototype of a non-uniformly expanding map with two neutral fixed points. Global-local mixing amounts to…

We give a $2^{\tilde{O}(\sqrt{n}/\epsilon)}$-time algorithm for properly learning monotone Boolean functions under the uniform distribution over $\{0,1\}^n$. Our algorithm is robust to adversarial label noise and has a running time nearly…

We examine a hierarchy of equivalence classes of quasi-random properties of Boolean Functions. In particular, we prove an equivalence between a number of properties including balanced influences, spectral discrepancy, local strong…

We investigate the classical and distributed complexity of \emph{$k$-partial $c$-coloring} where $c=k$, a natural generalization of Brooks' theorem where each vertex should be colored from the palette $\{1,\ldots,c\} = \{1,\ldots,k\}$ such…

Indoor scene reconstruction from monocular images has long been sought after by augmented reality and robotics developers. Recent advances in neural field representations and monocular priors have led to remarkable results in scene-level…

For a Legendre-Galerkin semi-discretization of the 1-D homogeneous wave equation, the high frequency components of the numerical solution prevent us from obtaining the boundary observability (inequality), uniformly with regard to the…

We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…

Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and…

Kochen-Specker theorems assure the breakdown of certain types of non-contextual hidden variable theories through the non-existence of global, holistic frame functions; alas they do not allow us to identify where this breakdown occurs, nor…

A vertex 2-coloring of a graph is said to be perfect with parameters $(a_{ij})_{i,j=1}^k$ if for every $i,j\in\{1,...,k\}$ every vertex of color $i$ is adjacent with exactly $a_{ij}$ vertices of color $j$. We consider the perfect…