Black-Box Approximation and Optimization with Hierarchical Tucker Decomposition
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 27 references that are in the map. First posted on arXiv 5 Feb 2024.
Builds on
7 of 27 references.
References · 7
- 2013A Literature Survey of Benchmark Functions For Global Optimization Problemscited by 75
- 2017Tensor Networks for Dimensionality Reduction and Large-Scale Optimizations. Part 2 Applications and Future Perspectivescited by 53
- 2022TTOpt: A Maximum Volume Quantized Tensor Train-based Optimization and its Application to Reinforcement Learningcited by 15
- 2022Are Quantum Computers Practical Yet? A Case for Feature Selection in Recommender Systems using Tensor Networkscited by 4
- 2019Tensor Completion via Gaussian Process Based Initializationcited by 3
- 2020Certified Global Minima for a Benchmark of Difficult Optimization Problemscited by 3
- 2022Tensor Train for Global Optimization Problems in Roboticscited by 2
Built on by
Not cited yet.