Related papers: A New Initial Approximation Bound in the Durand Ke…

Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…

Clustering is a pivotal challenge in unsupervised machine learning and is often investigated through the lens of mixture models. The optimal error rate for recovering cluster labels in Gaussian and sub-Gaussian mixture models involves ad…

We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix) programs through sums-of-squares…

Laguerre's rootfinding algorithm is highly recommended although most of its properties are known only by empirical evidence. In view of this, we prove the first sufficient convergence criterion. It is applicable to simple roots of…

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…

In this paper, we study first-order methods on a large variety of low-rank matrix optimization problems, whose solutions only live in a low dimensional eigenspace. Traditional first-order methods depend on the eigenvalue decomposition at…

Quasi-Newton methods refer to a class of algorithms at the interface between first and second order methods. They aim to progress as substantially as second order methods per iteration, while maintaining the computational complexity of…

Pruning the weights of randomly initialized neural networks plays an important role in the context of lottery ticket hypothesis. Ramanujan et al. (2020) empirically showed that only pruning the weights can achieve remarkable performance…

Zhang Neural Networks rely on convergent 1-step ahead finite difference formulas of which very few are known. Those which are known have been constructed in ad-hoc ways and suffer from low truncation error orders. This paper develops a…

We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…

Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation…

For a pair of polynomials with real or complex coefficients, given in any particular basis, the problem of finding their GCD is known to be ill-posed. An answer is still desired for many applications, however. Hence, looking for a GCD of…

A smoothness-increasing accuracy conserving filtering approach to the regularization of discontinuities is presented for single domain spectral collocation approximations of hyperbolic conservation laws. The filter is based on convolution…

Low-rank approximation of kernels is a fundamental mathematical problem with widespread algorithmic applications. Often the kernel is restricted to an algebraic variety, e.g., in problems involving sparse or low-rank data. We show that…

We introduce in this paper an optimal first-order method that allows an easy and cheap evaluation of the local Lipschitz constant of the objective's gradient. This constant must ideally be chosen at every iteration as small as possible,…

In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…

Given a polynomial $p$ of degree $d$ and a bound $\kappa$ on a condition number of $p$, we present the first root-finding algorithms that return all its real and complex roots with a number of bit operations quasi-linear in $d…

In this paper, we introduce a powerful technique based on Leave-one-out analysis to the study of low-rank matrix completion problems. Using this technique, we develop a general approach for obtaining fine-grained, entrywise bounds for…