Related papers: Two examples of non strictly convex large deviatio…
A classic approach in dynamical systems is to use particular geometric structures to deduce statistical properties, for example the existence of invariant measures with stochastic-like behaviour such as large deviations or decay of…
Laws of large numbers, starting from certain nonequilibrium measures, have been shown for the integrated current across a bond, and a tagged particle in one-dimensional symmetric nearest-neighbor simple exclusion [Ann. Inst. Henri Poincare…
Recently, there has been a surge of interest in designing variants of the classical Newton-CG in which the Hessian of a (strongly) convex function is replaced by suitable approximations. This is mainly motivated by large-scale finite-sum…
Convergence rates results for variational regularization methods typically assume the regularization functional to be convex. While this assumption is natural for scalar-valued functions, it can be unnecessarily strong for vector-valued…
This work extends the variance reduction method for the pricing of possibly path-dependent derivatives, which was developed in (Genin and Tankov, 2016) for exponential L\'evy models, to affine stochastic volatility models (Keller-Ressel,…
We use a weak Gibbs property and a weak form of specification to derive level-2 large deviations principles for symbolic systems equipped with a large class of reference measures. This has applications to a broad class of symbolic systems,…
We provide larger step-size restrictions for which gradient descent based algorithms (almost surely) avoid strict saddle points. In particular, consider a twice differentiable (non-convex) objective function whose gradient has Lipschitz…
We initiate a study of large deviations for block model random graphs in the dense regime. Following Chatterjee-Varadhan(2011), we establish an LDP for dense block models, viewed as random graphons. As an application of our result, we study…
We study large deviations of a ratio observable in discrete-time reset processes. The ratio takes the form of a current divided by the number of reset steps and as such it is not extensive in time. A large deviation rate function can be…
We present large deviations principles for the moments of the empirical spectral measure of Wigner matrices and empirical measure of $\beta$-ensembles in three cases : the case of Wigner matrices without Gaussian tails, that is Wigner…
We investigate an additive perturbation of a complex Wishart random matrix and prove that a large deviation principle holds for the spectral measures. The rate function is associated to a vector equilibrium problem coming from logarithmic…
Under the linear regression framework, we study the variable selection problem when the underlying model is assumed to have a small number of nonzero coefficients (i.e., the underlying linear model is sparse). Non-convex penalties in…
In this paper, we consider a kind of fully coupled slow fast motion, in which the slow variable satisfies the non Lipschitz condition. We prove that the stochastic flow of the slow variable exists and moreover, satisfies the large deviation…
The Freidlin-Wentzell large deviation principle is established for the distributions of stochastic evolution equations with general monotone drift and small multiplicative noise. As examples, the main results are applied to derive the large…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
A large deviation principle is established for a general class of stochastic flows in the small noise limit. This result is then applied to a Bayesian formulation of an image matching problem, and an approximate maximum likelihood property…
For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate…
We provide a full characterisation of the large-maturity forward implied volatility smile in the Heston model. Although the leading decay is provided by a fairly classical large deviations behaviour, the algebraic expansion providing the…
We study a well known machine learning model -the perceptron- as a simple model of jamming of hard objects. We exhibit two regimes: 1) a convex optimisation regime where jamming is hypostatic and non-critical. 2) a non convex optimisation…
The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…