Skip to main content

Learning with Discrete Least Squares on Multivariate Polynomial Spaces Using Evaluations at Random or Low-Discrepancy Point Sets

  • Conference paper
  • First Online:
Machine Learning, Optimization, and Big Data (MOD 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9432))

Included in the following conference series:

Abstract

We review the results achieved in previous works [1, 2, 6, 8, 1012] concerning the analysis of stability and accuracy of discrete least-squares approximation on multivariate polynomial spaces with noiseless evaluations at random points, and the results from [9] concerning the case of noiseless evaluations at low-discrepancy point sets. Afterwards, we present some numerical examples that confirm our theoretical findings and give some insights on their potential applications. The purpose of the numerical section is twofold: on the one hand we compare the performance of discrete least squares using random points versus low-discrepancy points; on the other hand we point out further directions of research, by showing what happens when we choose fewer evaluation points than those prescribed by our theoretical analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chkifa, A., Cohen, A., Migliorati, G., Nobile, F., Tempone, R.: Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs. ESAIM Math. Model. Numer. Anal. 49, 815–837 (2015)

    Article  MathSciNet  Google Scholar 

  2. Cohen, A., Davenport, M.A., Leviatan, D.: On the stability and accuracy of least square approximations. Found. Comp. Math. 13, 819–834 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cucker, F., Smale, S.: On the mathematical foundations of learning. Bull. Am. Math. Soc. 39(1), 1–49 (2001)

    Article  MathSciNet  Google Scholar 

  4. Dick, J., Pillichshammer, F.: Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press, Cambridge (2010)

    Book  Google Scholar 

  5. Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Pure and Applied Mathematics. Wiley-Interscience [Wiley], New York-London-Sydney (1974)

    MATH  Google Scholar 

  6. Migliorati, G.: Polynomial approximation by means of the random discrete \(L^2\) projection and application to inverse problems for PDEs with stochastic data. Ph.D. thesis, Dipartimento di Matematica “Francesco Brioschi”, Politecnico di Milano and Centre de Mathématiques Appliquées, École Polytechnique (2013)

    Google Scholar 

  7. Migliorati, G.: Adaptive polynomial approximation by means of random discrete least squares. In: Abdulle, A., Deparis, S., Kressner, D., Nobile, F., Picasso, M. (eds.) Proceedings of ENUMATH 2013. Lecture Notes in Computational Science and Engineering, vol. 103. Springer, Switzerland (2015)

    Google Scholar 

  8. Migliorati, G.: Multivariate markov-type and nikolskii-type inequalities for polynomials associated with downward closed multi-index sets. J. Approx. Theory 189, 137–159 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  9. Migliorati, G., Nobile, F.: Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets. J. Complexity 31(4), 517–542 (2015)

    Article  MathSciNet  Google Scholar 

  10. Migliorati, G., Nobile, F., Tempone, R.: Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points. J. Multivar. Anal. 142, 167–182 (2015)

    Article  MathSciNet  Google Scholar 

  11. Migliorati, G., Nobile, F., von Schwerin, E., Tempone, R.: Approximation of quantities of interest in stochastic PDEs by the random discrete \(L^2\) projection on polynomial spaces. SIAM J. Sci. Comput. 35, A1440–A1460 (2013)

    Article  MATH  Google Scholar 

  12. Migliorati, G., Nobile, F., von Schwerin, E., Tempone, R.: Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations. Found. Comp. Math. 14, 419–456 (2014)

    MATH  Google Scholar 

  13. Poggio, T., Smale, S.: The mathematics of learning: dealing with data. Not. Am. Math. Soc. 50, 537–544 (2003)

    MATH  MathSciNet  Google Scholar 

  14. Temlyakov, V.N.: Approximation in learning theory. Constr. Approx. 27, 33–74 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  15. Zhou, T., Narayan, A., Xu, Z.: Multivariate discrete least-squares approximations with a new type of collocation grid. SIAM J. Sci. Comput. 36(5), A2401–A2422 (2014)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giovanni Migliorati .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Migliorati, G. (2015). Learning with Discrete Least Squares on Multivariate Polynomial Spaces Using Evaluations at Random or Low-Discrepancy Point Sets. In: Pardalos, P., Pavone, M., Farinella, G., Cutello, V. (eds) Machine Learning, Optimization, and Big Data. MOD 2015. Lecture Notes in Computer Science(), vol 9432. Springer, Cham. https://doi.org/10.1007/978-3-319-27926-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27926-8_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27925-1

  • Online ISBN: 978-3-319-27926-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics