Sparsifying sums of norms

From MaRDI portal
Publication:6436737




Abstract: For any norms N1,ldots,Nm on mathbbRn and N(x):=N1(x)+cdots+Nm(x), we show there is a sparsified norm ildeN(x)=w1N1(x)+cdots+wmNm(x) such that |N(x)ildeN(x)|leqepsilonN(x) for all xinmathbbRn, where w1,ldots,wm are non-negative weights, of which only O(epsilon2nlog(n/epsilon)(logn)2.5) are non-zero. Additionally, we show that such weights can be found with high probability in time O(m(logn)O(1)+mathrmpoly(n))T, where T is the time required to evaluate a norm Ni(x), assuming that N(x) is mathrmpoly(n)-equivalent to the Euclidean norm. This immediately yields analogous statements for sparsifying sums of symmetric submodular functions. More generally, we show how to sparsify sums of pth powers of norms when the sum is p-uniformly smooth.











This page was built for publication: Sparsifying sums of norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6436737)