Optimal quadrature-sparsification for integral operator approximation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Scientific Computing Année : 2018

Optimal quadrature-sparsification for integral operator approximation

Résumé

The design of sparse quadratures for the approximation of integral operators related to symmetric positive-semidefinite kernels is addressed. Particular emphasis is placed on the approximation of the main eigenpairs of an initial operator and on the assessment of the approximation accuracy. A special attention is drawn to the design of sparse quadratures with support included in fixed finite sets of points (that is, quadrature-sparsification), this framework encompassing the approximation of kernel matrices. For a given kernel, the accuracy of a quadrature approximation is assessed through the squared Hilbert-Schmidt norm (for operators acting on the underlying reproducing kernel Hilbert space) of the difference between the integral operators related to the initial and approximate measures; by analogy with the notion of kernel discrepancy, the underlying criterion is referred to as the squared-kernel discrepancy between the two measures. In the quadrature-sparsification framework, sparsity of the approximate quadrature is promoted through the introduction of an l1-type penalisation, and the computation of a penalised squared-kernel-discrepancy-optimal approximation then consists in a convex quadratic minimisation problem; such quadratic programs can in particular be interpreted as the Lagrange dual formulations of distorted one-class support-vector machines related to the squared kernel. Error bounds on the induced spectral approximations are derived, and the connection between penalisation, sparsity and accuracy of the spectral approximation is investigated. Numerical strategies for solving large-scale penalised squared-kernel-discrepancy minimisation problems are discussed, and the efficiency of the approach is illustrated by a series of examples. In particular, the ability of the proposed methodology to lead to accurate approximations of the main eigenpairs of kernel matrices related to large-scale datasets is demonstrated.
Fichier principal
Vignette du fichier
OptQuadSpar19.pdf (5.8 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01416786 , version 1 (14-12-2016)
hal-01416786 , version 2 (30-03-2017)
hal-01416786 , version 3 (02-03-2018)
hal-01416786 , version 4 (14-07-2018)
hal-01416786 , version 5 (20-12-2019)

Identifiants

Citer

Bertrand Gauthier, Johan a K Suykens. Optimal quadrature-sparsification for integral operator approximation. SIAM Journal on Scientific Computing, 2018, 40 (5), pp.A3636-A3674. ⟨10.1137/17M1123614⟩. ⟨hal-01416786v5⟩

Collections

CNRS
289 Consultations
279 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More