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.
Computing large convex regions of obstacle-free space through semidefinite programming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.