惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

U
Unit 42
The Cloudflare Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Y
Y Combinator Blog
G
Google Developers Blog
Vercel News
Vercel News
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Jina AI
Jina AI
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
博客园 - 三生石上(FineUI控件)
MongoDB | Blog
MongoDB | Blog
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
H
Hackread – Cybersecurity News, Data Breaches, AI and More
aimingoo的专栏
aimingoo的专栏
T
Tailwind CSS Blog
博客园 - 叶小钗
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
月光博客
月光博客
Microsoft Security Blog
Microsoft Security Blog
P
Proofpoint News Feed
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG

JMLR

Transformers Can Overcome the Curse of Dimensionality: A Theoretical Study from an Approximation Perspective Online Bernstein-von Mises theorem Covariate-dependent Hierarchical Dirichlet Processes DCatalyst: A Unified Accelerated Framework for Decentralized Optimization Boosted Control Functions: Distribution Generalization and Invariance in Confounded Models Contrasting Local and Global Modeling with Machine Learning and Satellite Data: A Case Study Estimating Tree Canopy Height in African Savannas A Symplectic Analysis of Alternating Mirror Descent Two-way Node Popularity Model for Directed and Bipartite Networks Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood A causal fused lasso for interpretable heterogeneous treatment effects estimation Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization Reparameterized Complex-valued Neurons Can Efficiently Learn More than Real-valued Neurons via Gradient Descent Hierarchical Causal Models Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection Adaptive Forward Stepwise: A Method for High Sparsity Regression Optimization and Generalization of Gradient Descent for Shallow ReLU Networks with Minimal Width Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection CHANI: Correlation-based Hawkes Aggregation of Neurons with bio-Inspiration Exploring Novel Uncertainty Quantification through Forward Intensity Function Modeling Generative Bayesian Inference with GANs Communication-efficient Distributed Statistical Inference for Massive Data with Heterogeneous Auxiliary Information Decorrelated Local Linear Estimator: Inference for Non-linear Effects in High-dimensional Additive Models Refined Risk Bounds for Unbounded Losses via Transductive Priors A Common Interface for Automatic Differentiation LazyDINO: Fast, Scalable, and Efficiently Amortized Bayesian Inversion via Structure-Exploiting and Surrogate-Driven Measure Transport The Distribution of Ridgeless Least Squares Interpolators Nonparametric Estimation of a Factorizable Density using Diffusion Models Learning Bayesian Network Classifiers to Minimize Class Variable Parameters Simulation-based Calibration of Uncertainty Intervals under Approximate Bayesian Estimation
Persistence Diagrams Estimation of Multivariate Piecewise...
Hugo Henneus · 2026-01-01 · via JMLR

Hugo Henneuse; 27(31):1−55, 2026.

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.

[abs][pdf][bib]