I. Babu?ka, F. Nobile, and R. Tempone, A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data, SIAM Journal on Numerical Analysis, vol.45, issue.3, pp.1005-1034, 2007.
DOI : 10.1137/050645142

F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, Optimization with sparsity-inducing penalties. Foundations and Trends, Machine Learning, pp.1-106, 2012.
DOI : 10.1561/2200000015
URL : https://hal.archives-ouvertes.fr/hal-00613125

M. Bachmayr, W. Dahmen, R. Devore, and L. Grasedyck, Approximation of high-dimensional rank one tensors. Constructive Approximation, pp.385-395, 2014.

G. Beylkin, B. Garcke, and M. J. Mohlenkamp, Multivariate Regression and Machine Learning with Sums of Separable Functions, SIAM Journal on Scientific Computing, vol.31, issue.3, pp.2345-2367, 2011.
DOI : 10.1137/070710524

G. Beylkin and M. J. Mohlenkamp, Algorithms for Numerical Analysis in High Dimensions, SIAM Journal on Scientific Computing, vol.26, issue.6, pp.2133-2159, 2005.
DOI : 10.1137/040604959

G. Beylkin, J. Garcke, J. Martin, and . Mohlenkamp, Multivariate Regression and Machine Learning with Sums of Separable Functions, SIAM Journal on Scientific Computing, vol.31, issue.3, pp.1840-1857, 2009.
DOI : 10.1137/070710524

G. Beylkin, J. Martin, and . Mohlenkamp, Algorithms for Numerical Analysis in High Dimensions, SIAM Journal on Scientific Computing, vol.26, issue.6, pp.2133-2159, 2005.
DOI : 10.1137/040604959

G. Blatman and B. Sudret, Sparse polynomial chaos expansions and adaptive stochastic finite elements using a regression approach, Comptes Rendus M??canique, vol.336, issue.6, pp.518-523, 2007.
DOI : 10.1016/j.crme.2008.02.013

G. Blatman and B. Sudret, Adaptive sparse polynomial chaos expansion based on least angle regression, Journal of Computational Physics, vol.230, issue.6, pp.2345-2367, 2011.
DOI : 10.1016/j.jcp.2010.12.021

H. Bungartz and S. Dirnstorfer, Multivariate Quadrature on Adaptive Sparse Grids, Computing, vol.71, issue.1, pp.89-114, 2003.
DOI : 10.1007/s00607-003-0016-4

H. Bungartz and M. Griebel, Sparse grids, Acta Numerica, vol.13, pp.147-269, 2004.
DOI : 10.1017/S0962492904000182

R. E. Caflisch, Monte Carlo and quasi-Monte Carlo methods, Acta Numerica, vol.73, pp.1-49, 1998.
DOI : 10.1137/S0036142994277468

J. Emmanuel, T. Candes, and . Tao, Near-optimal signal recovery from random projections: Universal encoding strategies? Information Theory, IEEE Transactions on, vol.52, issue.12, pp.5406-5425, 2006.

J. Tao, T. Candes, and E. Romberg, Near optimal signal recovery from random projections: Universal encoding strategies?, IEEE Transactions on information theory, vol.52, issue.12, pp.5406-5425, 2006.

C. Gavin, . Cawley, L. Nicola, and . Talbot, Fast exact leave-one-out crossvalidation of sparse least-squares support vector machines, Neural networks, vol.17, issue.10, pp.1467-1475, 2004.

. Scott-shaobing-chen, L. David, . Donoho, A. Michael, and . Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1998.
DOI : 10.1137/S1064827596304010

F. Chinesta, P. Ladeveze, and E. Cueto, A Short Review on Model Order Reduction Based on Proper Generalized Decomposition, Archives of Computational Methods in Engineering, vol.69, issue.9, pp.395-404, 2011.
DOI : 10.1007/s11831-011-9064-7
URL : https://hal.archives-ouvertes.fr/hal-01004940

A. Chkifa, A. Cohen, R. Devore, and C. Schwab, Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs, ESAIM: Mathematical Modelling and Numerical Analysis, vol.47, issue.1, pp.47253-280, 2013.
DOI : 10.1051/m2an/2012027
URL : http://dx.doi.org/10.3929/ethz-a-010402173

A. Chkifa, A. Cohen, G. Migliorati, F. Nobile, and R. Tempone, Discrete least squares polynomial approximation with random evaluations ; application to parametric and stochastic elliptic pdes. Also available as EPFL-MATHICSE report, pp.35-2013, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01352276

A. Chkifa, A. Cohen, and C. Schwab, High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs, Foundations of Computational Mathematics, vol.4, issue.1, pp.1-33, 2013.
DOI : 10.1007/s10208-013-9154-z
URL : https://hal.archives-ouvertes.fr/hal-01350602

A. Chkifa, A. Cohen, and C. Schwab, Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs, Journal de Math??matiques Pures et Appliqu??es, vol.103, issue.2, 2014.
DOI : 10.1016/j.matpur.2014.04.009
URL : https://hal.archives-ouvertes.fr/hal-00907782

P. Constantine, E. Dow, and Q. Wang, Active subspace methods in theory and practice: applications to kriging surfaces. arXiv preprint arXiv:1304, 2013.

L. De-lathauwer, B. De, J. Moor, and . Vandewalle, A Multilinear Singular Value Decomposition, SIAM Journal on Matrix Analysis and Applications, vol.21, issue.4, pp.1253-1278, 2000.
DOI : 10.1137/S0895479896305696

V. De-silva and L. Lim, Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.3, pp.1084-1127, 2008.
DOI : 10.1137/06066518X

V. De, S. , and L. Lim, Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.3, pp.1084-1127, 2008.

M. Deb, I. Babu?ka, and J. T. Oden, Solution of stochastic partial differential equations using Galerkin finite element techniques, Computer Methods in Applied Mechanics and Engineering, vol.190, issue.48, pp.6359-6372, 2001.
DOI : 10.1016/S0045-7825(01)00237-7

D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1289-1306, 2006.
DOI : 10.1109/TIT.2006.871582
URL : https://hal.archives-ouvertes.fr/inria-00369486

A. Doostan and G. Iaccarino, A least-squares approximation of partial differential equations with high-dimensional random inputs, Journal of Computational Physics, vol.228, issue.12, pp.4332-4345, 2009.
DOI : 10.1016/j.jcp.2009.03.006

A. Doostan and H. Owhadi, A non-adapted sparse approximation of PDEs with stochastic inputs, Journal of Computational Physics, vol.230, issue.8, pp.3015-3034, 2011.
DOI : 10.1016/j.jcp.2011.01.002

B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, Least angle regression. The Annals of statistics, pp.407-499, 2004.

L. Eldén and B. Savas, A Newton???Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor, SIAM Journal on Matrix Analysis and Applications, vol.31, issue.2, pp.248-271, 2009.
DOI : 10.1137/070688316

M. Espig and W. Hackbusch, A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format, Numerische Mathematik, vol.23, issue.2, pp.489-525, 2012.
DOI : 10.1007/s00211-012-0465-9

C. G. Webster, F. Nobile, and R. Tempone, A sparse grid stochastic collocation method for partial differential equations with random input data, SIAM Journal on Numerical Analysis, vol.46, issue.5, pp.2309-2345, 2007.

T. Gerstner and M. Griebel, Numerical integration using sparse grids, Numerical Algorithms, vol.18, issue.3/4, pp.209-232, 1998.
DOI : 10.1023/A:1019129717644

R. Ghanem and P. Spanos, Stochastic finite elements: a spectral approach, 1991.
DOI : 10.1007/978-1-4612-3094-6

L. Giraldi, Contributions aux méthodes de calcul basées sur l'approximation de tenseurs et applications en mécanique numérique, 2012.

L. Grasedyck, Hierarchical Singular Value Decomposition of Tensors, SIAM Journal on Matrix Analysis and Applications, vol.31, issue.4, pp.2029-2054, 2010.
DOI : 10.1137/090764189

L. Grasedyck, D. Kressner, and C. Tobler, A literature survey of low-rank tensor approximation techniques, GAMM-Mitteilungen, vol.93, issue.3, pp.53-78, 2013.
DOI : 10.1002/gamm.201310004

W. Hackbusch, Tensor Spaces and Numerical Tensor Calculus, of Series in Computational Mathematics, 2012.
DOI : 10.1007/978-3-642-28027-6

W. Hackbusch, Tensor Spaces and Numerical Tensor Calculus, 2012.
DOI : 10.1007/978-3-642-28027-6

W. Hackbusch and S. Kühn, A New Scheme for the Tensor Representation, Journal of Fourier Analysis and Applications, vol.5, issue.3, pp.706-722, 2009.
DOI : 10.1007/s00041-009-9094-9

A. Hinrichs, E. Novak, M. Ullrich, and H. Wo?niakowski, The curse of dimensionality for numerical integration of smooth functions II, Journal of Complexity, vol.30, issue.2, pp.117-143, 2014.
DOI : 10.1016/j.jco.2013.10.007

T. Homma and A. Saltelli, Importance measures in global sensitivity analysis of nonlinear models, Reliability Engineering & System Safety, vol.52, issue.1, pp.1-17, 1996.
DOI : 10.1016/0951-8320(96)00002-6

M. Ishteva, P. Absil, and P. Van-dooren, Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors, SIAM Journal on Matrix Analysis and Applications, vol.34, issue.2, pp.651-672, 2013.
DOI : 10.1137/11085743X

M. Ishteva, L. De-lathauwer, P. Absil, and S. Van-huffel, Differential-geometric Newton method for the best rank-(R 1, R 2, R 3) approximation of tensors, Numerical Algorithms, vol.23, issue.8, pp.179-194, 2009.
DOI : 10.1007/s11075-008-9251-2

T. G. Kolda and B. W. Bader, Tensor Decompositions and Applications, SIAM Review, vol.51, issue.3, pp.455-500, 2009.
DOI : 10.1137/07070111X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.782

D. Kressner and C. Tobler, Preconditioned Low-Rank Methods for High-Dimensional Elliptic PDE Eigenvalue Problems, Computational Methods in Applied Mathematics, vol.11, issue.3, pp.363-381, 2011.
DOI : 10.2478/cmam-2011-0020

O. P. Le-maître, O. M. Knio, H. N. Najm, and R. Ghanem, Uncertainty propagation using Wiener???Haar expansions, Journal of Computational Physics, vol.197, issue.1, pp.28-57, 2004.
DOI : 10.1016/j.jcp.2003.11.033

O. P. Le-maître, O. M. Knio, H. N. Najm, and R. G. Ghanem, Uncertainty propagation using Wiener???Haar expansions, Journal of Computational Physics, vol.197, issue.1, pp.28-57, 2004.
DOI : 10.1016/j.jcp.2003.11.033

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online learning for matrix factorization and sparse coding, The Journal of Machine Learning Research, vol.11, pp.19-60, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408716

L. Mathelin and O. L. Maître, error estimate for stochastic finite element methods, Communications in Applied Mathematics and Computational Science, vol.2, issue.1, pp.83-116, 2007.
DOI : 10.2140/camcos.2007.2.83

G. Hermann, A. Matthies, O. Litvinenko, . Pajonk, V. Bojana et al., Parametric and uncertainty computations with tensor product representations, Uncertainty Quantification in Scientific Computing, pp.139-150, 2012.

H. Niederreiter, Random Number Generation and quasi-Monte Carlo Methods, SIAM, 1992.
DOI : 10.1137/1.9781611970081

A. Nouy, Proper Generalized Decompositions and Separated Representations for the Numerical Solution of High Dimensional Stochastic Problems, Archives of Computational Methods in Engineering, vol.225, issue.1, pp.403-434, 2010.
DOI : 10.1007/s11831-010-9054-1
URL : https://hal.archives-ouvertes.fr/hal-00461099

E. Novak and K. Ritter, Simple Cubature Formulas with High Polynomial Exactness, Constructive Approximation, vol.15, issue.4, pp.499-522, 1999.
DOI : 10.1007/s003659900119

E. Novak and D. Rudolf, Tractability of the approximation of highdimensional rank one tensors. arXiv preprint, 2014.

E. Novak and H. Wo?niakowski, Tractability of Multivariate Problems: Standard information for functionals, 2010.
DOI : 10.4171/084

I. Oseledets, Constructive representation of functions in low-rank tensor formats . Constructive Approximation, pp.1-18, 2013.

I. Oseledets and E. Tyrtyshnikov, Tensor tree decomposition does not need a tree, 2009.

V. Ivan and . Oseledets, Tensor-train decomposition, SIAM Journal on Scientific Computing, vol.33, issue.5, pp.2295-2317, 2011.

V. Ivan, . Oseledets, E. Eugene, and . Tyrtyshnikov, Breaking the curse of dimensionality , or how to use svd in many dimensions, SIAM Journal on Scientific Computing, issue.5, pp.313744-3759, 2009.

N. Parés, P. Díez, and A. Huerta, Bounds of functional outputs for parabolic problems. Part I: Exact bounds of the discontinuous Galerkin time discretization, Computer Methods in Applied Mechanics and Engineering, vol.197, issue.19-20, pp.1641-1660, 2008.
DOI : 10.1016/j.cma.2007.08.025

K. Petras, Smolyak cubature of given polynomial degree with few nodes for increasing dimension, Numerische Mathematik, vol.93, issue.4, pp.729-753, 2003.
DOI : 10.1007/s002110200401

W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C -The Art of Scientific Computing, 1997.

U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics, vol.326, issue.1, pp.96-192, 2011.
DOI : 10.1016/j.aop.2010.09.012

S. A. Smolyak, Quadrature and interpolation formulas for tensor products of certain classes of functions, Sov. Math. Dokl, vol.3, pp.240-243, 1963.

M. Ilya and . Sobol, Global sensitivity indices for nonlinear mathematical models and their monte carlo estimates, Mathematics and computers in simulation, vol.55, issue.1-3, pp.271-280, 2001.

M. Ilya and . Sobol, Theorems and examples on high dimensional model representation, Reliability Engineering & System Safety, vol.79, issue.2, pp.187-193, 2003.

. Il-'ya-meerovich and . Sobol, On sensitivity estimation for nonlinear mathematical models, Matematicheskoe Modelirovanie, vol.2, issue.1, pp.112-118, 1990.

I. M. Sobol, On quasi-Monte Carlo integrations, Mathematics and Computers in Simulation, vol.47, issue.2-5, pp.103-112, 1998.
DOI : 10.1016/S0378-4754(98)00096-2

C. Soize and R. Ghanem, Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure, SIAM Journal on Scientific Computing, vol.26, issue.2, pp.395-410, 2004.
DOI : 10.1137/S1064827503424505
URL : https://hal.archives-ouvertes.fr/hal-00686211

B. Sudret, Global sensitivity analysis using polynomial chaos expansions, Reliability Engineering & System Safety, vol.93, issue.7, pp.964-979, 2008.
DOI : 10.1016/j.ress.2007.04.002
URL : https://hal.archives-ouvertes.fr/hal-01432217

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society. Series B (Methodological), pp.267-288, 1996.

R. Tipireddy and R. Ghanem, Basis adaptation in homogeneous chaos spaces, Journal of Computational Physics, vol.259, pp.304-317, 2014.
DOI : 10.1016/j.jcp.2013.12.009

C. Tobler, Low-rank tensor methods for linear systems and eigenvalue problems, 2012.

N. Vannieuwenhoven, R. Vandebril, and K. Meerbergen, A New Truncation Strategy for the Higher-Order Singular Value Decomposition, SIAM Journal on Scientific Computing, vol.34, issue.2, pp.1027-1052, 2012.
DOI : 10.1137/110836067

X. Wan and G. E. Karniadakis, An adaptive multi-element generalized polynomial chaos method for stochastic differential equations, Journal of Computational Physics, vol.209, issue.2, pp.617-642, 2005.
DOI : 10.1016/j.jcp.2005.03.023

X. Wan and G. E. Karniadakis, Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures, SIAM Journal on Scientific Computing, vol.28, issue.3, pp.901-928, 2006.
DOI : 10.1137/050627630
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1709

R. Steven and . White, Density matrix formulation for quantum renormalization groups, Physical Review Letters, vol.69, issue.19, p.2863, 1992.

A. Brian and . Worley, Deterministic uncertainty analysis, TN (USA), 1987.

D. Xiu and G. E. Karniadakis, The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations, SIAM Journal on Scientific Computing, vol.24, issue.2, pp.619-644, 2002.
DOI : 10.1137/S1064827501387826