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.

Hugo Henneuse

dblp:429/6022 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Computational geometry · 46% Information theory · 30% Mathematical optimization · 23%

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

TopicWeightPapersLastEvidence papers
Information theory › estimation theory
minimax estimation
1.012026
Persistence Diagrams Estimation of Multivariate Piecewise Hölder-continuous Signals · J. Mach. Learn. Res. 2026
Mathematical optimization › statistical estimation › regression
nonparametric regression
1.012026
Persistence Diagrams Estimation of Multivariate Piecewise Hölder-continuous Signals · J. Mach. Learn. Res. 2026
Computational geometry › topological data analysis › persistent homology
persistence diagram
1.012026
Persistence Diagrams Estimation of Multivariate Piecewise Hölder-continuous Signals · J. Mach. Learn. Res. 2026
Computational geometry
topological data analysis
1.012026
Persistence Diagrams Estimation of Multivariate Piecewise Hölder-continuous Signals · J. Mach. Learn. Res. 2026

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

histogram estimators · 1.0bottleneck distance · 1.0algebraic stability · 1.0
YearPublicationVenuePosition
2026 Persistence Diagrams Estimation of Multivariate Piecewise Hölder-continuous Signals
abstract
To our knowledge, the analysis of convergence rates for persistence diagrams estimation from noisy signals has predominantly relied on lifting signal estimation results through sup-norm (or other functional norm) stability theorems. We believe that moving forward from this approach can lead to considerable gains. We illustrate it in the setting of nonparametric regression. From a minimax perspective, we examine the inference of persistence diagrams (for the sublevel sets filtration). We show that for piecewise Hölder-continuous functions, with control over the reach of the set of discontinuities, taking the persistence diagram coming from a simple histogram estimator of the signal permits achieving the minimax rates known for Hölder-continuous functions. The key novelty lies in our use of algebraic stability instead of sup-norm stability, directly targeting the bottleneck distance through the underlying interleaving. This allows us to incorporate deformation retractions of sublevel sets to accommodate boundary discontinuities that cannot be handled by sup-norm based stability analyses.
Hugo Henneuse
J. Mach. Learn. Res.1