English
Related papers

Related papers: Lower-Order Refinements of Greedy Approximation

200 papers

The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible…

Combinatorics · Mathematics 2025-07-14 Hebert Pérez-Rosés

A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition…

Optimization and Control · Mathematics 2020-11-02 S Buchwald , G Ciaramella , Julien Salomon

Democracy functions of wavelet admissible bases are computed for weighted Orlicz Spaces in terms of its fundamental function. In particular, we prove that these bases are greedy if and only if the Orlicz space is a Lebesgue space. Also,…

History and Overview · Mathematics 2009-11-26 Maria de Natividade

We consider the problem of maximizing non-negative non-decreasing set functions. Although most of the recent work focus on exploiting submodularity, it turns out that several objectives we encounter in practice are not submodular.…

Data Structures and Algorithms · Computer Science 2018-06-19 Gaurav Gupta , Sergio Pequito , Paul Bogdan

In this paper, we study greedy variants of quasi-Newton methods. They are based on the updating formulas from a certain subclass of the Broyden family. In particular, this subclass includes the well-known DFP, BFGS and SR1 updates. However,…

Optimization and Control · Mathematics 2021-06-02 Anton Rodomanov , Yurii Nesterov

We study rational numbers with purely periodic R\'enyi $\beta$-expansions. For bases $\beta$ satisfying $\beta^2=a\beta+b$ with $b$ dividing $a$, we give a necessary and sufficient condition for $\gamma(\beta)=1$, i.e., that all rational…

Dynamical Systems · Mathematics 2018-03-15 Tomáš Hejda , Wolfgang Steiner

Motivated by a wide range of applications in data mining and machine learning, we consider the problem of maximizing a submodular function subject to supermodular cost constraints. In contrast to the well-understood setting of cardinality…

Data Structures and Algorithms · Computer Science 2026-02-19 Ajitesh Srivastava , Shanghua Teng

A $k$-submodular function naturally generalizes submodular functions by taking as input $k$ disjoint subsets, rather than a single subset. Unlike standard submodular maximization, which only requires selecting elements for the solution,…

Data Structures and Algorithms · Computer Science 2025-07-18 Chenhao Wang

In this paper, we study the notion of approximately bi at Banach algebras for second dual Banach algebras and semigroup algebras. We show that for a locally compact group G, if S(G)?? is approximately bi at, then G is amenable group. Also…

Functional Analysis · Mathematics 2016-10-04 Amir Sahami

We consider numeration systems where digits are integers and the base is an algebraic number $\beta$ such that $|\beta|>1$ and $\beta$ satisfies a polynomial where one coefficient is dominant in a certain sense. For this class of bases…

Number Theory · Mathematics 2011-06-21 Christiane Frougny , Edita Pelantová , Milena Svobodová

We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) achieves an approximation bound of $(\ln (Q/\eta)+1)$ for Stochastic Submodular Cover: here $Q$ is the "goal value" and $\eta$ is the smallest non-zero marginal…

Data Structures and Algorithms · Computer Science 2021-08-03 Lisa Hellerstein , Devorah Kletenik , Srinivasan Parthasarathy

We suggest a new greedy strategy for convex optimization in Banach spaces and prove its convergent rates under a suitable behavior of the modulus of uniform smoothness of the objective function.

Optimization and Control · Mathematics 2015-05-15 Zheming Gao , Guergana Petrova

We will show that an unconditional basis in a Banach space is equivalent to the unit vector basis of $c_0$ or $\ell_p$ for $1\le p < \infty$ if and only if all finitely supported blocks of the basis generated by a unit vector and its dual…

Functional Analysis · Mathematics 2022-02-16 P. G. Casazza

We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead…

Machine Learning · Computer Science 2020-05-05 Tan Nguyen , Nan Ye , Peter L. Bartlett

We provide theoretical bounds on the worst case performance of the greedy algorithm in seeking to maximize a normalized, monotone, but not necessarily submodular objective function under a simple partition matroid constraint. We also…

Systems and Control · Electrical Eng. & Systems 2022-10-19 Benjamin Biggs , James McMahon , Philip Baldoni , Daniel J. Stilwell

The notions of module pseudo-amenable and module pseudo-contractible Banach algebras are introduced. For a Banach algebra with bounded approximate identity, module pseudo-amenability and module approximate amenability are the same…

Functional Analysis · Mathematics 2015-06-10 Abasalt Bodaghi , Ali Jabbari

A set $A$ of nonnegative integers is called a $B_h$-set if every solution to $a_1+\dots+a_h = b_1+\dots+b_h$, where $a_i,b_i \in A$, has $\{a_1,\dots,a_h\}=\{b_1,\dots,b_h\}$ (as multisets). Let $\gamma_k(h)$ be the $k$-th positive element…

Number Theory · Mathematics 2024-05-01 Kevin O'Bryant

The paper is devoted to two particular cases of the following general problem. Let $\alpha$ and $\beta$ be two types of bases in Banach spaces. Let a Banach space $X$ has bases of both types and a subspace $M\subset X^*$ contains the…

Functional Analysis · Mathematics 2010-09-07 Mikhail I. Ostrovskii

We show that finite dimensional Banach spaces fail to be uniformly non locally almost square. Moreover, we construct an equivalent almost square bidual norm on $\ell_\infty.$ As a consequence we get that every dual Banach space containing…

Functional Analysis · Mathematics 2020-03-10 Trond A. Abrahamsen , Petr Hájek , Stanimir Troyanski

In recent work of the authors the notion of a derivation being approximately semi-inner arose as a tool for investigating (approximate) amenability questions for Banach algebras. Here we investigate this property in its own right, together…

Functional Analysis · Mathematics 2019-10-10 F. Ghahramani , R. J. Loy