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

Nicolò Ruggeri

dblp:246/4611 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
generalization bounds
0.612022
Fast rates for noisy interpolation require rethinking the effect of inductive bias · ICML 2022
Machine learning › Learning theory
inductive bias
0.612022
Fast rates for noisy interpolation require rethinking the effect of inductive bias · ICML 2022
Machine learning › Learning theory › over-parameterization
interpolation
0.612022
Fast rates for noisy interpolation require rethinking the effect of inductive bias · ICML 2022
Machine learning › Learning theory
high-dimensional regression
0.212022
Fast rates for noisy interpolation require rethinking the effect of inductive bias · ICML 2022

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

minimax analysis · 0.6l_p-norm interpolation · 0.6
YearPublicationVenuePosition
2022 Fast rates for noisy interpolation require rethinking the effect of inductive bias
abstract
Good generalization performance on high-dimensional data crucially hinges on a simple structure of the ground truth and a corresponding strong inductive bias of the estimator. Even though this intuition is valid for regularized models, in this paper we caution against a strong inductive bias for interpolation in the presence of noise: While a stronger inductive bias encourages a simpler structure that is more aligned with the ground truth, it also increases the detrimental effect of noise. Specifically, for both linear regression and classification with a sparse ground truth, we prove that minimum $\ell_p$-norm and maximum $\ell_p$-margin interpolators achieve fast polynomial rates close to order $1/n$ for $p > 1$ compared to a logarithmic rate for $p = 1$. Finally, we provide preliminary experimental evidence that this trade-off may also play a crucial role in understanding non-linear interpolating models used in practice.
Konstantin Donhauser, Nicolò Ruggeri, Stefan Stojanovic, Fanny Yang
ICML2