181 citations · 332 across the 25 of their papers we have counts for
31 papers
Convergence Rates for Lasserre's Upper-Bound Hierarchy on with Gaussian Measure
Sander Gribling, Igor Klep, Poornendu Kumar
We establish quantitative convergence rates for Lasserre's measure-based upper-bound hierarchy on using the standard Gaussian measure as the reference measure. For a…
Improved quantum volume estimation with transducers and amortized quantum walks
Arjan Cornelissen, Simon Apers, Sander Gribling
The volume estimation problem is a classic task in computational geometry. The development of randomized algorithms for this problem spurred the development of many influential alg…
Computing Lewis weights to high precision using local relative smoothness
Sander Gribling, Aaron Sidford, Chenyi Zhang
We provide algorithms that compute -estimates of the -Lewis weights of a matrix for using rounds of leverag…
Squared polynomial approximation kernels for the hypercube: improved error bounds and implications for Lasserre hierarchies
Sander Gribling, Etienne de Klerk, Juan C. Vera
We propose a new family of polynomial approximation kernels for approximating nonnegative polynomials on the hypercube . Our Kernels produce polynomial sums-of-squares of…
Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbers
Sander Gribling, Simon Apers, Harold Nieuwboer +1
Spectral gaps play a fundamental role in many areas of mathematics, computer science, and physics. In quantum mechanics, the spectral gap of Schrödinger operators has a long histor…
Revisiting the convergence rate of the Lasserre hierarchy for polynomial optimization over the hypercube
Sander Gribling, Etienne de Klerk, Juan Vera
We revisit the problem of minimizing a given polynomial on the hypercube . Lasserre's hierarchy (also known as the moment- or sum-of-squares hierarchy) provides a seq…