Related papers: New error bounds for the extended vertical LCP
In a recent work, Chen, Hoza, Lyu, Tal and Wu (FOCS 2023) showed an improved error reduction framework for the derandomization of regular read-once branching programs (ROBPs). Their result is based on a clever modification to the inverse…
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…
We develop various lower bounds for the numerical radius $w(A)$ of a bounded linear operator $A$ defined on a complex Hilbert space, which improve the existing inequality $w^2(A)\geq \frac{1}{4}\|A^*A+AA^*\|$. In particular, for $r\geq 1$,…
We study the problem of reconstructing an unknown point in $\mathbb{R}^d$ from approximate linear queries. This setting arises naturally in applications ranging from low-dimensional remote sensing and signal recovery to high-dimensional…
Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions…
In the 1960s, the technique of using cluster expansion bounds in order to achieve bounds on the virial expansion was developed by Lebowitz and Penrose (1964) and Ruelle (1969). This technique is generalised to more recent cluster expansion…
Spectral enhancement -- which aims to undo spectral broadening -- leads to integral equations which are ill-posed and require special regularisation techniques for their solution. Even when an optimal regularisation technique is used,…
Using the polar decomposition of a bounded linear operator $A$ defined on a complex Hilbert space, we obtain several numerical radius inequalities of the operator $A$, which generalize and improve the earlier related ones. Among other…
The $\cp$ violating asymmetry $A(\Lambda^0_-)$ has been estimated to occur at the level of a few times $10^{-5}$ within the minimal standard model. The experiment E871 expects to reach a sensitivity of $10^{-4}$ to the asymmetry…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
We establish upper bounds for the expected excess risk of models trained by proper iterative algorithms which approximate the local minima. Unlike the results built upon the strong globally strongly convexity or global growth conditions…
Minimax lower bounds are pessimistic in nature: for any given estimator, minimax lower bounds yield the existence of a worst-case target vector $\beta^*_{worst}$ for which the prediction error of the given estimator is bounded from below.…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We analyse the reconstruction error of principal component analysis (PCA) and prove non-asymptotic upper bounds for the corresponding excess risk. These bounds unify and improve existing upper bounds from the literature. In particular, they…
We consider general logarithmic minimal models ${\cal LM}(p,p')$, with $p,p'$ coprime, on a strip of $N$ columns with the $(r,s)$ Robin boundary conditions introduced by Pearce, Rasmussen and Tipunin. The associated conformal boundary…
In statistical classification and machine learning, classification error is an important performance measure, which is minimized by the Bayes decision rule. In practice, the unknown true distribution is usually replaced with a model…
In this paper, we introduce a class of functions that assume only a limited number $\lambda$ of values within a given Hamming $\rho$-ball and call them locally $(\rho, \lambda)$-bounded functions. We develop function-correcting codes (FCCs)…
The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…
This paper considers a probabilistic model for floating-point computation in which the roundoff errors are represented by bounded random variables with mean zero. Using this model, a probabilistic bound is derived for the forward error of…
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…