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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Ilaria Giulini

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

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

Artificial intelligence and machine learning · 1

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
Representation and self-supervised learning · 50% Graph learning · 50%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › spectral graph theory
graph laplacian		 0.212016
Data driven estimation of Laplace-Beltrami operator · NIPS 2016
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning		 0.212016
Data driven estimation of Laplace-Beltrami operator · NIPS 2016
Information theory › estimation theory › nonparametric estimation
bandwidth selection		 0.212016
Data driven estimation of Laplace-Beltrami operator · NIPS 2016

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

lepski's method · 0.5oracle inequality · 0.2oracle inequalities · 0.2
YearPublicationVenuePosition
2016 Data driven estimation of Laplace-Beltrami operator
abstract
Approximations of Laplace-Beltrami operators on manifolds through graph Laplacians have become popular tools in data analysis and machine learning. These discretized operators usually depend on bandwidth parameters whose tuning remains a theoretical and practical problem. In this paper, we address this problem for the unormalized graph Laplacian by establishing an oracle inequality that opens the door to a well-founded data-driven procedure for the bandwidth selection. Our approach relies on recent results by Lacour and Massart (2015) on the so-called Lepski's method.
Frédéric Chazal, Ilaria Giulini, Bertrand Michel
 NIPS2