相关论文: Discrepancy bounds for low-dimensional point sets

The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…

Heterogeneous datasets emerge in various machine learning and optimization applications that feature different input sources, types or formats. Most models or methods do not natively tackle heterogeneity. Hence, such datasets are often…

We explore unique considerations involved in fitting ML models to data with very high precision, as is often required for science applications. We empirically compare various function approximation methods and study how they scale with…

This paper argues that DNNs implement a computational Occam's razor -- finding the `simplest' algorithm that fits the data -- and that this could explain their incredible and wide-ranging success over more traditional statistical methods.…

The present work considers the properties of generally convex sets in the $n$-dimensional real Euclidean space $\mathbb{R}^n$, $n>1$, known as weakly $m$-convex, $m=1,2,\ldots,n-1$. An open set of $\mathbb{R}^n$ is called weakly $m$-convex…

Discrete point sets $\mathcal{S}$ such as lattices or quasiperiodic Delone sets may permit, beyond their symmetries, certain isometries $R$ such that $\mathcal{S}\cap R\mathcal{S}$ is a subset of $\mathcal{S}$ of finite density. These are…

We have introduced a new sequence space $l(r, s, t, p ;\Delta^{(m)})$ combining by using generalized means and difference operator of order $m$. We have shown that the space $l(r, s, t, p ;\Delta^{(m)})$ is complete under some suitable…

In this paper we give explicit constructions of point sets in the $s$ dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate of convergence of the worst-case error for numerically integrating high…

With the emergence of powerful representations of continuous data in the form of neural fields, there is a need for discretization invariant learning: an approach for learning maps between functions on continuous domains without being…

The manifold hypothesis (real world data concentrates near low-dimensional manifolds) is suggested as the principle behind the effectiveness of machine learning algorithms in very high dimensional problems that are common in domains such as…

A tensor network is a type of decomposition used to express and approximate large arrays of data. A given data-set, quantum state or higher dimensional multi-linear map is factored and approximated by a composition of smaller multi-linear…

In low dimensional topology, we have some invariants defined by using solutions of some nonlinear elliptic operators. The invariants could be understood as Euler class or degree in the ordinary cohomology, in infinite dimensional setting.…

We study several distinct but related Fourier analytic variants of the well-known Kakeya and Furstenberg set problems in the plane. For example, given $0<s,t<1$, we call a set $K \subseteq \mathbb{R}^2$ an $(s,t)$-Kakeya set if there exists…

In this paper we study the distance Ramsey number $R_{{\it D}}(s,t,d)$. The \textit{distance Ramsey number} $R_{{\it D}}(s,t,d) $ is the minimum number $n$ such that for any graph $ G $ on $ n $ vertices, either $G$ contains an induced $ s…

Partial differential equations (PDEs) with Dirichlet boundary conditions defined on boundaries with simple geometry have been succesfuly treated using sigmoidal multilayer perceptrons in previous works. This article deals with the case of…

This is a survey about spectral sets, to appear in the second edition of Handbook of Linear Algebra (L. Hogben, ed.). Spectral sets and K-spectral sets, introduced by John von Neumann, offer a possibility to estimate the norm of functions…

Consider a set represented by an inequality. An interesting phenomenon which occurs in various settings in mathematics is that the interior of this set is the subset where strict inequality holds, the boundary is the subset where equality…

We consider the ability of deep neural networks to represent data that lies near a low-dimensional manifold in a high-dimensional space. We show that deep networks can efficiently extract the intrinsic, low-dimensional coordinates of such…

The concept of node walk in graphs and complex networks has been addressed, consisting of one or more nodes that move into adjacent nodes, henceforth incorporating the respective connections. This type of dynamics is then applied to subsume…

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…