Tight Lower Bounds for Homology Inference

07/29/2013
by   Sivaraman Balakrishnan, et al.
0

The homology groups of a manifold are important topological invariants that provide an algebraic summary of the manifold. These groups contain rich topological information, for instance, about the connected components, holes, tunnels and sometimes the dimension of the manifold. In earlier work, we have considered the statistical problem of estimating the homology of a manifold from noiseless samples and from noisy samples under several different noise models. We derived upper and lower bounds on the minimax risk for this problem. In this note we revisit the noiseless case. In previous work we used Le Cam's lemma to establish a lower bound that differed from the upper bound of Niyogi, Smale and Weinberger by a polynomial factor in the condition number. In this note we use a different construction based on the direct analysis of the likelihood ratio test to show that the upper bound of Niyogi, Smale and Weinberger is in fact tight, thus establishing rate optimal asymptotic minimax bounds for the problem. The techniques we use here extend in a straightforward way to the noisy settings considered in our earlier work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2011

Minimax Rates for Homology Inference

Often, high dimensional data lie close to a low-dimensional submanifold ...
research
04/13/2021

Tight Lower Bound for Average Number of Terms in Optimal Double-base Number System

We show in this note that the average number of terms in the optimal dou...
research
09/10/2018

New Lower Bounds for the Number of Pseudoline Arrangements

Arrangements of lines and pseudolines are fundamental objects in discret...
research
01/23/2016

Minimax Lower Bounds for Linear Independence Testing

Linear independence testing is a fundamental information-theoretic and s...
research
08/09/2016

On Lower Bounds for Regret in Reinforcement Learning

This is a brief technical note to clarify the state of lower bounds on r...
research
01/25/2020

Tight Regret Bounds for Noisy Optimization of a Brownian Motion

We consider the problem of Bayesian optimization of a one-dimensional Br...
research
05/18/2023

Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues

A multiplicity queue is a concurrently-defined data type which relaxes t...

Please sign up or login with your details

Forgot password? Click here to reset