Related papers: Weak weight-semi-greedy Markushevich bases
We introduce the notion of weakly associative algebra and its relations with the notion of nonassociative Poisson algebras.
In this article, we present a greedy algorithm based on a tensor product decomposition, whose aim is to compute the global minimum of a strongly convex energy functional. We prove the convergence of our method provided that the gradient of…
Active perception strategies enable an agent to selectively gather information in a way to improve its performance. In applications in which the agent does not have prior knowledge about the available information sources, it is crucial to…
This paper represents an extended version of an earlier note [10]. The concept of weighted entropy takes into account values of different outcomes, i.e., makes entropy context-dependent, through the weight function. We analyse analogs of…
Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the…
We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…
We continue the study initiated in [F. Albiac and P. Wojtaszczyk, Characterization of $1$-greedy bases, J. Approx. Theory 138 (2006), no. 1, 65-86] of properties related to greedy bases in the case when the constants involved are sharp,…
In this paper, we establish quantitative weak type estimates for operators that are dominated by (fractional) sparse operators in bilinear sense. Specifically, we derive bounds for both the restricted weak type $L^{p,1}\rightarrow…
The realisation of sensing modalities based on the principles of compressed sensing is often hindered by discrepancies between the mathematical model of its sensing operator, which is necessary during signal recovery, and its actual…
This paper studies various notions of approximate probabilistic bisimulation on labeled Markov chains (LMCs). We introduce approximate versions of weak and branching bisimulation, as well as a notion of $\varepsilon$-perturbed bisimulation…
Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In…
The outcome of a weak quantum measurement conditioned to a subsequent postselection (a weak value protocol) can assume peculiar values. These results cannot be explained in terms of conditional probabilistic outcomes of projective…
We show weak convergence of quantile and expectile processes to Gaussian limit processes in the space of bounded functions endowed with an appropriate semimetric which is based on the concepts of epi- and hypo convergence as introduced in…
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,…
We begin the study of how to extend few variable means to several variable ones and how to shrink means of several variables to less variables. With the help of one of the techniques we show that it is enough to check an inequality between…
We propose and analyze batch greedy heuristics for cardinality constrained maximization of non-submodular non-decreasing set functions. We consider the standard greedy paradigm, along with its distributed greedy and stochastic greedy…
We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…
We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The…
In this paper, we investigate Lefschetz properties of Veronese subalgebras. We show that, for a sufficiently large $r$, the $r$\textsuperscript{th} Veronese subalgebra of a Cohen-Macaulay standard graded $K$-algebra has properties similar…
In this article, we give a few examples of local rings in relation to weak normality and seminormality in mixed characteristic. It is known that two concepts can differ in the equal prime characteristic case, while they coincide in the…