Search Results for author:
Found 2 papers, 1 papers with code
Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping
We fine tune this model to obtain a Searchformer, a Transformer model that optimally solves previously unseen Sokoban puzzles 93. 7% of the time, while using up to 26. 8% fewer search steps than the $A^*$ implementation that was used for training initially.
On Linear Separability under Linear Compression with Applications to Hard Support Vector Machine
In this paper, we show that linear separability is maintained as long as the distortion of the inner products is smaller than the squared margin of the original data-generating distribution.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
