Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding

From MaRDI portal
Publication:2117205
Jump to:navigation, search

DOI10.1007/978-3-030-78230-6_8OpenAlexW3169683796MaRDI QIDQ2117205

Eldan Cohen, J. Christopher Beck

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_8

zbMATH Keywords

beam searchneural sequence modelsrandomized restarts


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)



Uses Software

  • LKH
  • Concorde
  • Rdkit
  • CSGNet
  • DeepCoder


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Optimal speedup of Las Vegas algorithms
  • Statistical regimes across constrainedness regions
  • Three-dimensional matching instances are rich in stable matchings
  • Simple statistical gradient-following algorithms for connectionist reinforcement learning
  • Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
  • Heavy-Tail Phenomena
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2117205&oldid=14620732"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 23:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki