Classification fields are infinite recursive hierarchical cluster structures generated by a local refinement rule, and a ReLU network predictor learned from finite prefixes can approximate the generator and extend it to deeper levels with exponential convergence in the completed cell metric.
The gromov-hausdorff distance between ultrametric spaces: its structure and computation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Defines a complete invariant for nD unordered point clouds under rigid motion with Lipschitz continuous metric computable in polynomial time.
citing papers explorer
-
Classification Fields: Arbitrarily Fine Recursive Hierarchical Clustering From Few Examples
Classification fields are infinite recursive hierarchical cluster structures generated by a local refinement rule, and a ReLU network predictor learned from finite prefixes can approximate the generator and extend it to deeper levels with exponential convergence in the completed cell metric.
-
Complete invariants of atomic clouds under rigid motion with Lipschitz continuous metrics in a polynomial time
Defines a complete invariant for nD unordered point clouds under rigid motion with Lipschitz continuous metric computable in polynomial time.