• Aucun résultat trouvé

PAC-Bayesian approach for kernel methods

N/A
N/A
Protected

Academic year: 2021

Partager "PAC-Bayesian approach for kernel methods"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: inria-00510287

https://hal.inria.fr/inria-00510287

Submitted on 17 Aug 2010

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

PAC-Bayesian approach for kernel methods

Joseph Salmon, Erwan Le Pennec

To cite this version:

Joseph Salmon, Erwan Le Pennec. PAC-Bayesian approach for kernel methods. Journées MAS et Journée en l’honneur de Jacques Neveu, Aug 2010, Talence, France. �inria-00510287�

(2)

Journées MAS 2010, Bordeaux

Session : Lois à priori parcimonieuses et estimation en grande

dimension

PAC-Bayesian approach for kernel methods

par Joseph Salmon et Erwan Le Pennec

In this work on regression with Gaussian error, we study an agregation proce-dure relying on the exponential weigthing scheme described in Dalalyan and Tsybakov [1]. We obtain PAC-Bayes oracle inequalities in this context valid in both the xed design case and the random design case. These inequalities are obtained by techniques derived from those described in Catoni [2] and Audibert [3]. We apply those results to the selection of an "optimal" window for Nadaraya-Watson type estimators and obtain a provably ecient estima-tor implemented with a MCMC-type algorithm similar to the one proposed by Dalalyan and Tsybakov [3].

Références :

[1] A. Dalalyan and A. Tsybakov, Sparse regression learning by aggregation and Langevin Monte-Carlo, in 22th Annual Conference on Learning Theory, COLT, 2009.

[2] O. Catoni, Statistical learning theory and stochastic optimization, ser. Lec-ture Notes in Mathematics. LecLec-ture notes from the 31st Summer School on Probability Theory held in Saint-Flour, 2001.

[3] J.-Y. Audibert, Aggregated estimators and empirical complexity for least square regression, Ann. Inst. H. Poincaré Probab. Statist., vol. 40, no. 6, pp. 685-736, 2004.

Adresses : Joseph Salmon

Laboratoire de Probabilités et Modèles Aléatoires, Univ. Paris 7 175, rue du Chevaleret

75013 Paris

E-mail : [email protected]

<http://people.math.jussieu.fr/~salmon/> Erwan Le Pennec

Laboratoire de Probabilités et Modèles Aléatoires, Univ. Paris 7 Projet SELECT / INRIA Saclay / Université Paris Sud

LPMA

175, rue du Chevaleret 75013 Paris

E-mail : [email protected]

<http://people.math.jussieu.fr/~salmon/>

Références

Documents relatifs

This problem has in particular been studied in the theory of empirical process (providing asymptotic results), and through statistical learning theory ([KOL 61],[VAP 71]). The

Lambert, “A universal image coding approach using sparse steered Mixture-of-Experts regression”, in 2016 IEEE International Conference on Image Processing (ICIP), IEEE, 2016,

We use the Reproducing Kernel Hilbert Space (RKHS) framework to extend the results of statistical learning theory in the context of regression of functional data and to develop

For this, we propose a Monte Carlo Markov Chain (MCMC) method that simultaneously estimates all parameters and their uncertainties, the spectral index included, as an alternative to