
Learning with treebased tensor formats
This paper is concerned with the approximation of highdimensional funct...
read it

Learning with tree tensor networks: complexity estimates and model selection
In this paper, we propose and analyze a model selection method for tree ...
read it

Perfect TreeLike Markovian Distributions
We show that if a strictly positive joint probability distribution for a...
read it

High Dimensional Classification through ℓ_0Penalized Empirical Risk Minimization
We consider a high dimensional binary classification problem and constru...
read it

Analysis of the generalization error: Empirical risk minimization over deep artificial neural networks overcomes the curse of dimensionality in the numerical approximation of B
The development of new classification and regression algorithms based on...
read it

Bayesian Learning of Clique Tree Structure
The problem of categorical data analysis in high dimensions is considere...
read it

Analysis of tensor methods for stochastic models of gene regulatory networks
The tensorstructured parametric analysis (TPA) has been recently develo...
read it
Learning highdimensional probability distributions using tree tensor networks
We consider the problem of the estimation of a highdimensional probability distribution using model classes of functions in treebased tensor formats, a particular case of tensor networks associated with a dimension partition tree. The distribution is assumed to admit a density with respect to a product measure, possibly discrete for handling the case of discrete random variables. After discussing the representation of classical model classes in treebased tensor formats, we present learning algorithms based on empirical risk minimization using a L^2 contrast. These algorithms exploit the multilinear parametrization of the formats to recast the nonlinear minimization problem into a sequence of empirical risk minimization problems with linear models. A suitable parametrization of the tensor in treebased tensor format allows to obtain a linear model with orthogonal bases, so that each problem admits an explicit expression of the solution and crossvalidation risk estimates. These estimations of the risk enable the model selection, for instance when exploiting sparsity in the coefficients of the representation. A strategy for the adaptation of the tensor format (dimension tree and treebased ranks) is provided, which allows to discover and exploit some specific structures of highdimensional probability distributions such as independence or conditional independence. We illustrate the performances of the proposed algorithms for the approximation of classical probabilistic models (such as Gaussian distribution, graphical models, Markov chain).
READ FULL TEXT
Comments
There are no comments yet.