An ML approach to resolution of singularities
- URL: http://arxiv.org/abs/2307.00252v2
- Date: Wed, 23 Aug 2023 03:59:48 GMT
- Title: An ML approach to resolution of singularities
- Authors: Gergely B\'erczi and Honglu Fan and Mingcong Zeng
- Abstract summary: Resolution is a fundamental process in geometry in which we replace singular points with smooth points.
In this paper we introduce a new approach to the Hironaka game that uses reinforcement learning agents to find optimal resolutions of singularities.
- Score: 0.6906005491572401
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The solution set of a system of polynomial equations typically contains
ill-behaved, singular points. Resolution is a fundamental process in geometry
in which we replace singular points with smooth points, while keeping the rest
of the solution set unchanged. Resolutions are not unique: the usual way to
describe them involves repeatedly performing a fundamental operation known as
"blowing-up", and the complexity of the resolution highly depends on certain
choices. The process can be translated into various versions of a 2-player
game, the so-called Hironaka game, and a winning strategy for the first player
provides a solution to the resolution problem. In this paper we introduce a new
approach to the Hironaka game that uses reinforcement learning agents to find
optimal resolutions of singularities. In certain domains, the trained model
outperforms state-of-the-art selection heuristics in total number of polynomial
additions performed, which provides a proof-of-concept that recent developments
in machine learning have the potential to improve performance of algorithms in
symbolic computation.
Related papers
- Neuro-Symbolic AI for Analytical Solutions of Differential Equations [11.177091143370466]
We present an approach to find analytical solutions of differential equations using a neuro-symbolic AI framework.
This integration unifies numerical and symbolic differential equation solvers via a neuro-symbolic AI framework.
We show advantages over commercial solvers, symbolic methods, and approximate neural networks on a diverse set of problems.
arXiv Detail & Related papers (2025-02-03T16:06:56Z) - The Differentiable Feasibility Pump [49.55771920271201]
This paper shows that the traditional feasibility pump and many of its follow-ups can be seen as gradient-descent algorithms with specific parameters.
A central aspect of this reinterpretation is observing that the traditional algorithm differentiates the solution of the linear relaxation with respect to its cost.
arXiv Detail & Related papers (2024-11-05T22:26:51Z) - An Operator Learning Framework for Spatiotemporal Super-resolution of Scientific Simulations [3.921076451326108]
The Super Resolution Operator Network (SRNet) frames super-resolution as an operator learning problem.
It draws inspiration from existing operator learning problems to learn continuous representations of parametric differential equations from low-resolution approximations.
No restrictions are imposed on the locations of sensors at which the low-resolution approximations are provided.
arXiv Detail & Related papers (2023-11-04T05:33:23Z) - Optimizing Solution-Samplers for Combinatorial Problems: The Landscape
of Policy-Gradient Methods [52.0617030129699]
We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods.
Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem.
As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
arXiv Detail & Related papers (2023-10-08T23:39:38Z) - Multi-Phase Relaxation Labeling for Square Jigsaw Puzzle Solving [73.58829980121767]
We present a novel method for solving square jigsaw puzzles based on global optimization.
The method is fully automatic, assumes no prior information, and can handle puzzles with known or unknown piece orientation.
arXiv Detail & Related papers (2023-03-26T18:53:51Z) - Message Passing Neural PDE Solvers [60.77761603258397]
We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators.
We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes.
We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
arXiv Detail & Related papers (2022-02-07T17:47:46Z) - A Variational Inference Approach to Inverse Problems with Gamma
Hyperpriors [60.489902135153415]
This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors.
The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement.
arXiv Detail & Related papers (2021-11-26T06:33:29Z) - Ensemble Feature Extraction for Multi-Container Quality-Diversity
Algorithms [0.2741266294612775]
Quality-Diversity algorithms search for large collections of diverse and high-performing solutions.
We describe MC-AURORA, a Quality-Diversity approach that optimises simultaneously several collections of solutions.
We show that this approach produces solutions that are more diverse than those produced by single-representation approaches.
arXiv Detail & Related papers (2021-05-03T08:35:00Z) - Image Matching with Scale Adjustment [57.18604132027697]
We show how to represent and extract interest points at variable scales.
We devise a method allowing the comparison of two images at two different resolutions.
arXiv Detail & Related papers (2020-12-10T11:03:25Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.