Related papers: A remark on approximation with polynomials and gre…
We show that the greedy algorithm for adaptive-submodular cover has approximation ratio at least 1.3*(1+ln Q). Moreover, the instance demonstrating this gap has Q=1. So, it invalidates a prior result in the paper ``Adaptive Submodularity: A…
The problem of minimization of a quadratic functional depending on great number of binary variables is examined. 3 variants of minimization procedure are studied with the aid of computer simulation for spin-glass matrices. It is shown that…
We construct for each $0<p\le 1$ an infinite collection of subspaces of $\ell_p$ that extend the example from [J. Lindenstrauss, On a certain subspace of $\ell_{1}$, Bull. Acad. Polon. Sci. S\'er. Sci. Math. Astronom. Phys. 12 (1964),…
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 work, we consider the maximization of submodular functions constrained by independence systems. Because of the wide applicability of submodular functions, this problem has been extensively studied in the literature, on specialized…
We show that any subset of the natural numbers with positive logarithmic Banach density contains a set that is within a factor of two of a geometric progression, improving the bound on a previous result of the authors. Density conditions on…
Set Cover is a classic NP-hard problem; as shown by Slav\'{i}k (1997) the greedy algorithm gives an approximation ratio of $\ln n - \ln \ln n + \Theta(1)$. A series of works by Lund \& Yannakakis (1994), Feige (1998), Moshkovitz (2015) have…
We show the existence of a deep neural network capable of approximating a wide class of high-dimensional approximations. The construction of the proposed neural network is based on a quasi-optimal polynomial approximation. We show that this…
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\{ Ax \geq r \}$ minimizing a non-negative…
This paper studies generic and perturbation properties inside the linear space of $m\times (m+n)$ polynomial matrices whose rows have degrees bounded by a given list $d_1, \ldots, d_m$ of natural numbers, which in the particular case $d_1 =…
In this paper, we establish new advances in the theory started by T. Oikhberg in [15] where the author joins greedy approximation theory with the use of sequences with gaps. Concretely, we address and partially answer three open questions…
We study greedy approximation in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA) is defined for any Banach space $X$ and a dictionary $\mathcal{D}$, and provides nonlinear $n$-term approximation with respect to…
$\newcommand{\eps}{\varepsilon}$ In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path…
In this note we show that a recent existence result on quasiequilibrium problems, which seems to improve deeply some well-known results, is not correct. We exhibit a counterexample and we furnish a generalization of a lemma about continuous…
Given a frequency $\lambda=(\lambda_n)$, we consider the Hardy spaces $ \mathcal{H}_p^\lambda$ of $\lambda$-Dirichlet series $ D = \sum_n a_n e^{-\lambda_n s}$ and study the asymptotic behavior of the upper and lower democracy functions of…
A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…
We study the Banach space $D([0,1]^m)$ of functions of several variables that are (in a certain sense) right-continuous with left limits, and extend several results previously known for the standard case $m=1$. We give, for example, a…
A generalization of Problem 73 of Mazur and Orlicz in the Scottish Book was introduced from L. Harris. The exact value of the constant that appears there is known when complex normed linear spaces are considered. In this paper, we give…
Ensembles of independently trained neural networks are a state-of-the-art approach to estimate predictive uncertainty in Deep Learning, and can be interpreted as an approximation of the posterior distribution via a mixture of delta…
Bayesian Reinforcement Learning (RL) is capable of not only incorporating domain knowledge, but also solving the exploration-exploitation dilemma in a natural way. As Bayesian RL is intractable except for special cases, previous work has…