相关论文: Lebesgue-type inequalities in greedy approximation

This paper concerns parameterized convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional Banach (resp. finite-dimensional) spaces and that are indexed by an arbitrary fixed set T…

We give weighted norm inequalities for the maximal fractional operator $ \mathcal M_{q,\beta}$ of Hardy-Littlewood and the fractional integral $I_{\gamma}$. These inequalities are established between $(L^{q},L^{p}) ^{\alpha}(X,d,\mu)$…

We propose a new yet natural algorithm for learning the graph structure of general discrete graphical models (a.k.a. Markov random fields) from samples. Our algorithm finds the neighborhood of a node by sequentially adding nodes that…

In the first part of this paper, we prove that, under some natural non-degeneracy assumptions, the Greedy Parabolic Target-Following Method, based on {\em universal tangent direction} has a favorable local behavior. In view of its global…

We show that, for suitable enumerations, the multivariate Haar system is a Schauder basis in the classical Sobolev spaces on $\mathbb R^d$ with integrability $1<p<\infty$ and smoothness $1/p-1<s<1/p$. This complements earlier work by the…

We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…

A new primal-dual weak Galerkin (PDWG) finite element method is introduced and analyzed for the ill-posed elliptic Cauchy problems with ultra-low regularity assumptions on the exact solution. The Euler-Lagrange formulation resulting from…

We consider the influence maximization problem (selecting $k$ seeds in a network maximizing the expected total influence) on undirected graphs under the linear threshold model. On the one hand, we prove that the greedy algorithm always…

We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy and w-partially-greedy bases, and show some properties of w-semi-greedy bases. To…

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…

We consider parabolic evolution equations with Lipschitz continuous and strongly monotone spatial operators. By introducing an additional variable, we construct an equivalent system where the operator is a Lipschitz continuous mapping from…

Reduced bases have been introduced for the approximation of parametrized PDEs in applications where many online queries are required. Their numerical efficiency for such problems has been theoretically confirmed in \cite{BCDDPW,DPW}, where…

Given a graph $G=(V,E)$, suppose we are interested in selecting a sequence of vertices $(x_j)_{j=1}^n$ such that $\left\{x_1, \dots, x_k\right\}$ is `well-distributed' uniformly in $k$. We describe a greedy algorithm motivated by potential…

In many prediction problems, it is not uncommon that the number of variables used to construct a forecast is of the same order of magnitude as the sample size, if not larger. We then face the problem of constructing a prediction in the…

This paper studies the regularity problem for block uniformly elliptic operators in divergence form with complex bounded measurable coefficients. We consider the case where the boundary data belongs to Lebesgue spaces with weights in the…

The main goal of this paper is twofold. First, we extend some results known in the case of weak greedy algorithms with a scalar parameter to the case of weak greedy algorithms with a weakness sequence. Second, we formulate a new setting of…

We study Langevin-type algorithms for sampling from Gibbs distributions such that the potentials are dissipative and their weak gradients have finite moduli of continuity not necessarily convergent to zero. Our main result is a…

We obtain the boundedness in $L^p$ spaces for all $1<p<\infty$ of the so-called vertical Littlewood--Paley functions for non-local Dirichlet forms in the metric measure space under some mild assumptions. For $1<p\le 2$, the pseudo-gradient…

The seminar assignment problem is a variant of the generalized assignment problem in which items have unit size and the amount of space allowed in each bin is restricted to an arbitrary set of values. The problem has been shown to be…

Nonlinear kernels can be approximated using finite-dimensional feature maps for efficient risk minimization. Due to the inherent trade-off between the dimension of the (mapped) feature space and the approximation accuracy, the key problem…