相关论文: A Canonical Transform for Strengthening the Local …

A canonization scheme for smooth equivalence relations on $\mathbb R^\omega$ modulo restriction to infinite perfect products is proposed. It shows that given a pair of Borel smooth equivalence relations $\mathsf E,\mathsf F$ on $\mathbb…

A Lagrangian formulation for the constrained search for the $N$-representable one-particle density matrix based on the McWeeny idempotency error minimization is proposed, which converges systematically to the ground state. A closed form of…

The Fourier transform plays a central role in many geometric and combinatorial problems cast in vector spaces over finite fields. If a set admits optimal $L^\infty$ bounds on its Fourier transform (that is, it is a Salem set), then it can…

We give a characterization of $L^{p}(\sigma)$ for uniformly rectifiable measures $\sigma$ using Tolsa's $\alpha$-numbers, by showing, for $1<p<\infty$ and $f\in L^{p}(\sigma)$, that \[ \lVert f\rVert_{L^{p}(\sigma)}\sim…

In many learning tasks, structural models usually lead to better interpretability and higher generalization performance. In recent years, however, the simple structural models such as lasso are frequently proved to be insufficient.…

Low-rank approximations, of the weight and feature space can enhance the performance of deep learning models, whether in terms of improving generalization or reducing the latency of inference. However, there is no clear consensus yet on…

We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…

In this paper we study the problem of approximation of the $L^2$-topological invariants by their finite dimensional analogues. We obtain generalizations of the theorem of L\"uck, dealing with towers of finitely sheeted normal coverings. We…

Rademacher's Theorem can be interpreted as an almost-everywhere \emph{little-$o$ improvement principle}: if a function admits a uniform pointwise first-order Lipschitz control at every point, then this control improves to a vanishing one at…

Many applications, such as system identification, classification of time series, direct and inverse problems in partial differential equations, and uncertainty quantification lead to the question of approximation of a non-linear operator…

In this paper, we extend several approximation theorems, originally formulated in the context of the standard $L^p$ norm, to the more general framework of variable exponent spaces. Our study is motivated by applications in neural networks,…

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

We prove a general structural theorem for a wide family of local algorithms, which includes property testers, local decoders, and PCPs of proximity. Namely, we show that the structure of every algorithm that makes $q$ adaptive queries and…

Polynomial reproduction plays a relevant role in deriving error estimates for various approximation schemes. Local reproduction in a quasi-uniform setting is a significant factor in the estimation of error and the assessment of stability…

We prove a sharp $L^p$-Sobolev regularity results for a class of generalized Radon transforms for families of curves in a three dimensional manifold, with folding canonical relations. The proof relies on decoupling inequalities by Wolff and…

Neural ordinary differential equations (NODEs) is an invertible neural network architecture promising for its free-form Jacobian and the availability of a tractable Jacobian determinant estimator. Recently, the representation power of NODEs…

Conformal prediction (CP) is a wrapper around traditional machine learning models, giving coverage guarantees under the sole assumption of exchangeability; in classification problems, for a chosen significance level $\varepsilon$, CP…

We show that the Laplace approximation of a supremum by Lp-norms has interesting consequences in optimization. For instance, the logarithmic barrier functions (LBF) of a primal convex problem P and its dual appear naturally when using this…

We consider the problem of locating a nearest descriptor system of prescribed reduced order to a descriptor system with large order with respect to the ${\mathcal L}_\infty$ norm. Widely employed approaches such as the balanced truncation…

We prove that any given function can be smoothly approximated by functions lying in the kernel of a linear operator involving at least one fractional component. The setting in which we work is very general, since it takes into account…