activity
20112026
most citedA least-squares method for sparse low rank approximation of multivariate functions

72 citations · 536 across the 51 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

math.NA2020

Geometry of tree-based tensor formats in tensor Banach spaces

Antonio Falcó, Wolfgang Hackbusch, Anthony Nouy

In the paper `On the Dirac-Frenkel Variational Principle on Tensor Banach Spaces', we provided a geometrical description of manifolds of tensors in Tucker format with fixed multili…

math.FA2020★ 8 cited

Approximation of Smoothness Classes by Deep Rectifier Networks

Mazen Ali, Anthony Nouy

We consider approximation rates of sparsely connected deep rectified linear unit (ReLU) and rectified power unit (RePU) neural networks for functions in Besov spaces …

math.OC2020★ 1 cited

A PAC algorithm in relative precision for bandit problem with costly sampling

Marie Billaud-Friess, Arthur Macherey, Anthony Nouy +1

This paper considers the problem of maximizing an expectation function over a finite set, or finite-arm bandit problem. We first propose a naive stochastic bandit algorithm for obt…

math.ST2020★ 17 cited

Learning with tree tensor networks: complexity estimates and model selection

Bertrand Michel, Anthony Nouy

Tree tensor networks, or tree-based tensor formats, are prominent model classes for the approximation of high-dimensional functions in computational and data science. They correspo…

math.FA2020★ 8 cited

Approximation Theory of Tree Tensor Networks: Tensorized Univariate Functions -- Part II

Mazen Ali, Anthony Nouy

We study the approximation by tensor networks (TNs) of functions from classical smoothness classes. The considered approximation tool combines a tensorization of functions in $L^p(…

math.FA2020★ 8 cited

Approximation Theory of Tree Tensor Networks: Tensorized Univariate Functions -- Part I

Mazen Ali, Anthony Nouy

We study the approximation of functions by tensor networks (TNs). We show that Lebesgue -spaces in one dimension can be identified with tensor product spaces of arbitrary orde…

math.NA2020

A new splitting algorithm for dynamical low-rank approximation motivated by the fibre bundle structure of matrix manifolds

Marie Billaud-Friess, Antonio Falcó, Anthony Nouy

In this paper, we propose a new splitting algorithm for dynamical low-rank approximation motivated by the fibre bundle structure of the set of fixed rank matrices. We first introdu…