Related papers: Democracy functions and optimal embeddings for app…

Metric embeddings are a widely used method in algorithm design, where generally a ``complex'' metric is embedded into a simpler, lower-dimensional one. Historically, the theoretical computer science community has focused on bi-Lipschitz…

We study the expressivity of deep neural networks. Measuring a network's complexity by its number of connections or by its number of neurons, we consider the class of functions for which the error of best approximation with networks of a…

In this paper we analyze the approximation of multivariate integrals over the Euclidean plane for functions which are analytic. We show explicit upper bounds which attain the exponential rate of convergence. We use an infinite grid with…

In this article, we show that Orlicz-Lorentz spaces $\ell^n_{M,a}$, $n\in\mathbb N$ with Orlicz function $M$ and weight sequence $a$ are uniformly isomorphic to subspaces of $L_1$ if the norm $\|\cdot\|_{M,a}$ satisfies certain Hardy-type…

Contextual embeddings represent a new generation of semantic representations learned from Neural Language Modelling (NLM) that addresses the issue of meaning conflation hampering traditional word embeddings. In this work, we show that…

We develop a family of techniques to align word embeddings which are derived from different source datasets or created using different mechanisms (e.g., GloVe or word2vec). Our methods are simple and have a closed form to optimally rotate,…

We study reinforcement learning with function approximation for large-scale Partially Observable Markov Decision Processes (POMDPs) where the state space and observation space are large or even continuous. Particularly, we consider Hilbert…

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

In nonlinear time series analysis and dynamical systems theory, Takens' embedding theorem states that the sliding window embedding of a generic observation along trajectories in a state space, recovers the region traversed by the dynamics.…

We primarily study a special a weighted low-rank approximation of matrices and then apply it to solve the background modeling problem. We propose two algorithms for this purpose: one operates in the batch mode on the entire data and the…

Dimensionality reduction on quadratic manifolds augments linear approximations with quadratic correction terms. Previous works rely on linear approximations given by projections onto the first few leading principal components of the…

We characterize all the real numbers a,b,c and 1<= p,q,r<infty such that the weighted Sobolev space W_{a,b}^(q,p)(R^N\{0}) with power weights |x|^a and |x|^b is continuously embedded into L^{r}(R^N;|x|^cdx). Furthermore, we show that this…

Motivated by the successful use of greedy algorithms for Reduced Basis Methods, a greedy method is proposed that selects N input data in an asymptotically optimal way to solve well-posed operator equations using these N data. The operator…

We prove optimal bounds for the convergence rate of ordinal embedding (also known as non-metric multidimensional scaling) in the 1-dimensional case. The examples witnessing optimality of our bounds arise from a result in additive number…

Theorems of Khintchine, Groshev, Jarn\'ik, and Besicovitch in Diophantine approximation are fundamental results on the metric properties of $\Psi$-well approximable sets. These foundational results have since been generalised to the…

We prove asymptotic formulas for the behavior of approximation, Gelfand, Kolmogorov and Weyl numbers of Sobolev embeddings between Besov and Triebel-Lizorkin spaces defined on quasi-bounded domains.

We introduce a novel embedding method diverging from conventional approaches by operating within function spaces of finite dimension rather than finite vector space, thus departing significantly from standard knowledge graph embedding…

In this paper fundamental nonlinear geometries of Lebesgue sequence spaces are studied in their quantitative aspects. Applications of this work are a positive solution to the strong embeddability problem from $\ell_q$ into $\ell_p$…

In this article, via certain lower bound conditions on the measures under consideration, the authors fully characterize the Sobolev embeddings for the scales of Haj{\l}asz-Triebel-Lizorkin and Haj{\l}asz-Besov spaces in the general context…

We construct differential algebras in which spaces of (one-dimensional) periodic ultradistributions are embedded. By proving a Schwartz impossibility type result, we show that our embeddings are optimal in the sense of being consistent with…