The reviewed record of science sign in
Pith

arxiv: 2402.02890 · v1 · pith:ZJECOBOX · submitted 2024-02-05 · cs.LG · math.OC

Black-Box Approximation and Optimization with Hierarchical Tucker Decomposition

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZJECOBOXrecord.jsonopen to challenge →

classification cs.LG math.OC
keywords optimizationapproximationdecompositionblack-boxgradient-freehierarchicalmethodmethods
0
0 comments X
read the original abstract

We develop a new method HTBB for the multidimensional black-box approximation and gradient-free optimization, which is based on the low-rank hierarchical Tucker decomposition with the use of the MaxVol indices selection procedure. Numerical experiments for 14 complex model problems demonstrate the robustness of the proposed method for dimensions up to 1000, while it shows significantly more accurate results than classical gradient-free optimization methods, as well as approximation and optimization methods based on the popular tensor train decomposition, which represents a simpler case of a tensor network.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Variational inference and density estimation with non-negative tensor of hierarchical tucker format

    math.NA 2026-06 unverdicted novelty 5.0

    A two-stage interpolation and second-order fitting procedure compresses high-dimensional discrete probability tensors into non-negative hierarchical Tucker format with O(d) complexity.