A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Graph-based semi-supervised learning is the problem of propagating labels from a small number of labelled data points to a larger set of unlabelled data. This paper is concerned with the consistency of optimization-based techniques for such problems, in the limit where the labels have small noise and the underlying unl…
This paper studies least-square regression penalized with partly smooth convex regularizers. This class of functions is very large and versatile allowing to promote solutions conforming to some notion of low-complexity. Indeed, they force solutions of variational problems to belong to a low-dimensional manifold (the so…
Optimal B-robust estimate is constructed for multidimensional parameter in drift coefficient of diffusion type process with small noise. Optimal mean-variance robust (optimal V -robust) trading strategy is find to hedge in mean-variance sense the contingent claim in incomplete financial market with arbitrary informatio…
In the compagnion paper [Marginal density expansions for diffusions and stochastic volatility, part I] we discussed density expansions for multidimensional diffusions (X1,...,Xd), at fixed time T and projected to their first l coordinates, in the small noise regime. Global conditions were found which replace th…
Density expansions for hypoelliptic diffusions (X1,...,Xd) are revisited. In particular, we are interested in density expansions of the projection (XT1,...,XTl), at time T>0, with l≤d. Global conditions are found which replace the well-known "not-in-cutlocus" condition known from heat-kernel asymptot…
The one-dimensional SDE with non Lipschitz diffusion coefficient dXt=b(Xt)dt+σXtγdBt,X0=x,γ<1 is widely studied in mathematical finance. Several works have proposed asymptotic analysis of densities and implied volatilities in models involving instances of this equation, based on a careful i…
We develop the mathematical foundations of the stochastic modified equations (SME) framework for analyzing the dynamics of stochastic gradient algorithms, where the latter is approximated by a class of stochastic differential equations with small noise parameters. We prove that this approximation can be understood math…
We present a new methodology to analyze large classes of (classical and rough) stochastic volatility models, with special regard to short-time and small noise formulae for option prices. Our main tool is the theory of regularity structures, which we use in the form of [Bayer et al; A regularity structure for rough vola…
We present ErasureHead, a new approach for distributed gradient descent (GD) that mitigates system delays by employing approximate gradient coding. Gradient coded distributed GD uses redundancy to exactly recover the gradient at each iteration from a subset of compute nodes. ErasureHead instead uses approximate gradien…
In phase retrieval we want to recover an unknown signal x∈Cd from n quadratic measurements of the form yi=∣⟨ai,x⟩∣2+wi where ai∈Cd are known sensing vectors and wi is measurement noise. We ask the following weak rec…
Motivated by marginals-mimicking results for Itô processes via SDEs and by their applications to volatility modeling in finance, we discuss the weak convergence of the law of a hypoelliptic diffusions conditioned to belong to a target affine subspace at final time, namely L(Zt∣Yt=y) if $X_{\cdot}=(Y_\cd…
We consider the learning from noisy labels (NL) problem which emerges in many real-world applications. In addition to the widely-studied synthetic noise in the NL literature, we also consider the pseudo labels in semi-supervised learning (Semi-SL) as a special case of NL. For both types of noise, we argue that the gene…
People belong to multiple communities, words belong to multiple topics, and books cover multiple genres; overlapping clusters are commonplace. Many existing overlapping clustering methods model each person (or word, or book) as a non-negative weighted combination of "exemplars" who belong solely to one community, with …
We study fractional stochastic volatility models in which the volatility process is a positive continuous function σ of a continuous Gaussian process B. Forde and Zhang established a large deviation principle for the log-price process in such a model under the assumptions that the function σ is globally…
We study the problem of robust subspace recovery (RSR) in the presence of adversarial outliers. That is, we seek a subspace that contains a large portion of a dataset when some fraction of the data points are arbitrarily corrupted. We first examine a theoretical estimator that is intractable to calculate and use it to …
Non-negative matrix factorization (NMF) is a natural model of admixture and is widely used in science and engineering. A plethora of algorithms have been developed to tackle NMF, but due to the non-convex nature of the problem, there is little guarantee on how well these methods work. Recently a surge of research have …
Rectified linear units, or ReLUs, have become the preferred activation function for artificial neural networks. In this paper we consider two basic learning problems assuming that the underlying data follow a generative model based on a ReLU-network -- a neural network with ReLU activations. As a primarily theoretical …
Analytic expressions for deep neural network output under stochastic training.
problem Understanding the impact of noise and hyperparameters on deep neural network performance.
method Taylor expansion of network output to derive analytical expressions for weights and output.
result Noise in training affects generalization by preventing the output from fully converging on train data, but does not provide explicit regularization.