Fetching the paper…
Reading the bibliography…
Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy a number of algebraic identities.
“Analysing Mathematical Reasoning Abilities of Neural Models”
David Saxton, Edward Grefenstette, Felix Hill and Pushmeet Kohli · 1904
Earlier work this paper cites.
“Can Neural Networks Learn Symbolic Rewriting?”
Bartosz Piotrowski, Josef Urban, Chad. Brown and Cezary Kaliszyk · 1911
Earlier work this paper cites.
“Deep Learning for Symbolic Mathematics”, 2019
Guillaume Lample and François Charton · 1912
Earlier work this paper cites.
“The Functions of Schläfli And Lobatschefsky”
H… Coxeter · 1935
Earlier work this paper cites.
“On Information and Sufficiency”
S. Kullback and R.. Leibler · 1951
Earlier work this paper cites.
“Methods of conjugate gradients for solving linear systems”
Magnus. Hestenes and Eduard Stiefel · 1952
Earlier work this paper cites.
“Lie elements and an algebra associated with shuffles”
Rimhak Ree · 1958
Earlier work this paper cites.
“The analytic S-matrix”
Richard Eden, Peter. Landshoff, David. Olive and John Polkinghorne · 1966
Earlier work this paper cites.
“Differential equations method. New technique for massive Feynman diagram calculation”
A.V. Kotikov · 1991
Earlier work this paper cites.
“Elliptic polylogarithms”
A Levin and A Beilinson · 1994
Earlier work this paper cites.
“Dilogarithm Identities”
Anatol. Kirillov · 1995
Earlier work this paper cites.
“Functional equations of iterated integrals with regular singularities”
Zdzisaw Wojtkowiak · 1996
Earlier work this paper cites.
“Multiple polylogarithms, cyclotomy and modular complexes”
Alexander. Goncharov · 1998
Earlier work this paper cites.
“Two loop master integrals for gamma* — > > 3 jets: The Planar topologies”
T. Gehrmann and E. Remiddi · 2001
Earlier work this paper cites.
“Special values of multiple polylogarithms”
Jonathan. Borwein, David. Bradley, David. Broadhurst and Petr Lisonek · 2001
Earlier work this paper cites.
“Multiple polylogarithms and mixed Tate motives”, 2001
A.. Goncharov · 2001
Earlier work this paper cites.
“Reformer: The Efficient Transformer”
Nikita Kitaev, Łukasz Kaiser and Anselm Levskaya · 2001
Earlier work this paper cites.
“Towards multiple elliptic polylogarithms”
Andrey Levin and Georges Racinet · 2007
Earlier work this paper cites.
“The Dilogarithm Function”
Don Zagier · 2007
Earlier work this paper cites.
Haotian Fu et al · 2009
Earlier work this paper cites.
“Classical Polylogarithms for Amplitudes and Wilson Loops”
A.. Goncharov, M. Spradlin, C. Vergu and A. Volovich · 2010
Earlier work this paper cites.
“Multiple Elliptic Polylogarithms”
Francis C.. Brown and Andrey Levin · 2011
Earlier work this paper cites.
“Two-loop leading color corrections to heavy-quark pair production in the gluon fusion channel”
R. Bonciani et al · 2011
Earlier work this paper cites.
“Hopf algebras, coproducts and symbols: an application to Higgs boson amplitudes”
Claude Duhr · 2012
Cited alongside, same era.
“Learning to Discover Efficient Mathematical Identities”
Wojciech Zaremba, Karol Kurach and Rob Fergus · 2014
Cited alongside, same era.
“Distributed Representations of Sentences and Documents”
Quoc. Le and Tomas Mikolov · 2014
Cited alongside, same era.
“Sequence to Sequence Learning with Neural Networks”
Ilya Sutskever, Oriol Vinyals and Quoc. Le · 2014
Cited alongside, same era.
“High-Dimensional Continuous Control Using Generalized Advantage Estimation”
John Schulman et al · 2015
Cited alongside, same era.
“Semi-Supervised Classification with Graph Convolutional Networks”
Thomas. Kipf and Max Welling · 2016
“PyTorch: An Imperative Style, High-Performance Deep Learning Library”
Adam Paszke et al · 2019
Later among the works it cites.
“Solving the Rubik’s cube with deep reinforcement learning and search”
Forest Agostinelli, Stephen McAleer, Alexander Shmakov and Pierre Baldi · 2019
Later among the works it cites.
“Learning Heuristics for Quantified Boolean Formulas through Reinforcement Learning”
Gil Lederman, Markus Rabe, Sanjit Seshia and Edward. Lee · 2020
Later among the works it cites.
“Discovering Symbolic Models from Deep Learning with Inductive Biases”
Miles Cranmer et al · 2020
Later among the works it cites.
“AI Feynman: A physics-inspired method for symbolic regression”
Silviu-Marian Udrescu and Max Tegmark · 2020
Later among the works it cites.
“A Bayesian machine scientist to aid in the solution of challenging scientific problems”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Greg Brockman et al · 2016
Cited alongside, same era.
“Learning Continuous Semantic Representations of Symbolic Expressions”
Miltiadis Allamanis, Pankajan Chanthirasegaran, Pushmeet Kohli and Charles Sutton · 2017
Cited alongside, same era.
“Proximal Policy Optimization Algorithms”, 2017
John Schulman et al · 2017
Cited alongside, same era.
“Trust Region Policy Optimization”, 2017
John Schulman et al · 2017
Cited alongside, same era.
“Inductive Representation Learning on Large Graphs”
William. Hamilton, Rex Ying and Jure Leskovec · 2017
Cited alongside, same era.
“Graph Attention Networks”
Petar Veličković et al · 2017
Cited alongside, same era.
Roger Guimerà et al · 2020
Later among the works it cites.
“Compton Scattering Total Cross Section at Next-to-Leading Order”
Roman. Lee, Matthew. Schwartz and Xiaoyuan Zhang · 2021
Later among the works it cites.
“Sequential Discontinuities of Feynman Integrals and the Monodromy Group”
Jacob. Bourjaily et al · 2021
Later among the works it cites.
“Towards finding longer proofs”
Zsolt Zombori et al · 2021
Later among the works it cites.
“TacticZero: Learning to Prove Theorems from Scratch with Deep Reinforcement Learning”
Minchao Wu, Michael Norrish, Christian. Walder and Amir Dezfouli · 2021
Later among the works it cites.
“Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients”
Brenden Petersen et al · 2021
Later among the works it cites.
“Learning to Unknot”
Sergei Gukov, James Halverson, Fabian Ruehle and Piotr Sukowski · 2021
Later among the works it cites.
“Advancing mathematics by guiding human intuition with AI”
Alex Davies et al · 2021
Later among the works it cites.
“Contrastive Reinforcement Learning of Symbolic Reasoning Domains”
Gabriel Poesia, Wenxin Dong and Noah. Goodman · 2021
Later among the works it cites.
“GraphMR: Graph Neural Network for Mathematical Reasoning”
Weijie Feng et al · 2021
Later among the works it cites.
“Stable-Baselines3: Reliable Reinforcement Learning Implementations”
Antonin Raffin et al · 2021
Later among the works it cites.
“Training Larger Networks for Deep Reinforcement Learning”
Kei Ota, Devesh. Jha and Asako Kanezaki · 2021
Later among the works it cites.
“Three-point energy correlator in 𝒩 = 4 \mathcal{N}=4 super Yang-Mills Theory”, 2022
Kai Yan and Xiaoyuan Zhang · 2022
Closest in time.
“Implications of the Landau equations for iterated integrals”
Holmfridur. Hannesdottir, Andrew. McLeod, Matthew. Schwartz and Cristian Vergu · 2022
Closest in time.
“Symmetry discovery with deep learning”
Krish Desai, Benjamin Nachman and Jesse Thaler · 2022
Closest in time.
“Machine Learning Hidden Symmetries”
Ziming Liu and Max Tegmark · 2022
Closest in time.
“Regularized target encoding outperforms traditional methods in supervised machine learning with high cardinality features”
Florian Pargent, Florian Pfisterer, Janek Thomas and Bernd Bischl · 2022
Closest in time.