Related papers: Slightly Improved Upper Bound on the Integrality R…
We propose a framework for sensitivity analysis of linear programs (LPs) in minimization form, allowing for simultaneous perturbations in the objective coefficients and right-hand sides, where the perturbations are modeled in a compact,…
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold…
After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a Hamiltonian tour of length at most (4/3)n, establishing in…
We study adaptive regret bounds in terms of the variation of the losses (the so-called path-length bounds) for both multi-armed bandit and more generally linear bandit. We first show that the seemingly suboptimal path-length bound of (Wei…
We find explicit and optimal upper bounds for the expected occupation density for an It\^o-process when its drift and diffusion coefficients are unknown under boundedness and ellipticity conditions on the coefficients. This is related to…
We show that the max entropy algorithm can be derandomized (with respect to a particular objective function) to give a deterministic $3/2-\epsilon$ approximation algorithm for metric TSP for some $\epsilon > 10^{-36}$. To obtain our result,…
In this paper, we study the convergence rate of the gradient (or steepest descent) method with fixed step lengths for finding a stationary point of an $L$-smooth function. We establish a new convergence rate, and show that the bound may be…
In this paper we obtain degree of approximation of functions in Lp by operators associated with their Fourier series using integral modulus of continuity. These results generalize many know results and are proved under less stringent…
This paper contains a small improvement to the explicit bounds on the growth of the function $S(T)$. It is shown how more substantial improvements are possible if one has better explicit bounds on the growth of $|\zeta(\frac{1}{2}+it)|$.
In this paper, we consider differential approximability of the traveling salesman problem (TSP). We show that TSP is $3/4$-differential approximable, which improves the currently best known bound $3/4 -O(1/n)$ due to Escoffier and Monnot in…
We investigate the optimal rate of convergence in the multidimensional normal approximation of vector-valued Wiener-Ito integrals of which components all belong to the same fixed Wiener chaos. Combining Malliavin calculus, Stein's method…
We consider the MAP-MRF inference task, that is, minimizing a function of discrete variables represented as a sum of unary and pairwise terms. A prominent approach for tackling this NP-hard problem in practice is to solve its natural LP…
We demonstrate that the integrality gap of the natural cut-based LP relaxation for the directed Steiner tree problem is $O(\log k)$ in quasi-bipartite graphs with $k$ terminals. Such instances can be seen to generalize set cover, so the…
The use of random sampling in decision-making and control has become popular with the ease of access to graphic processing units that can generate and calculate multiple random trajectories for real-time robotic applications. In contrast to…
We are concerned with flow enhanced mixing of passive scalars in the presence of diffusion. Under the assumption that the velocity gradient is suitably integrable, we provide upper bounds on the exponential rates of enhanced dissipation.…
Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. Based on this algorithm…
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of TSP tours, each of which approximates the optimal solution…
We perform the first tight convergence analysis of the gradient method with varying step sizes when applied to smooth hypoconvex (weakly convex) functions. Hypoconvex functions are smooth nonconvex functions whose curvature is bounded and…
We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability $1/2$. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound,…
Simple bounds are obtained for the integral $\int_0^x\mathrm{e}^{-\gamma t}t^\nu I_\nu(t)\,\mathrm{d}t$, $x>0$, $\nu>-1/2$, $0\leq\gamma<1$, together with a natural generalisation of this integral. In particular, we obtain an upper bound…