D. Achlioptas, Database-friendly random projections: Johnson-Lindenstrauss with binary coins, Journal of Computer and System Sciences, vol.66, issue.4, pp.671-687, 2003.
DOI : 10.1016/S0022-0000(03)00025-4

URL : http://doi.org/10.1016/s0022-0000(03)00025-4

N. Ailon and B. Chazelle, Approximate nearest neighbors and the fast johnson-lindenstrauss transform, Proceedings Of The 38th Annual ACM Symposium On Theory Of Computing, STOC '06, pp.557-563, 2006.

P. Alquier, PAC-Bayesian bounds for randomized empirical risk minimizers, Mathematical Methods of Statistics, vol.17, issue.4, pp.279-304, 2008.
DOI : 10.3103/S1066530708040017

URL : https://hal.archives-ouvertes.fr/hal-00354922

P. Alquier and K. Lounici, PAC-Bayesian bounds for sparse regression estimation with exponential weights, Electronic Journal of Statistics, vol.5, issue.0, pp.127-145, 2011.
DOI : 10.1214/11-EJS601

URL : https://hal.archives-ouvertes.fr/hal-00465801

J. Aubry and S. Jaffard, Random Wavelet Series, Communications in Mathematical Physics, vol.227, issue.3, pp.483-514, 2002.
DOI : 10.1007/s002200200630

URL : https://hal.archives-ouvertes.fr/hal-00012098

J. Audibert and O. Catoni, Robust linear regression through PAC-Bayesian truncation. arXiv, 2010.

A. Barron, A. Cohen, W. Dahmen, and R. Devore, Approximation and learning by greedy algorithms, The Annals of Statistics, vol.36, issue.1, pp.64-94, 2008.
DOI : 10.1214/009053607000000631

L. Birgé and P. Massart, Minimum Contrast Estimators on Sieves: Exponential Bounds and Rates of Convergence, Bernoulli, vol.4, issue.3, pp.329-375, 1998.
DOI : 10.2307/3318720

G. Bourdaud, Ondelettes et espaces de Besov, Revista Matem??tica Iberoamericana, vol.11, issue.3, pp.477-512, 1995.
DOI : 10.4171/RMI/181

H. Bungartz and M. Griebel, Sparse grids, Acta Numerica, 2004.

S. Canu, X. Mary, and A. Rakotomamonjy, Functional learning through kernel, Advances In Learning Theory: Methods, Models And Applications NATO Science Series III: Computer And Systems Sciences, pp.89-110, 2002.

A. Caponnetto and E. D. Vito, Optimal Rates for the Regularized Least-Squares Algorithm, Foundations of Computational Mathematics, vol.7, issue.3, pp.331-368, 2007.
DOI : 10.1007/s10208-006-0196-8

O. Catoni, Statistical Learning Theory And Stochastic Optimization, 2004.
DOI : 10.1007/b99352

URL : https://hal.archives-ouvertes.fr/hal-00104952

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.1-6, 1987.
DOI : 10.1145/28395.28396

URL : http://doi.org/10.1016/s0747-7171(08)80013-2

S. Dasgupta and Y. Freund, Random projection trees and low dimensional manifolds, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.537-546, 2008.
DOI : 10.1145/1374376.1374452

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.3236

S. Deguy and A. Benassi, A flexible noise model for designing maps, Proceedings Of The Vision Modeling And Visualization Conference 2001, VMV '01, pp.299-308, 2001.

R. Devore, Nonlinear approximation, Acta Numerica, vol.41, issue.2, 1997.
DOI : 10.1007/BF02274662

R. M. Dudley, Real Analysis And Probability, 1989.
DOI : 10.1017/CBO9780511755347

A. Durand, Random Wavelet Series Based on a Tree-Indexed Markov Chain, Communications in Mathematical Physics, vol.41, issue.12, pp.451-477, 2008.
DOI : 10.1007/s00220-008-0504-7

M. Frazier and B. Jawerth, Decomposition of Besov Spaces, Indiana University Mathematics Journal, issue.34, 1985.
DOI : 10.1515/9781400827268.385

L. Györfi and M. Kohler, Adam Krzy? zak, and Harro Walk. A Distribution-free Theory Of Nonparametric Regression, 2002.

S. Janson, Gaussian Hilbert Spaces, 1997.
DOI : 10.1017/CBO9780511526169

V. Koltchinskii, Local rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics, pp.2593-2656, 2006.

E. Liberty, N. Ailon, and A. Singer, Dense fast random projections and lean Walsh transforms And 12th International Workshop, RANDOM 2008 On Approximation, Randomization And Combinatorial Optimization: Algorithms And Techniques, APPROX '08 / RANDOM '08, Proceedings Of The 11th International Workshop, pp.512-522, 2008.

A. Mikhail and . Lifshits, Gaussian Random Functions, 1995.

. Odalric-ambrym, R. Maillard, and . Munos, Compressed least-squares regression, Proceedings Of The 23rd Conference On Advances In Neural Information Processing Systems, NIPS '09, pp.1213-1221, 2009.

. Odalric-ambrym, R. Maillard, and . Munos, Scrambled objects for least-squares regression, Proceedings Of The 24th Conference On Advances In Neural Information Processing Systems, NIPS '10, pp.1549-1557, 2010.

A. Rahimi and B. Recht, Random features for large-scale kernel machines, Proceedings Of The 21st Conference On Advances In Neural Information Processing Systems, NIPS '07, 2007.

A. Rahimi and B. Recht, Uniform approximation of functions with random bases, 2008 46th Annual Allerton Conference on Communication, Control, and Computing, 2008.
DOI : 10.1109/ALLERTON.2008.4797607

S. Saitoh, Theory Of Reproducing Kernels And Its Applications, Longman Scientific & Technical, 1988.

T. Sarlos, Improved Approximation Algorithms for Large Matrices via Random Projections, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.143-152, 2006.
DOI : 10.1109/FOCS.2006.37

R. S. Sutton, Generalization in reinforcement learning: Successful examples using sparse coarse coding, Advances In Neural Information Processing Systems, pp.1038-1044, 1996.

S. Richard, S. D. Sutton, and . Whitehead, Online learning with random representations, Proceedings Of The 10th International Conference On Machine Learning, ICML '93, pp.314-321, 1993.

R. Tibshirani, Regression shrinkage and selection via the Lasso, Journal Of The Royal Statistical Society, Series B, vol.58, pp.267-288, 1994.

A. N. Tikhonov, Solution of incorrectly formulated problems and the regularization method, Soviet Math Dokl, vol.4, pp.1035-1038, 1963.

A. B. Tsybakov, Optimal Rates of Aggregation, Proceedings Of The 16th Annual Conference On Learning Theory, pp.303-313, 2003.
DOI : 10.1007/978-3-540-45167-9_23

URL : https://hal.archives-ouvertes.fr/hal-00104867

C. Zenger, Sparse grids Parallel Algorithms For Partial Differential Equations, Proceedings Of The Sixth GAMM-Seminar, Notes on Num. Fluid Mechanics, vol.31, 1990.