相关论文: Computing p-summing norms with few vectors

The matrix $p \rightarrow q$ norm is a fundamental quantity appearing in a variety of areas of mathematics. This quantity is known to be efficiently computable in only a few special cases. The best known algorithms for approximately…

It is well known that a binomial $(n,p)$ can be approximated by a Poisson distribution with parameter $np$. The typical approach in undergraduate probability texts is to show a convergence result for the distribution of the binomial as $n$…

We extend to higher dimensions some of the valuative analysis of singularities of plurisubharmonic (psh) functions developed by the last two authors. Following Kontsevich and Soibelman we describe the geometry of the space V of all…

We draw attention to simplifications in the theory of a N\"orlund summation method $(N, p)$ that arise when the series $\sum_{n \geqslant 0} p_n$ is convergent.

The paper studies a general norm minimization problem on a product of normed vector spaces. We establish dual necessary and sufficient optimality conditions and derive explicit formulas for the corresponding solution sets. These formulas…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

The $2 \rightarrow q$ norm of a matrix $X \in \mathbb{R}^{n \times d}$ is defined as $\lVert X \rVert_{2 \rightarrow q} = \sup_{\lVert v \rVert_2 = 1} \lVert Xv \rVert_q$. We give polynomial-time multiplicative approximation algorithms for…

Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in…

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

For a given testing problem, let $U_1,...,U_n$ be individually valid and conditionally on the data i.i.d.\ P-variables (often called P-values). For example, the data could come in groups, and each $U_i$ could be based on subsampling just…

It is well known that not every summability property for non linear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to…

Let $X,Y$ and $Z$ be Banach spaces, and let $\prod_p(Y,Z) (1\leq p<\infty)$ denote the space of $p$-summing operators from $Y$ to $Z$. We show that, if $X$ is a {\it \$}$_\infty$-space, then a bounded linear operator $T: X\hat…

In computational practice, most attention is paid to rational approximations of functions and approximations by the sum of exponents. We consider a wide enough class of nonlinear approximations characterized by a set of two required…

We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}.…

Let $f(n)=\sum_k \binom nk^{-1}$. In a previous paper, we defined for a p-adic integer x that f(x) is p-definable if lim $f(x_j)$ exists in $Q_p$, where $x_j$ denotes the mod $p^j$ reduction of $x$. We proved that if p is odd, then -1 is…

We explain the concept of p-values presupposing only rudimentary probability theory. We also use the occasion to introduce the notion of p-function, so that p-values are values of a p-function. The explanation is restricted to the discrete…

Representing meaning in the form of high dimensional vectors is a common and powerful tool in biologically inspired architectures. While the meaning of a set of concepts can be summarized by taking a (possibly weighted) sum of their…

This paper proposes general methods for the problem of multiple testing of a single hypothesis, with a standard goal of combining a number of p-values without making any assumptions about their dependence structure. An old result by…

In this paper, we address the problem of approximating a multivariate function defined on a general domain in $d$ dimensions from sample points. We consider weighted least-squares approximation in an arbitrary finite-dimensional space $P$…