arXiv · 1807.07615
Sparse space-time models: Concentration Inequalities and Lasso
Abstract
Inspired by Kalikow-type decompositions, we introduce a new stochastic model of infinite neuronal networks, for which we establish sharp oracle inequalities for Lasso methods and restricted eigenvalue properties for the associated Gram matrix with high probability. These results hold even if the network is only partially observed. The main argument rely on the fact that concentration inequalities can easily be derived whenever the transition probabilities of the underlying process admit a sparse space-time representation.
Explore related subjects
Keep this discovery
Guilherme Ost, Patricia Reynaud-Bouret. 2018-07-19. Sparse space-time models: Concentration Inequalities and Lasso. https://arxiv.org/abs/1807.07615
Cite the original work for its findings. Save a collection to share your selection of sources.