Tensor Train Tree Search approximates the decision tree by a low-rank tensor train, enabling Monte Carlo tree search with much lower computation and memory, at the price of an underlying low-rank assumption.
Enhancing dexterity in robotic manipulation via hierarchical contact exploration
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics
Tensor Train Tree Search approximates the decision tree by a low-rank tensor train, enabling Monte Carlo tree search with much lower computation and memory, at the price of an underlying low-rank assumption.