Research
On-device research index

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.

168,657 papers · 148 categories

Trend · papers per month

3978117156 · Jun 202019922001200920172026
48 results for one-dimensional kernels

Sliced kernelized Stein discrepancy improves goodness-of-fit tests and model learning in high dimensions.

problem The curse-of-dimensionality in kernelized Stein discrepancy (KSD).
method Sliced Stein discrepancy and its scalable variants using optimal one-dimensional projections.
result Significantly outperforms KSD and baselines in goodness-of-fit tests and improves model learning.

Paper develops methods for analyzing forms with synchronized singularities.

problem Analyzing forms with synchronized singularities.
method Exact reduction, analytic transfer, and geometric recomposition.
result Transfer of sparse domination principle to synchronized singular forms.

We prove a conjecture about approximating Gaussian Processes on one dimension.

problem Computational scaling issues with Gaussian Processes on one dimension.
method Developed a new family of state-space models (LEG) to approximate any stationary GP on one dimension.
result Proved that any stationary GP on one dimension can be approximated using the LEG family.

This work studies nonnegativity-preserving kernels for stochastic equations and their applications.

problem Nonnegativity preservation in stochastic Volterra equations and related processes.
method Characterization and application of completely monotone kernels; approximation schemes for weak error.
result Positive linear combinations of decaying exponentials can be used for second-order approximation schemes.

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…

2014-04-04abs ↗pdf ↗

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…

2018-12-05abs ↗pdf ↗

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…

2018-10-31abs ↗pdf ↗

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…

2019-12-30abs ↗pdf ↗

Max-sliced Wasserstein metric reduces high-dimensional data to 1D for better estimation.

problem Curse of dimensionality in optimal transport.
method Introduces max-sliced Wasserstein metric to reduce high-dimensional problems to 1D.
result Uniform ratio bounds of empirical measures on RKHS concentrate uniformly fast at parametric rates.

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…

2019-01-29abs ↗pdf ↗

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…

2016-08-23abs ↗pdf ↗

Enhanced feature learning using neural networks and kernel methods with improved robustness.

problem Improving feature learning and function estimation in supervised learning.
method Regularised empirical risk minimisation with a new kernel approach.
result The proposed method, BKerNN, converges to the minimal risk with explicit high-probability rates.

Study one-dimensional topological theories with linear generating functions.

problem Understanding one-dimensional topological theories with defects.
method Construct bases of hom spaces for decorated unoriented one-dimensional cobordisms.
result Gram determinant and linear generating functions constructed.

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…

2019-06-18abs ↗pdf ↗

Exact and scalable algorithm for Gaussian process regression with Matérn correlations.

problem Efficient Gaussian process regression with Matérn correlations.
method Novel kernel packet theory and sparse representation of covariance matrix.
result Significantly superior to existing alternatives in computational time and predictive accuracy.

A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.

problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.

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…

2019-06-13abs ↗pdf ↗

Paper improves MMD estimation for analytical mean embeddings.

problem Improving MMD estimation for distributions with analytical mean embeddings.
method Proposes a tighter concentration result for MMD estimation under semi-explicit settings and extends to unbounded kernels.
result Demonstrates efficiency in real-world applications like index replication and calibration.

Analyzes SVM classifier behavior with different parameters and data types.

problem Tuning SVM parameters for balanced and imbalanced data.
method Behavioral analysis of SVM with different parameters and data types, proposing a novel search algorithm.
result Proposed search algorithm reduces computational time and provides expected kernel function range.

Study of one-dimensional non-Hausdorff manifolds and their quotient to CW complexes.

problem Understanding and characterizing one-dimensional non-Hausdorff manifolds.
method Analyzing properties of connected non-Hausdorff manifolds and their quotient spaces to CW complexes.
result Existence of a quotient map from a connected non-Hausdorff manifold to an open one-dimensional CW complex.

Two-sample tests using MMD control type I error and achieve optimal power.

problem Developing reliable nonparametric two-sample tests for small sample sizes.
method Maximum Mean Discrepancy (MMD) for constructing novel nonparametric tests, proving non-asymptotic error control and optimality.
result MMDAgg test controls type I error and achieves minimax rate over Sobolev balls, outperforming other tests.

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 pp-exponential …

2015-08-03abs ↗pdf ↗

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…

2018-12-13abs ↗pdf ↗

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…

2012-09-17abs ↗pdf ↗

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…

2019-10-25abs ↗pdf ↗

QB-Vine extends Quasi-Bayesian methods to high dimensions using vine copulas.

problem Efficiently predicting high-dimensional distributions without sampling.
method Recursive Quasi-Bayesian construction for marginals and vine copulas for dependence modeling.
result QB-Vine is a fully non-parametric density estimator with analytical form and convergence rate independent of dimension.