SearcharxivSearch

arXiv subjects

Jean-Marc Mercier

Publications and source records attributed to Jean-Marc Mercier.

9 recordsLinked to original sources

Differentiable Kernel Ridge Regression for Deep Learning Pipelines

Deep neural networks dominate modern machine learning, while alternative function approximators remain comparatively underexplored at scale. In this work, we revisit kernel methods as drop-in components for standard deep learning pipelines. We introduce \emph{Sparse Kernels} (SKs), a differentiable, localized, and lazy variant of kernel ridge regression (KRR) that defers training to inference time and reduces to the solution of small local systems. We integrate SKs into PyTorch as modular layers that preserve end-to-end trainability, and we show that they expose three distinct sets of parameters -- feature representations, target values, and evaluation points -- each of which can be fixed or learned. This decomposition broadens the design space available to practitioners, enabling, in particular, training-free transfer, nonlinear probing, and hybrid kernel-neural models. Across convolutional networks, vision transformers, and reinforcement learning, SK-based modules serve two complementary roles: in some settings, they match the performance of trained neural readouts with substantially less training; in others, they augment existing models and improve their performance when used as additional components. Our results suggest that kernel methods, once made scalable and differentiable, can be readily integrated with deep learning rather than treated as a separate paradigm.

cs.LG

A class of kernel-based scalable algorithms for data science

We present several generative and predictive algorithms based on the RKHS (reproducing kernel Hilbert spaces) methodology, which, most importantly, are scale up efficiently with large datasets or high-dimensional data. It is well recognized that the RKHS methodology leads one to efficient and robust algorithms for numerous tasks in data science, statistics, and scientific computation. However, the implementations existing the literature are often difficult to scale up for encompassing large datasets. In this paper, we introduce a simple and robust, divide-and-conquer methodology. It applies to large scale datasets and relies on several kernel-based algorithms, which distinguish between various extrapolation, interpolation, and optimal transport steps. We argue how to select the suitable algorithm in specific applications thanks to a feedback of performance criteria. Our primary focus is on applications and problems arising in industrial contexts, such as generating meshes for efficient numerical simulations, designing generators for conditional distributions, constructing transition probability matrices for statistical or stochastic applications, and addressing various tasks relevant to the Artificial Intelligence community. The proposed algorithms are highly relevant to supervised and unsupervised learning, generative methods, as well as reinforcement learning.

math.NA

Extrapolation and generative algorithms for three applications in finance

For three applications of central interest in finance, we demonstrate the relevance of numerical algorithms based on reproducing kernel Hilbert space (RKHS) techniques. Three use cases are investigated. First, we show that extrapolating from few pricer examples leads to sufficiently accurate and computationally efficient results so that our algorithm can serve as a pricing framework. The second use case concerns reverse stress testing, which is formulated as an inversion function problem and is treated here via an optimal transport technique in combination with the notions of kernel-based encoders, decoders, and generators. Third, we show that standard techniques for time series analysis can be enhanced by using the proposed generative algorithms. Namely, we use our algorithm in order to extend the validity of any given quantitative model. Our approach allows for conditional analysis as well as for escaping the `Gaussian world'. This latter property is illustrated here with a portfolio investment strategy.

math.NA

Reproducing kernel methods for machine learning, PDEs, and statistics

This monograph develops a unified, application-driven framework for kernel methods grounded in reproducing kernel Hilbert spaces (RKHS) and optimal transport (OT). Part I lays the theoretical and numerical foundations on positive-definite kernels; discrete and continuous RKHS; kernel engineering and scaling maps; error assessment via kernel discrepancy/maximum mean discrepancy (MMD); and a systematic operator view of kernels. In this viewpoint, projection, gradient, divergence, and Laplace-Beltrami operators are built directly from kernels, enabling discrete analogues of differential operators and variational tools that connect learning with PDE-style modeling. Part II turns to practice across four domains. In machine learning, we treat supervised and unsupervised tasks, then develop RKHS-based generative modeling, contrasting density and projection approaches and enhancing them with OT and scalable, combinatorial assignments. We introduce clustering strategies that reduce computational burden and support large-scale regression and transport. In physics-informed modeling, we present mesh-free kernel discretizations for elliptic and time-dependent PDEs, discuss automatic differentiation, and propose high-order discrete approximations. In reinforcement learning, we formulate kernel Q-learning and non-parametric HJB methods, and show how kernel operators yield sample-efficient baselines on continuous-state, discrete-action tasks. In mathematical finance, we build nonparametric time-series models and market generators, study benchmarking and extrapolation for pricing, and apply the framework to stress testing and portfolio methods.

math.NA

A class of mesh-free algorithms for some problems arising in finance and machine learning

We introduce a numerical methodology, referred to as the transport-based mesh-free method, which allows us to deal with continuous, discrete, or statistical models in the same unified framework, and leads us to a broad class of numerical algorithms recently implemented in a Python library (namely, CodPy). Specifically, we propose a mesh-free discretization technique based on the theory of reproducing kernels and the theory of transport mappings, in a way that is reminiscent of Lagrangian methods in computational fluid dynamics. We introduce kernel-based discretizations of a variety of differential and discrete operators (gradient, divergence, Laplacian, Leray projection, extrapolation, interpolation, polar factorization). The proposed algorithms are nonlinear in nature and enjoy quantitative error estimates based on the notion of discrepancy error, which allows one to evaluate the relevance and accuracy of, both, the given data and the numerical solutions. Our strategy is relevant when a large number of degrees of freedom are present as is the case in mathematical finance and machine learning. We consider the Fokker-Planck-Kolmogorov system (relevant for problems arising in finance and material dynamics) and a class of neural networks based on support vector machines.

math.NA

Mesh-free error integration in arbitrary dimensions: a numerical study of discrepancy functions

We are interested in mesh-free formulas based on the Monte-Carlo methodology for the approximation of multi-dimensional integrals, and we investigate their accuracy when the functions belong to a reproducing-kernel space. A kernel typically captures regularity and qualitative properties of functions "beyond" the standard Sobolev regularity class. We are interested in the issue whether quantitative error bounds can be a priori guaranteed in applications (e.g. mathematical finance but also scientific computing and machine learning). Our main contribution is a numerical study of the error discrepancy function based on a comparison between several numerical strategies, when one varies the choice of the kernel, the number of approximation points, and the dimension of the problem. We consider two strategies in order to localize to a bounded set the standard kernels defined in the whole Euclidian space (exponential, multiquadric, Gaussian, truncated), namely, on one hand the class of periodic kernels defined via a discrete Fourier transform on a lattice and, on the other hand, a class of transport-based kernels. First of all, relying on a Poisson formula on a lattice, together with heuristic arguments, we discuss the derivation of theoretical bounds for the discrepancy function of periodic kernels. Second, for each kernel of interest, we perform the numerical experiments that are required in order to generate the optimal distributions of points and the discrepancy error functions. Our numerical results allow us to validate our theoretical observations and provide us with quantitative estimates for the error made with a kernel-based strategy as opposed to a purely random strategy.

math.AP

The Transport-based Mesh-free Method (TMM) and its applications in finance: a review

We review a numerical technique, referred to as the Transport-based Mesh-free Method (TMM), and we discuss its applications to mathematical finance. We recently introduced this method from a numerical standpoint and investigated the accuracy of integration formulas based on the Monte-Carlo methodology: quantitative error bounds were discussed and, in this short note, we outline the main ideas of our approach. The techniques of transportation and reproducing kernels lead us to a very efficient methodology for numerical simulations in many practical applications, and provide some light on the methods used by the artificial intelligence community. For applications in the finance industry, our method allows us to compute many types of risk measures with an accurate and fast algorithm. We propose theoretical arguments as well as extensive numerical tests in order to justify sharp convergence rates, leading to rather optimal computational times. Cases of direct interest in finance support our claims and the importance of the problem of the curse of dimensionality in finance applications is briefly discussed.

math.AP

An algorithm (CoDeFi) for overcoming the curse of dimensionality in mathematical finance

We present an algorithm (CoDeFi) which overcomes the curse of dimensionality (CoD) in scientific computations and, especially, in mathematical finance (Fi). Our method applies a broad class of partial differential equations such as Kolmogorov-type equations and, for instance, the Black and Scholes equation. As a main feature, our algorithm allows one to solve partial differential equations in large dimensions and provides a general framework for stochastic problems. In insurance or finance applications, the number of dimensions corresponds to the number of risk sources and it is crucial to have a numerical method that remains robust and reliable in large dimensions.

math.NA

Revisiting the method of characteristics via a convex hull algorithm

We revisit the method of characteristics for shock wave solutions to nonlinear hyperbolic problems and we describe a novel numerical algorithm - the convex hull algorithm (CHA) - in order to compute, both, entropy dissipative solutions (satisfying all relevant entropy inequalities) and entropy conservative (or multivalued) solutions to nonlinear hyperbolic conservation laws. Our method also applies to Hamilton-Jacobi equations and other problems endowed with a method of characteristics. From the multivalued solutions determined by the method of characteristic, our algorithm "extracts" the entropy dissipative solutions, even after the formation of shocks. It applies to, both, convex or non-convex flux/Hamiltonians. We demonstrate the relevance of the proposed approach with a variety of numerical tests including a problem from fluid dynamics.

math.AP