Tensor Train for Global Optimization Problems in Robotics
Suhan Shetty, Teguh Lembono, Tobias Loew, and Sylvain Calinon

TL;DR
This paper introduces a tensor train-based method to initialize optimization algorithms near global optima, improving convergence speed and solution quality in robotics tasks without needing prior solution databases.
Contribution
The paper presents a novel tensor train approach for probabilistic initialization of optimization problems, enhancing global optimization in robotics applications.
Findings
Efficiently approximates joint distributions for task parameters and variables.
Generates multiple solutions close to global optima faster than existing methods.
Successfully applied to inverse kinematics and motion planning in robotics.
Abstract
The convergence of many numerical optimization techniques is highly dependent on the initial guess given to the solver. To address this issue, we propose a novel approach that utilizes tensor methods to initialize existing optimization solvers near global optima. Our method does not require access to a database of good solutions. We first transform the cost function, which depends on both task parameters and optimization variables, into a probability density function. Unlike existing approaches, the joint probability distribution of the task parameters and optimization variables is approximated using the Tensor Train model, which enables efficient conditioning and sampling. We treat the task parameters as random variables, and for a given task, we generate samples for decision variables from the conditional distribution to initialize the optimization solver. Our method can produce…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications
