Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Simon Fischer 0004

dblp:181/2624-4 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0003-4851-9648ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 50% Probabilistic and Bayesian machine learning · 25% Optimization for machine learning · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
learning rate
0.412020
Sobolev Norm Learning Rates for Regularized Least-Squares Algorithms · J. Mach. Learn. Res. 2020
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression › least squares regression
regularized least squares regression
0.412020
Sobolev Norm Learning Rates for Regularized Least-Squares Algorithms · J. Mach. Learn. Res. 2020
Machine learning › Learning theory › nonparametric regression
sobolev norm rates
0.412020
Sobolev Norm Learning Rates for Regularized Least-Squares Algorithms · J. Mach. Learn. Res. 2020
Machine learning › Learning theory
statistical learning theory
0.412020
Sobolev Norm Learning Rates for Regularized Least-Squares Algorithms · J. Mach. Learn. Res. 2020

Methods — techniques the papers use, named apart from their topics

integral operator techniques · 0.4finite-sample bounds · 0.4embedding property · 0.4
YearPublicationVenuePosition
2021 A closer look at covering number bounds for Gaussian kernels
Ingo Steinwart, Simon Fischer 0004
J. Complex.2
2020 Sobolev Norm Learning Rates for Regularized Least-Squares Algorithms
abstract
Learning rates for least-squares regression are typically expressed in terms of $L_2$-norms. In this paper we extend these rates to norms stronger than the $L_2$-norm without requiring the regression function to be contained in the hypothesis space. In the special case of Sobolev reproducing kernel Hilbert spaces used as hypotheses spaces, these stronger norms coincide with fractional Sobolev norms between the used Sobolev space and $L_2$. As a consequence, not only the target function but also some of its derivatives can be estimated without changing the algorithm. From a technical point of view, we combine the well-known integral operator techniques with an embedding property, which so far has only been used in combination with empirical process arguments. This combination results in new finite sample bounds with respect to the stronger norms. From these finite sample bounds our rates easily follow. Finally, we prove the asymptotic optimality of our results in many cases.
Simon Fischer 0004, Ingo Steinwart
J. Mach. Learn. Res.1