82 citations · 433 across the 35 of their papers we have counts for
4 papers · 2 filters
Greedy algorithms for learning via exponential-polynomial splines
Rosanna Campagna, Stefano De Marchi, Emma Perracchione +1
Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines,…
HJB-RBF based approach for the control of PDEs
Alessandro Alla, Hugo Oliveira, Gabriele Santin
Semi-lagrangian schemes for discretization of the dynamic programming principle are based on a time discretization projected on a state-space grid. The use of a structured grid mak…
Convergence analysis for image interpolation in terms of the cSSIM
Francesco Marchetti, Gabriele Santin
Assessing the similarity of two images is a complex task that attracts significant efforts in the image processing community. The widely used Structural Similarity Index Measure (S…
Analysis of target data-dependent greedy kernel algorithms: Convergence rates for -, - and -greedy
Tizian Wenzel, Gabriele Santin, Bernard Haasdonk
Data-dependent greedy algorithms in kernel spaces are known to provide fast converging interpolants, while being extremely easy to implement and efficient to run. Despite this expe…