Related papers: Efficient Method for Computing Lower Bounds on the…
Mixed level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao and Gilbert-Varshamov type bounds for mixed level orthogonal arrays. The computational complexity of the terms involved…
A new algorithm for solving the solution of the linear-quadratic optimization problem (LQP) with unseparated boundary conditions in the continuous case is given. Using the properties of symmetry of the corresponding Hamiltonian matrix, the…
Motivated by statistical analysis of latent factor models for high-frequency financial data, we develop sharp upper bounds for the spectral norm of the realized covariance matrix of a high-dimensional It\^o semimartingale with possibly…
We address the stability problem for linear switching systems with mode-dependent restrictions on the switching intervals. Their lengths can be bounded as from below (the guaranteed dwell-time) as from above. The upper bounds make this…
Communication is a major factor determining the performance of algorithms on current computing systems; it is therefore valuable to provide tight lower bounds on the communication complexity of computations. This paper presents a lower…
We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices…
The Cram\'er-Rao bound (CRB), a well-known lower bound on the performance of any unbiased parameter estimator, has been used to study a wide variety of problems. However, to obtain the CRB, requires an analytical expression for the…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
LP relaxation-based message passing algorithms provide an effective tool for MAP inference over Probabilistic Graphical Models. However, different LP relaxations often have different objective functions and variables of differing…
This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…
We consider a positive and power-bounded linear operator $T$ on $L^p$ over a finite measure space and prove that, if $TL^p \subseteq L^q$ for some $q > p$, then the essential spectral radius of $T$ is strictly smaller than $1$. As a special…
In the paper "The best m-term approximation and greedy algorithms" (V. N. Temlyakov), an error bound for a near best m-term approximation of a function g in L^p([0,1]^d) is provided, using a basis L^p-equivalent to the Haar system, where p…
We extend the framework of quantum pushforward designs to the approximate setting, where averaging is achieved only up to finite precision. Using Schatten $p$-norms and Lipschitz continuity arguments, we derive bounds on the approximation…
The robustness of the stability properties of dynamical systems in the presence of unknown/adversarial perturbations to system parameters is a desirable property. In this paper, we present methods to efficiently compute and improve the…
We study pathwise approximation of scalar stochastic differential equations at a single time point or globally in time by means of methods that are based on finitely many observations of the driving Brownian motion. We prove lower error…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
We start presenting an $L^{\infty}$-gradient bound for solutions to non-homogeneous $p$-Laplacean type systems and equations, via suitable non-linear potentials of the right hand side. Such a bound implies a Lorentz space characterization…
We prove an estimate on the modulus of continuity at a boundary point of a cylindrical domain for local weak solutions to singular parabolic equations of p-laplacian type. The estimate is given in terms of a Wiener-type integral, defined by…
We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…
We prove an a priori lower bound for the pressure, or $p$-norm joint spectral radius, of a measure on the set of $d \times d$ real matrices which parallels a result of J. Bochi for the joint spectral radius. We apply this lower bound to…