🔶✳️🔶
🌐 #معرفی سخنرانان کارگاه بینالمللی تخصصی توابع پایه شعاعی
❇️ سخنران : Gabriele Santin
✴️ موضوع سخنرانی :
Greedy methods in kernel based approximation :
Interpolation , quadrature and sparsity
💠 #چکیده :
Kernel methods provide powerful and flexible techniques to approximate functions defined on general domains, with possible high-dimensional input and output spaces, and using samples at scattered locations. In this context, the problem of choosing the location of the sampling points is of great interest, both from a practical and a theoretical viewpoint. On one hand, it is of theoretical interest to know the limit and benefits of the choice of optimal point location, and to design feasible algorithms to select them. On the other hand, several applications are described by large datasets, and it may be interesting to select a possibly small portion of the data that allows an accurate reconstruction of the full problem. In this talk we will discuss some greedy methods and show that they are effective techniques in both scenarios. In particular, we will first introduce some results on the general structure and theory of kernel-based greedy methods, and describe their efficient implementation. We will then show that, in certain circumstances, they may be proven to be worst-case optimal. Moreover, we will discuss their effective use on some real world applications. We will focus mainly on interpolation, and mention some application to quadrature.
📝 ثبت نام (رایگان) از طریق لینک زیر:
https://wecademy.ir/radial-basis/📢کانال تلگرام :
@WeCademy⭕️ برای کسب اطلاعات بیشتر، به سایت یا کانال تلگرامی درج شده، مراجعه نمایید.
