Sliced kernelized Stein discrepancy improves goodness-of-fit tests and model learning in high dimensions.
arXiv research
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.
Trend · papers per month
Paper develops methods for analyzing forms with synchronized singularities.
Pathwise uniqueness shown for specific stochastic equations.
A new method slices and sums radial kernels faster.
MCNO learns PDE solution operators using Monte Carlo sampling.
Sliced Optimal Transport simplifies OT for fast computation.
We generalize the transgression formula for the eta form of Bismut, Cheeger and Berline, Getzler, Vergne for vertical Dirac operators on a fibre bundle with odd dimensional fibres where the Dirac operators have locally at most one eigenvalue of multiplicity one crossing zero transversally.
We prove a conjecture about approximating Gaussian Processes on one dimension.
This work studies nonnegativity-preserving kernels for stochastic equations and their applications.
A new method for adapting to label shifts using class probability matching.
Kernel ridge regression is used to approximate the kinetic energy of non-interacting fermions in a one-dimensional box as a functional of their density. The properties of different kernels and methods of cross-validation are explored, and highly accurate energies are achieved. Accurate {\em constrained optimal densitie…
In this paper we study the concentration properties for the eigenvalues of kernel matrices, which are central objects in a wide range of kernel methods and, more recently, in network analysis. We present a set of concentration inequalities tailored for each individual eigenvalue of the kernel matrix with respect to its…
Identification of informative variables in an information system is often performed using simple one-dimensional filtering procedures that discard information about interactions between variables. Such approach may result in removing some relevant variables from consideration. Here we present an R package MDFS (MultiDi…
We consider a model for linear transient price impact for multiple assets that takes cross-asset impact into account. Our main goal is to single out properties that need to be imposed on the decay kernel so that the model admits well-behaved optimal trade execution strategies. We first show that the existence of such s…
Gaussian processes (GPs) provide flexible distributions over functions, with inductive biases controlled by a kernel. However, in many applications Gaussian processes can struggle with even moderate input dimensionality. Learning a low dimensional projection can help alleviate this curse of dimensionality, but introduc…
Max-sliced Wasserstein metric reduces high-dimensional data to 1D for better estimation.
Improved guarantees for misspecified kernelized bandit optimization.
The design of activation functions is a growing research area in the field of neural networks. In particular, instead of using fixed point-wise functions (e.g., the rectified linear unit), several authors have proposed ways of learning these functions directly from the data in a non-parametric fashion. In this paper we…
The classical derivation of the well-known Vasicek model for interest rates is reformulated in terms of the associated pricing kernel. An advantage of the pricing kernel method is that it allows one to generalize the construction to the Lévy-Vasicek case, avoiding issues of market incompleteness. In the Lévy-Vasicek mo…
Enhanced feature learning using neural networks and kernel methods with improved robustness.
Study one-dimensional topological theories with linear generating functions.
We present a theoretical and empirical study of the gradient dynamics of overparameterized shallow ReLU networks with one-dimensional input, solving least-squares interpolation. We show that the gradient dynamics of such networks are determined by the gradient flow in a non-redundant parameterization of the network fun…
Exact and scalable algorithm for Gaussian process regression with Matérn correlations.
A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.
CNN model predicts financial market movement with better performance.
This paper presents a convolutional neural network (CNN) which can be used for forecasting electricity load profiles 36 hours into the future. In contrast to well established CNN architectures, the input data is one-dimensional. A parameter scanning of network parameters is conducted in order to gain information about …
Paper improves MMD flow efficiency with Riesz kernels for image generation.
We present a novel Neural Embedding Spatio-Temporal (NEST) point process model for spatio-temporal discrete event data and develop an efficient imitation learning (a type of reinforcement learning) based approach for model fitting. Despite the rapid development of one-dimensional temporal point processes for discrete e…
Paper improves MMD estimation for analytical mean embeddings.
We found a new simple family of Cantor sets whose projections are one-dimensional.
Analyzes SVM classifier behavior with different parameters and data types.
Study of one-dimensional non-Hausdorff manifolds and their quotient to CW complexes.
Two-sample tests using MMD control type I error and achieve optimal power.
Sharp comparison theorems are derived for all eigenvalues of the (weighted) Laplacian, for various classes of weighted-manifolds (i.e. Riemannian manifolds endowed with a smooth positive density). Examples include Euclidean space endowed with strongly log-concave and log-convex densities, extensions to -exponential …
A new metric-based principal curve method learns 1D manifolds from spatial data.
Matrix Product States (MPS), also known as Tensor Train (TT) decomposition in mathematics, has been proposed originally for describing an (especially one-dimensional) quantum system, and recently has found applications in various applications such as compressing high-dimensional data, supervised kernel linear classifie…
Gaussian Process Latent Variable Model (GPLVM) is a flexible framework to handle uncertain inputs in Gaussian Processes (GPs) and incorporate GPs as components of larger graphical models. Nonetheless, the standard GPLVM variational inference approach is tractable only for a narrow family of kernel functions. The most p…
The Receptive Field (RF) size has been one of the most important factors for One Dimensional Convolutional Neural Networks (1D-CNNs) on time series classification tasks. Large efforts have been taken to choose the appropriate size because it has a huge influence on the performance and differs significantly for each dat…
We prove that for compact, non-contractible, one dimensional geodesic spaces, a version of the marked length spectrum conjecture holds. For a compact one dimensional geodesic space X, we define a subspace Conv(X). When X is non-contractible, we show that X deformation retracts to Conv(X). If two such spaces X, Y have t…
Hamiltonian method applied to floating barrier options pricing.
One-dimensional crystals have convex shapes under certain conditions.
Study the spectral properties of Laplacian on warped product manifolds.
Path integral method calculates barrier option prices.
Smooth algebra analysis for one-dimensional singular foliations.
We classify the harmonic morphisms with one-dimensional fibres (1) from real-analytic conformally-flat Riemannian manifolds of dimension at least four, and (2) between conformally-flat Riemannian manifolds of dimensions at least three.
It is generally understood that a given one-dimensional diffusion may be transformed by Cameron-Martin-Girsanov measure change into another one-dimensional diffusion with the same volatility but a different drift. But to achieve this we have to know that the change-of-measure local martingale that we write down is a tr…
QB-Vine extends Quasi-Bayesian methods to high dimensions using vine copulas.
We obtain a deterministic characterisation of the \emph{no free lunch with vanishing risk}, the \emph{no generalised arbitrage} and the \emph{no relative arbitrage} conditions in the one-dimensional diffusion setting and examine how these notions of no-arbitrage relate to each other.