Related papers: Smoothed Analysis of Interior-Point Algorithms: Co…

This work proposes a computational multiscale method for the mixed formulation of a second-order linear elliptic equation subject to a homogeneous Neumann boundary condition, based on a stable localized orthogonal decomposition (LOD) in…

We introduce a novel method for encoding integers using smooth real-valued functions whose integral properties implicitly reflect discrete quantities. In contrast to classical representations, where the integer appears as an explicit…

Let $m\ge 2$ be an integer, $K$ an algebraic number field and $\alpha\in K\setminus \{0,-1\}$ with sufficiently small absolute value. In this article, we provide a new lower bound for linear form in…

We obtain a new lower bound on the information-based complexity of first-order minimization of smooth and convex functions. We show that the bound matches the worst-case performance of the recently introduced Optimized Gradient Method,…

We establish an excess risk bound of O(H R_n^2 + R_n \sqrt{H L*}) for empirical risk minimization with an H-smooth loss function and a hypothesis class with Rademacher complexity R_n, where L* is the best risk achievable by the hypothesis…

A spectral analysis is done on the $L$ operator of the Lax pair for the Benjamin-Ono equation. Simplicity and finiteness of the discrete spectrum are established as are needed for the Fokas and Ablowitz inverse scattering transform scheme.…

We consider the problem of computing, given a set S of n points in the plane, which points of S are vertices of the convex hull of S. For certain variations of this problem, different proofs exist that the complexity of this problem in the…

This paper studies finite-sample set-membership identification for discrete-time bilinear systems under bounded symmetric log-concave disturbances. Compared with existing finite-sample results for linear systems and related analyses under…

We analyze stochastic conditional gradient methods for constrained optimization problems arising in over-parametrized machine learning. We show that one could leverage the interpolation-like conditions satisfied by such models to obtain…

A map of fine log schemes $X \to Y$ induces a map from the scheme underlying $X$ to Olsson's algebraic stack of strict morphisms of fine log schemes over $Y$. A sheaf on $X$ is called \emph{log flat over} $Y$ iff it is flat over this…

This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for…

We show that several classical quantities controlling compressed sensing performance directly match classical parameters controlling algorithmic complexity. We first describe linearly convergent restart schemes on first-order methods…

We give new a priori assumptions on weak solutions of the Navier-Stokes equation so as to be able to conclude that they are smooth. The regularity criteria are given in terms of mixed radial-angular weighted Lebesgue space norms.

Evaluation complexity for convexly constrained optimization is considered and it is shown first that the complexity bound of $O(\epsilon^{-3/2})$ proved by Cartis, Gould and Toint (IMAJNA 32(4) 2012, pp.1662-1695) for computing an…

We establish certain square function estimates for a class of oscillatory integral operators with homogeneous phase functions. These results are employed to deduce a refinement of a previous result of Mockenhaupt Seeger and Sogge…

An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…

The rational homology of unordered configuration spaces of points on any surface was studied by Drummond-Cole and Knudsen. We compute the rational cohomology of configuration spaces on a closed orientable surface, keeping track of the mixed…

In this note, we show that the $L\log L$ hypothesis is the strongest size condition on a homogeneous rough function on the sphere which ensures the weak type $(1,1)$ boundedness of the corresponding singular integral $T_\Omega$, provided…

In [Huang-Raskind 2009], the authors proved that the discrete logarithm problem in a prime finite field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. In this paper, we do this for a…

We study the problem of multiway number partition optimization, which has a myriad of applications in the decision, learning and optimization literature. Even though the original multiway partitioning problem is NP-hard and requires…