Skip to main content
King Abdullah University of Science and Technology
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization
TREES
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization

Main navigation

  • Home
  • People
    • All Profiles
    • Principal Investigators
    • Postdoctoral Fellows
    • Students
    • Alumni
    • Former Members
  • Events
    • All Events
    • Events Calendar
  • News
  • Teaching
  • Collaborators
  • Books
  • Contact Us

Sparse approximation

Sparse approximation of multilinear problems with applications to kernel-based methods in UQ

1 min read · Thu, Sep 1 2016

News

Sparse approximation

​We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map.

Extensions of Dynamic Programming, Machine Learning, Discrete Optimization (TREES)

Footer

  • A-Z Directory
    • All Content
    • Browse Related Sites
  • Site Management
    • Log in

© 2025 King Abdullah University of Science and Technology. All rights reserved. Privacy Notice