Related papers: Decoupling via Scale-based Approximations of Limit…
Using Wilson-Polchinski renormalization group equations, we give a simple new proof of decoupling in a $\phi^4$-type scalar field theory involving two real scalar fields (one is heavy with mass $M$ and the other light). Then, to all orders…
An infinite hierarchy of layering transitions exists for model polymers in solution under poor solvent or low temperatures and near an attractive surface. A flat histogram stochastic growth algorithm known as FlatPERM has been used on a…
In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coefficient functions. For this purpose we construct a generalized finite element basis that spans…
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…
Assume we are given a sum of linear measurements of $s$ different rank-$r$ matrices of the form $y = \sum_{k=1}^{s} \mathcal{A}_k ({X}_k)$. When and under which conditions is it possible to extract (demix) the individual matrices ${X}_k$…
One of the very few mathematically rigorous nonlinear model reduction methods is the restriction of a dynamical system to a low-dimensional, sufficiently smooth, attracting invariant manifold. Such manifolds are usually found using local…
We prove sharp $\ell^{p}L^{p}$ decoupling inequalities for $2$ quadratic forms in $4$ variables. We also recover several previous results (arXiv:1409.1634, arXiv:1501.07224, arXiv:1609.02022, arXiv:1609.04107) in a unified way.
Multiple sampling-based methods have been developed for approximating and accelerating node embedding aggregation in graph convolutional networks (GCNs) training. Among them, a layer-wise approach recursively performs importance sampling to…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
We study the adsorption of homogeneous or heterogeneous polymers onto heterogeneous planar surfaces with exponentially decaying site-site correlations, using a variational reference system approach. As a main result, we derive simple…
Elastic scattering governed by the Lame system associated with the third-type or fourth-type boundary condition is considered. It was shown in [8] by two of the authors that under suitable geometric conditions on the boundary surface of the…
Machine learning models typically focus on specific targets like creating classifiers, often based on known population feature distributions in a business context. However, models calculating individual features adapt over time to improve…
We prove decoupling inequalities for random polynomials in independent random variables with coefficients in vector space. We use various means of comparison, including rearrangement invariant norms (e.g., Orlicz and Lorentz norms), tail…
We study the topological types of pants decompositions of a surface by associating to any pants decomposition $P,$ in a natural way its pants decomposition graph, $\Gamma(P).$ This perspective provides a convenient way to analyze the…
This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures. Achieving such disentanglement leads to two unrelated advantages: i) a significant…
Motivated by the mathematics literature on the algebraic properties of so-called polynomial vector flows, we propose a technique for approximating nonlinear differential equations by linear differential equations. Although the idea of…
We study multilevel techniques, commonly used in PDE multigrid literature, to solve structured optimization problems. For a given hierarchy of levels, we formulate a coarse model that approximates the problem at each level and provides a…
We study special linear systems of surfaces of $\mathbb{P}^3$ interpolating nine points in general position having a quadric as fixed component. By performing degenerations in the blown-up space, we interpret the quadric obstruction in…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
Auxiliary tasks facilitate learning in situations where data is scarce or the principal task of interest is extremely complex. This idea is primarily inspired by the improved generalization capability induced by solving multiple tasks…