相关论文: Greedy expansions with prescribed coefficients in …

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 analyse the problem of controllability for parameter-dependent linear finite-dimensional systems. The goal is to identify the most distinguished realisations of those parameters so to better describe or approximate the whole range of…

Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces. In the convex case, the sequence of iterates ${u_n}$ converges weakly to a point in the…

Tsirelson's space $\mathcal{T}$ made its appearance in Banach space theory in 1974 soon to become one of the most significant counterexamples in the theory. Its structure broke the ideal pattern that analysts had conceived for a generic…

We present convergence estimates of two types of greedy algorithms in terms of the metric entropy of underlying compact sets. In the first part, we measure the error of a standard greedy reduced basis method for parametric PDEs by the…

We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalized Dyck words.

This paper proposes a unified framework for the investigation of constrained learning theory in reflexive Banach spaces of features via regularized empirical risk minimization. The focus is placed on Tikhonov-like regularization with…

This paper addresses the study and characterizations of variational convexity of extended-real-valued functions on Banach spaces. This notion has been recently introduced by Rockafellar, and its importance has been already realized and…

We investigate two greedy strategies for finding an approximation to the minimum of a convex function $E$ defined on a Hilbert space $H$. We prove convergence rates for these algorithms under suitable conditions on the objective function…

An algebra of bounded linear operators on a Banach space is said to be {\em strongly compact} if its unit ball is precompact in the strong operator topology, and a bounded linear operator on a Banach space is said to be {\em strongly…

We study the existence of global implicit functions for equations defined on open subsets of Banach spaces. The partial derivative with respect to the second variable is only required to have a left inverse instead of being invertible.…

We study the problem of improving the greedy constant or the democracy constant of a basis of a Banach space by renorming. We prove that every Banach space with a greedy basis can be renormed, for a given $\vare>0$, so that the basis…

In 1992, Kiendi, Adamy and Stelzner investigated under which conditions a certain type of function constituted a Lyapunov function for some time-invariant linear system. Six years later, it was obtained that this property holds if and only…

It is known that for a conditional quasi-greedy basis $\mathcal{B}$ in a Banach space $\mathbb{X}$, the associated sequence $(k_{m}[\mathcal{B}])_{m=1}^{\infty}$ of its conditionality constants verifies the estimate…

It is a longstanding problem whether every contractible Banach algebra is necessarily finite-dimensional. In this note, we confirm this for Banach algebras acting on Banach spaces with the uniform approximation property. This generalizes a…

We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe (2011) from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this…

We consider an optimization problem where the decision variable is a string of bounded length. For some time there has been an interest in bounding the performance of the greedy strategy for this problem. Here, we provide weakened…

Greedy methods have recently been successfully applied to generalized kernel interpolation, or the recovery of a function from data stemming from the evaluation of linear functionals, including the approximation of solutions of linear PDEs…

A problem of Banach asks whether every infinite-dimensional Banach space which is isomorphic to all its infinite-dimensional subspaces must be isomorphic to a separable Hilbert space. In this paper we prove a result of a Ramsey-theoretic…

Kernel methods are versatile tools for function approximation and surrogate modeling. In particular, greedy techniques offer computational efficiency and reliability through inherent sparsity and provable convergence. Inspired by the…