Related papers: Open descent and strong approximation

We show an example of a non-archimedean version of the Calabi-Yau theorem in complex geometry. Precisely, we consider totally degenerate abelian varieties and certain probability measures on their associated analytic spaces in the sense of…

In this note, we establish a new exact worst-case linear convergence rate of the proximal gradient method in terms of the proximal gradient norm, which complements the recent results in [1] and implies a refined descent lemma.descent lemma.…

Fractional derivatives are a well-studied generalization of integer order derivatives. Naturally, for optimization, it is of interest to understand the convergence properties of gradient descent using fractional derivatives. Convergence…

Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of random variables. These results are intimately related to…

We prove a descent result for affine/projective varieties defined over an algebraically closed field. The idea is to work with the reduced Groebner basis of the ideal where the variety vanishes and study it's behaviour under group action…

We simplify proof of the theorem that close to any pseudoholomorphic disk there passes a pseudoholomorphic disk of arbitrary close size with any pre-described sufficiently close direction. We apply these results to the Kobayashi and Hanh…

We investigate the distribution of real algebraic numbers of a fixed degree having a close conjugate number, the distance between the conjugate numbers being given as a function of their height. The main result establishes the ubiquity of…

We first exhibit counterexamples to some open questions related to a theorem of Sakai. Then we establish an extension theorem of Sakai type for separately holomorphic/meromorphic functions.

Strong variational sufficiency is a newly proposed property, which turns out to be of great use in the convergence analysis of multiplier methods. However, what this property implies for non-polyhedral problems remains a puzzle. In this…

The goal of this paper is to go further in the analysis of the behavior of the number of descents in a random permutation. Via two different approaches relying on a suitable martingale decomposition or on the Irwin-Hall distribution, we…

We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical…

We establish a relative version of Gromov's Vanishing Theorem in the presence of amenable open covers with small multiplicity, extending a result of Li, L\"oh, and Moraschini. Our approach relies on Gromov's theory of multicomplexes.

In this paper, we propose a novel sufficient decrease technique for variance reduced stochastic gradient descent methods such as SAG, SVRG and SAGA. In order to make sufficient decrease for stochastic optimization, we design a new…

We extend some parts of the representation theory for integral quadratic forms over the ring of integers of a number field to the case over the coordinate ring $k[C]$ of an affine curve $C$ over a general base field $k$. By using the genus…

Wirsing's theorem on approximating algebraic numbers by algebraic numbers of bounded degree is a generalization of Roth's theorem in Diophantine approximation. We study variations of Wirsing's theorem where the inequality in the theorem is…

In this paper, we establish the convergence of the stochastic Heavy Ball (SHB) algorithm under more general conditions than in the current literature. Specifically, (i) The stochastic gradient is permitted to be biased, and also, to have…

In this article we formulate a version of the analytic Novikov conjecture for semigroups rather than groups, and show that the descent argument from coarse geometry generalises effectively to this new situation.

An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…

We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…

We develop an exact coordinate descent algorithm for high-dimensional regularized Huber regression. In contrast to composite gradient descent methods, our algorithm fully exploits the advantages of coordinate descent when the underlying…