On statistical learning of simplices: unmixing problem revisited

DOI10.1214/20-AOS2016zbMath1475.62293arXiv1810.07845OpenAlexW3122979909MaRDI QIDQ820821

N. E. Zubov

Publication date: 28 September 2021

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.07845

zbMATH Keywords

computer simulationsstatistical learning theoryhigh-dimensional geometrysample complexityinference of simplices

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial aspects of simplicial complexes (05E45) Topological data analysis (62R40)

Cites Work

• Unnamed Item
• Unnamed Item
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• An optimal convex hull algorithm in any fixed dimension
• Random polytopes in a convex polytope, independence of shape, and concentration of vertices
• Methods for estimation of convex sets
• On the mean value of the volume of a random polytope in a convex set
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
• Adaptive estimation of convex polytopes and convex sets from noisy data
• Adaptive estimation of convex and polytopal density support
• Sample Complexity of Dictionary Learning and Other Matrix Factorizations
• Learnability and the Vapnik-Chervonenkis dimension
• Convex bodies, economic cap coverings, random polytopes
• The isoperimetric inequality
• A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
• Spectral Unmixing via Data-Guided Sparsity

This page was built for publication: On statistical learning of simplices: unmixing problem revisited