Source author record

Jean-Marc Mercier

Jean-Marc Mercier appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

4works
4topics
2close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

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.

preprint2019arXiv

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.

preprint2016arXiv

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.

preprint2014arXiv

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.