paper-with-me

홈 › Papers

Simplifying Polylogarithms with Machine Learning

2022-06-08 · Aurélien Dersy, Matthew D. Schwartz, Xiaoyuan Zhang

Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy a number of algebraic identities. For the logarithm, all the identities follow from the product rule. For the dilogarithm and higher-weight classical polylogarithms, the identities can involve five functions or more. In many calculations relevant to particle physics, complicated combinations of polylogarithms often arise from Feynman integrals. Although the initial expressions resulting from the integration usually simplify, it is often difficult to know which identities to apply and in what order. To address this bottleneck, we explore to what extent machine learning methods can help. We consider both a reinforcement learning approach, where the identities are analogous to moves in a game, and a transformer network approach, where the problem is viewed analogously to a language-translation task. While both methods are effective, the transformer network appears more powerful and holds promise for practical use in symbolic manipulation tasks in mathematical physics.

📄 PDF Abstract BibTeX arXiv:2206.04115

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine Learning

Similar Papers 제목 키워드 기반

Metalearning Using Structure-rich Pipeline Representations for Better AutoML

2021-03-13 · ICLR Workshop Learning_to_Learn 2021 5 · Anonymous

Automatic machine learning (AutoML) systems have been shown to perform better when they learn from past experience. Examples include Auto-sklearn, which warm-starts the ML pipeline search using existing programs known to…

AutoMLreinforcement-learningReinforcement Learning (RL)tabular-classification

Transparency challenges in policy evaluation with causal machine learning -- improving usability and accountability

2023-10-20 · Patrick Rehill, Nicholas Biddle

Causal machine learning tools are beginning to see use in real-world policy evaluation tasks to flexibly estimate treatment effects. One issue with these methods is that the machine learning models used are generally bla…

SymJAX: symbolic CPU/GPU/TPU programming

2020-05-21 · Randall Balestriero

SymJAX is a symbolic programming version of JAX simplifying graph input/output/updates and providing additional functionalities for general machine learning and deep learning applications. From an user perspective SymJAX…

BIG-bench Machine LearningCPUDeep LearningGPU

Tsetlin Machine for Solving Contextual Bandit Problems

2022-02-04 · Raihan Seraj, Jivitesh Sharma, Ole-Christoffer Granmo

This paper introduces an interpretable contextual bandit algorithm using Tsetlin Machines, which solves complex pattern recognition tasks using propositional logic. The proposed bandit learning algorithm relies on straig…

Thompson Sampling

Simplifying Neural Networks During Training

2026-07-30 · Lorenzo Sciandra, Samuele Fonio, Roberto Esposito arxiv

Understanding and exploiting the training dynamics of overparameterized deep neural networks remains a central challenge in modern machine learning. Recent evidence on Neural Collapse (NC) shows that class representation…