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.
The authors aim to develop numerical schemes of the two representative quadratic hedging strategies: locally risk minimizing and mean-variance hedging strategies, for models whose asset price process is given by the exponential of a normal inverse Gaussian process, using the results of Arai et al. \cite{AIS}, and Arai …
Reconstruction of a function from noisy data is often formulated as a regularized optimization problem over an infinite-dimensional reproducing kernel Hilbert space (RKHS). The solution describes the observed data and has a small RKHS norm. When the data fit is measured using a quadratic loss, this estimator has a know…
We introduce a Bernstein-type inequality which serves to uniformly control quadratic forms of gaussian variables. The latter can for example be used to derive sharp model selection criteria for linear estimation in linear regression and linear inverse problems via penalization, and we do not exclude that its scope of a…
The reparameterization trick is widely used in variational inference as it yields more accurate estimates of the gradient of the variational objective than alternative approaches such as the score function method. Although there is overwhelming empirical evidence in the literature showing its success, there is relative…
We study the variance of the REINFORCE policy gradient estimator in environments with continuous state and action spaces, linear dynamics, quadratic cost, and Gaussian noise. These simple environments allow us to derive bounds on the estimator variance in terms of the environment and noise parameters. We compare the pr…
In the paper, we consider three quadratic optimization problems which are frequently applied in portfolio theory, i.e, the Markowitz mean-variance problem as well as the problems based on the mean-variance utility function and the quadratic utility.Conditions are derived under which the solutions of these three optimiz…
This paper presents a novel one-factor stochastic volatility model where the instantaneous volatility of the asset log-return is a diffusion with a quadratic drift and a linear dispersion function. The instantaneous volatility mean reverts around a constant level, with a speed of mean reversion that is affine in the in…
FlowSDR learns a low-dimensional projection preserving the response's conditional distribution.
problem Learning a low-dimensional projection that captures the response's conditional distribution.
method FlowSDR uses conditional log-likelihood maximization with monotone rational-quadratic spline flows to learn the projection and conditional density.
result FlowSDR outperforms existing SDR methods in various simulation settings and a face-age prediction task.
The L1-regularized Gaussian maximum likelihood estimator (MLE) has been shown to have strong statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying graph structure of a Gaussian Markov Random Field, from very limited samples. We propose a novel algorithm for solving the…
We introduce a distributionally robust maximum likelihood estimation model with a Wasserstein ambiguity set to infer the inverse covariance matrix of a p-dimensional Gaussian random vector from n independent samples. The proposed model minimizes the worst case (maximum) of Stein's loss across all normal reference d…
Gaussian belief propagation (GaBP) is an iterative algorithm for computing the mean of a multivariate Gaussian distribution, or equivalently, the minimum of a multivariate positive definite quadratic function. Sufficient conditions, such as walk-summability, that guarantee the convergence and correctness of GaBP are kn…
The study uncovers the breakdown of Gaussian universality in high-dimensional empirical risk minimization.
problem Understanding the breakdown of Gaussian universality in high-dimensional empirical risk minimization.
method Extending the Convex Gaussian Min-Max Theorem to non-Gaussian settings, deriving asymptotic min-max characterizations, and proving asymptotic equivalence of regularizers.
result The projection of the ERM estimator onto a test covariate approximately follows a Gaussian convolution under certain conditions.