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.
New findings on Malgrange-Galois groupoid for Painlevé VI equation parameters.
Machine learning uses invariant theory to restrict function classes.
We give some characterizations for the critical values at infinity of a rational function in two complex variables in terms of the Euler characteristic, the Malgrange condition and the M-tameness
New Spencer complexes for Lie groupoids developed.
For each holomorphic vector bundle we construct a holomorphic bundle 2-gerbe that geometrically represents its second Beilinson-Chern class. Applied to the cotangent bundle, this may be regarded as a higher analogue of the canonical line bundle in complex geometry. Moreover, we exhibit the precise relationship between …
Paper finds local normal forms for wavefronts in flat coordinates.
Building upon ideas of Hironaka, Bierstone-Milman, Malgrange and others we generalize the inverse and implicit function theorem (in differential, analytic and algebraic setting) to sets of functions of larger multiplicities (or ideals). This allows one to describe singularities given by a finite set of generators or by…
A regular F-manifold is an F-manifold (with Euler field) (M, \circ, e, E), such that the endomorphism {\mathcal U}(X) := E \circ X of TM is regular at any p\in M. We prove that the germ ((M,p), \circ, e, E) is uniquely determined (up to isomorphism) by the conjugacy class of {\mathcal U}_{p} : T_{p}M \rightarrow T_{p}M…
The paper proves convergence of WDVV potentials and semisimplicity of Frobenius manifolds.
As part of his celebrated Complex Frobenius Theorem, Nirenberg showed that given a smooth elliptic structure (on a smooth manifold), the manifold is locally diffeomorphic to an open subset of (for some and ) in such a way that the structure is locally the span of $\frac{\partial…
Paper classifies solutions to oriented associativity equations on flat F-manifolds.
In this follow-up of our earlier two works D(11.1) (arXiv:1406.0929 [math.DG]) and D(11.2) (arXiv:1412.0771 [hep-th]) in the D-project, we study further the notion of a `differentiable map from an Azumaya/matrix manifold to a real manifold'. A conjecture is made that the notion of differentiable maps from Azumaya/matri…
Improved iterative methods for risk parity portfolio weights.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…
A new method combines Laplace and Variational Bayes for scalable inference.
Unified framework for model explanation methods based on feature removal.
This work reviews and evaluates methods for predicting prediction intervals in regression problems.
Derives kernel PCA with Nyström method for scalability.
In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …
New method combines spectral and sparse methods for Gaussian processes.
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
New methods using natural gradient for structured optimization.
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
We investigate methods for pricing American options under the variance gamma model. The variance gamma process is a pure jump process which is constructed by replacing the calendar time by the gamma time in a Brownian motion with drift, which makes it a time-changed Brownian motion. In general, the finite difference me…
A new method speeds up deep neural network training.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
NCG methods improve shape optimization efficiency.
We propose two localized Radial Basis Function (RBF) methods, the Radial Basis Function Partition of Unity method (RBF-PUM) and the Radial Basis Function generated Finite Differences method (RBF-FD), for solving financial derivative pricing problems arising from market models with multiple stochastic factors. We demons…
Proposes UTC method for stock price prediction with uncertainty quantification.
Survey of spectral, probabilistic, and deep metric learning methods.
Various approaches to gene selection for cancer classification based on microarray data can be found in the literature and they may be grouped into two categories: univariate methods and multivariate methods. Univariate methods look at each gene in the data in isolation from others. They measure the contribution of a p…
A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.
New method improves accuracy in computing implied volatility.
The paper examines Wiener process for LID estimation methods.
We evaluate how modern outlier detection methods perform in identifying outliers in e-commerce conversion rate data. Based on the limitations identified, we then present a novel method to detect outliers in e-commerce conversion rate. This unsupervised method is made more business relevant by letting it automatically a…
Spectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods…
We propose an optimization method for minimizing the finite sums of smooth convex functions. Our method incorporates an accelerated gradient descent (AGD) and a stochastic variance reduction gradient (SVRG) in a mini-batch setting. Unlike SVRG, our method can be directly applied to non-strongly and strongly convex prob…
We discuss the relevance of the recent Machine Learning (ML) literature for economics and econometrics. First we discuss the differences in goals, methods and settings between the ML literature and the traditional econometrics and statistics literatures. Then we discuss some specific methods from the machine learning l…
R package for counterfactual explanation methods.
We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods inherit the desirable convergence behavior of Newton-type methods for minimizing s…
The field of medical image reconstruction has seen roughly four types of methods. The first type tended to be analytical methods, such as filtered back-projection (FBP) for X-ray computed tomography (CT) and the inverse Fourier transform for magnetic resonance imaging (MRI), based on simple mathematical models for the …
Derives new optimization methods using variational integrators.
A new method for faster optimization in high dimensions.
We discuss various analytic and numerical methods that have been used to get option prices within a framework of the VG model. We show that some popular methods, for instance, Carr-Madan's FFT method could blow up for certain values of the model parameters even for an European vanilla option. Alternative methods - one …
The article derives a formula for predicting claims uncertainty using the GCC method.
Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…
We present the Variational Adaptive Newton (VAN) method which is a black-box optimization method especially suitable for explorative-learning tasks such as active learning and reinforcement learning. Similar to Bayesian methods, VAN estimates a distribution that can be used for exploration, but requires computations th…
This article is concerned with Gaussian process quadratures, which are numerical integration methods based on Gaussian process regression methods, and sigma-point methods, which are used in advanced non-linear Kalman filtering and smoothing algorithms. We show that many sigma-point methods can be interpreted as Gaussia…