Mikel Landajuela, Brenden Petersen, Soo Kim, Claudio Santiago, Ruben Glatt, T Mundhenk, Jacob Pettit, Daniel Faissol
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Many machine learning strategies designed to automate mathematical tasks leverage neural networks to search large combinatorial spaces of mathematical symbols. In contrast to traditional evolutionary approaches, using a neural network at the core of the search allows learning higher-level symbolic patterns, providing an informed direction to guide the search. When no labeled data is available, such networks can still be trained using reinforcement learning. However, we demonstrate that this approach can suffer from an early commitment phenomenon and from initialization bias, both of which limit exploration. We present two exploration methods to tackle these issues, building upon ideas of entropy regularization and distribution initialization. We show that these techniques can improve the performance, increase sample efficiency, and lower the complexity of solutions for the task of symbolic regression.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2107.09158")
get_code_for_paper("2107.09158")
have("2107.09158")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2107.09158.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2107.09158)
Connect an agent — have() is free.