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.
Pathwise uniqueness shown for specific stochastic equations.
problem Stochastic Volterra equations with singular kernels and Hölder coefficients.
method Established pathwise uniqueness through Hölder continuity of coefficients.
result Pathwise uniqueness and existence of unique strong solutions.
A new method slices and sums radial kernels faster.
problem Fast computation of large kernel sums in kernel methods.
method Random projections to 1D subspaces and QMC for selecting projections.
result QMC-slicing outperforms existing methods on test datasets.
MCNO learns PDE solution operators using Monte Carlo sampling.
problem Learning solution operators for PDEs efficiently and flexibly.
method Directly learns kernel function using Monte Carlo sampling of input-output pairs.
result Competitive accuracy with efficient computational cost on 1D PDE benchmarks.
Sliced Optimal Transport simplifies OT for fast computation.
problem Efficient computation of distances and barycenters for probability measures.
method Combines OT, integral geometry, and statistics for fast computation.
result Retains rich geometric structure while speeding up computations.
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.
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.
A new method for adapting to label shifts using class probability matching.
problem Adapting to label shifts where class probabilities differ between source and target domains.
method Class Probability Matching using Kernel Methods (CPMKM) framework.
result CPMKM outperforms existing methods on real datasets.
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…
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.
Improved guarantees for misspecified kernelized bandit optimization.
problem Misspecification in kernelized bandit optimization.
method Localization and domain splitting techniques.
result Logarithmic or polylogarithmic growth of misspecification amplification.
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…
Random projections improve GP regression performance, reducing high-dimensional inputs to 1D.
problem Gaussian processes struggle with high-dimensional inputs, leading to overfitting and high computational cost.
method Use additive sums of kernels operating on random projections of inputs.
result Predictive performance converges to full-dimensional kernel performance with increasing projections, even in 1D.
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.
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…
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.
A simple block configures optimal kernel sizes for time series classification.
problem Choosing the right kernel size for time series classification.
method Proposes Omni-Scale block (OS-block) with kernel sizes determined by prime numbers.
result Models with OS-block achieve state-of-the-art performance on time series benchmarks.
CNN model predicts financial market movement with better performance.
problem Difficult to predict financial markets due to complex dynamics.
method Proposes a novel one-dimensional CNN model for financial market prediction.
result CNN model achieves more robust and profitable performance than previous approaches.
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.
problem High computational costs in MMD flows for large scale computations.
method Introduces Riesz kernels and sliced MMD for efficient computation.
result Efficient computation of MMD gradients in one-dimensional setting.
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.
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.
We found a new simple family of Cantor sets whose projections are one-dimensional.
problem Finding simple Cantor sets with specific projection properties.
method Developed a new series of self-similar Cantor sets in R3. result All projections of these new Cantor sets are connected and one-dimensional.
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 p-exponential …
A new metric-based principal curve method learns 1D manifolds from spatial data.
problem Learning 1D manifolds from spatial data.
method Metric-based Principal Curve (MPC) approach.
result The method effectively learns the shape of 1D manifolds from synthetic and real datasets.
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…
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.
problem Pricing of floating barrier options.
method Hamiltonian approach in quantum mechanics applied to barrier options.
result Analytical expressions for pricing kernel and option price derived.
Study the spectral properties of Laplacian on warped product manifolds.
problem Spectral analysis of Laplacian on warped product manifolds.
method Analyzes spectral properties, resolvent, eigenvalues, scattering matrix, heat kernel, and regularized heat trace.
result Discrete and continuous spectrum of Laplacian on warped product manifolds.
One-dimensional crystals have convex shapes under certain conditions.
problem Determining if one-dimensional crystals have convex shapes.
method Analyzing the free energy under mass constraints and convexity assumptions.
result In one dimension, crystals have convex shapes under given conditions.
Path integral method calculates barrier option prices.
problem Barrier option pricing in finance.
method Path integral method applied to trapezoid and square potential barriers.
result Analytical expressions for option pricing derived.
Smooth algebra analysis for one-dimensional singular foliations.
problem Analyzing smooth algebras of one-dimensional singular foliations.
method Analyzing natural ideals and using Dixmier-Malliavin theorem.
result Smooth algebras of one-dimensional singular foliations are pairwise nonisomorphic.
Proves metric measure spaces with certain properties are one-dimensional.
problem Characterizing metric measure spaces as one-dimensional.
method Analyzes properties of metric measure spaces and uses optimal transport maps.
result Metric measure spaces with specified properties are one-dimensional.
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.
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.