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 …
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…
This paper aims at refined error analysis for binary classification using support vector machine (SVM) with Gaussian kernel and convex loss. Our first result shows that for some loss functions such as the truncated quadratic loss and quadratic loss, SVM with Gaussian kernel can reach the almost optimal learning rate, p…
We introduce a new discriminant analysis method (Empirical Discriminant Analysis or EDA) for binary classification in machine learning. Given a dataset of feature vectors, this method defines an empirical feature map transforming the training and test data into new data with components having Gaussian empirical distrib…
The recent financial crisis has led to so-called multi-curve models for the term structure. Here we study a multi-curve extension of short rate models where, in addition to the short rate itself, we introduce short rate spreads. In particular, we consider a Gaussian factor model where the short rate and the spreads are…
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…
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…
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…
Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we propose a new spectral method, GRAph Matching by Pairwise eigen-Alignments (GRAMPA)…
Researchers disrupt Gaussian model inference to test adversarial attacks.
problem Disrupting conditional inference in multivariate Gaussian models under adversarial conditions.
method Considered white- and grey-box settings with complete and incomplete knowledge of the Gaussian distribution, respectively. Reduced to quadratic and stochastic quadratic programs. Derived structural properties for solution methods.
result Demonstrated the impact and efficacy of attacks in various applications, including real estate evaluation, interest rate estimation, and signals processing.
We provide explicit solutions of certain forward-backward stochastic differential equations (FBSDEs) with quadratic growth. These particular FBSDEs are associated with quadratic term structure models of interest rates and characterize the zero-coupon bond price. The results of this paper are naturally related to simila…
We study the supervised learning problem under either of the following two models: (1) Feature vectors xi are d-dimensional Gaussians and responses are yi=f∗(xi) for f∗ an unknown quadratic function; (2) Feature vectors xi are distributed as a mixture of two $…
Partition functions arise in a variety of settings, including conditional random fields, logistic regression, and latent gaussian models. In this paper, we consider semistochastic quadratic bound (SQB) methods for maximum likelihood inference based on partition function optimization. Batch methods based on the quadrati…
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…
Study capacity constraints in continual learning with a simple model.
problem Understanding optimal resource allocation for agents with limited memory and compute resources.
method Analyzes a capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem and demonstrates optimal capacity allocation strategies.
result Derives a solution to the capacity-constrained LQG sequential prediction problem and shows how to optimally allocate capacity across sub-problems in the steady state.
We study the performance of the certainty equivalent controller on Linear Quadratic (LQ) control problems with unknown transition dynamics. We show that for both the fully and partially observed settings, the sub-optimality gap between the cost incurred by playing the certainty equivalent controller on the true system …
The non-gaussianity of processes observed in financial markets and relatively good performance of gaussian models can be reconciled by replacing the Brownian motion with Levy processes whose Levy densities decay as exp(-lambda|x|) or faster, where lambda>0 is large. This leads to asymptotic pricing models. The leading …
Gaussian processes are powerful, yet analytically tractable models for supervised learning. A Gaussian process is characterized by a mean function and a covariance function (kernel), which are determined by a model selection criterion. The functions to be compared do not just differ in their parametrization but in thei…
We develop a class of rules spanning the range between quadratic discriminant analysis and naive Bayes, through a path of sparse graphical models. A group lasso penalty is used to introduce shrinkage and encourage a similar pattern of sparsity across precision matrices. It gives sparse estimates of interactions and pro…