%0 Journal Article %1 debie2018stochastic %A de Bie, Gwendoline %A Peyré, Gabriel %A Cuturi, Marco %D 2018 %K deep-learning optimal-transport probability stats %T Stochastic Deep Networks %U http://arxiv.org/abs/1811.07429 %X Machine learning is increasingly targeting areas where input data cannot be accurately described by a single vector, but can be modeled instead using the more flexible concept of random vectors, namely probability measures or more simply point clouds of varying cardinality. Using deep architectures on measures poses, however, many challenging issues. Indeed, deep architectures are originally designed to handle fixedlength vectors, or, using recursive mechanisms, ordered sequences thereof. In sharp contrast, measures describe a varying number of weighted observations with no particular order. We propose in this work a deep framework designed to handle crucial aspects of measures, namely permutation invariances, variations in weights and cardinality. Architectures derived from this pipeline can (i) map measures to measures - using the concept of push-forward operators; (ii) bridge the gap between measures and Euclidean spaces - through integration steps. This allows to design discriminative networks (to classify or reduce the dimensionality of input measures), generative architectures (to synthesize measures) and recurrent pipelines (to predict measure dynamics). We provide a theoretical analysis of these building blocks, review our architectures' approximation abilities and robustness w.r.t. perturbation, and try them on various discriminative and generative tasks.

@article{debie2018stochastic, abstract = {Machine learning is increasingly targeting areas where input data cannot be accurately described by a single vector, but can be modeled instead using the more flexible concept of random vectors, namely probability measures or more simply point clouds of varying cardinality. Using deep architectures on measures poses, however, many challenging issues. Indeed, deep architectures are originally designed to handle fixedlength vectors, or, using recursive mechanisms, ordered sequences thereof. In sharp contrast, measures describe a varying number of weighted observations with no particular order. We propose in this work a deep framework designed to handle crucial aspects of measures, namely permutation invariances, variations in weights and cardinality. Architectures derived from this pipeline can (i) map measures to measures - using the concept of push-forward operators; (ii) bridge the gap between measures and Euclidean spaces - through integration steps. This allows to design discriminative networks (to classify or reduce the dimensionality of input measures), generative architectures (to synthesize measures) and recurrent pipelines (to predict measure dynamics). We provide a theoretical analysis of these building blocks, review our architectures' approximation abilities and robustness w.r.t. perturbation, and try them on various discriminative and generative tasks.}, added-at = {2019-04-25T16:03:24.000+0200}, author = {de Bie, Gwendoline and Peyré, Gabriel and Cuturi, Marco}, biburl = {https://www.bibsonomy.org/bibtex/283b9e50de7cbad54adcdcfd18967faf4/kirk86}, description = {[1811.07429] Stochastic Deep Networks}, interhash = {296c798540e45e4da093bad095a41a92}, intrahash = {83b9e50de7cbad54adcdcfd18967faf4}, keywords = {deep-learning optimal-transport probability stats}, note = {cite arxiv:1811.07429}, timestamp = {2019-04-25T16:03:24.000+0200}, title = {Stochastic Deep Networks}, url = {http://arxiv.org/abs/1811.07429}, year = 2018 }