相关论文: Democracy functions and optimal embeddings for app…
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…
In this paper we consider Lorentz space with a mixed norm of periodic functions of many variables. We obtain the exact estimation of the best M-term approximations of Nikol'ski's, Besov's classes in the Lorentz space with the mixed norm.
We initiate the rigorous study of classification in semimetric spaces, which are point sets with a distance function that is non-negative and symmetric, but need not satisfy the triangle inequality. For metric spaces, the doubling dimension…
In this paper we first prove the metric approximation property for weighted mixed-norm $L_w^{(p_1,\dots ,p_n)}$ spaces. Using Gabor frame representation this implies that the same property holds in weighted modulation and Wiener amalgam…
Kernel based methods provide a way to reconstruct potentially high-dimensional functions from meshfree samples, i.e., sampling points and corresponding target values. A crucial ingredient for this to be successful is the distribution of the…
In this paper, we investigate the approximation problem for functions in Gaussian Sobolev spaces $W^s_p(\mathbb{R}^d, \gamma)$ of smoothness $s > 0$, where the approximation error is measured in the Gaussian Lebesgue space…
A deterministic approximation algorithm is presented for the maximization of non-monotone submodular functions over a ground set of size $n$ subject to cardinality constraint $k$; the algorithm is based upon the idea of interlacing two…
In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the…
We study the optimal approximation of the solution of an operator equation by certain n-term approximations with respect to specific classes of frames. We study worst case errors and the optimal order of convergence and define suitable…
Metric embedding is a powerful tool used extensively in mathematics and computer science. We devise a new method of using metric embeddings recursively, which turns out to be particularly effective in $\ell_p$ spaces, $p>2$, yielding…
Approximation of high-dimensional functions is a problem in many scientific fields that is only feasible if advantageous structural properties, such as sparsity in a given basis, can be exploited. A relevant tool for analysing sparse…
We consider classes of objective functions of cardinality constrained maximization problems for which the greedy algorithm guarantees a constant approximation. We propose the new class of $\gamma$-$\alpha$-augmentable functions and prove…
Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of…
We present a new method for performing nonlinear approximation with redundant dictionaries. The method constructs an $m-$term approximation of the signal by thresholding with respect to a weighted version of its canonical expansion…
We consider a generalization of the classic linear regression problem to the case when the loss is an Orlicz norm. An Orlicz norm is parameterized by a non-negative convex function $G:\mathbb{R}_+\rightarrow\mathbb{R}_+$ with $G(0)=0$: the…
We establish embeddings on a class of Sobolev spaces with potential weights on unbounded domains. Our results provide embeddings into weighted Lebesgue spaces $L^q_\theta$ with radial power weights and establish the existence and…
We develop a new class of spatial voting models for binary preference data that can accommodate both monotonic and non-monotonic response functions, and are more flexible than alternative "unfolding" models previously introduced in the…
We prove several discrete Gagliardo-Nirenberg-Sobolev and Poincar\'e-Sobolev inequalities for some approximations with arbitrary boundary values on finite volume meshes. The keypoint of our approach is to use the continuous embedding of the…
Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…
Learning low-dimensional numerical representations from symbolic data, e.g., embedding the nodes of a graph into a geometric space, is an important concept in machine learning. While embedding into Euclidean space is common, recent…