Machine learning the real discriminant locus

DOI10.1016/J.JSC.2022.08.001MaRDI QIDQ2674017zbMATH OpenOpenAlexWikidataFDO

Authors Edgar A. Bernal, Jonathan D. Hauenstein, Dhagash Mehta, Margaret H. Regan, Tingting Tang

Publication date 22 September 2022

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.14078

zbMATH Keywords

discriminanthomotopy continuationparameter homotopy

Mathematics Subject Classification ID

Geometric aspects of numerical algebraic geometry (14Q65) Artificial neural networks and deep learning (68T07) Symbolic computation and algebraic computation (68W30)

Abstract: Parameterized systems of polynomial equations arise in many applications in science and engineering with the real solutions describing, for example, equilibria of a dynamical system, linkages satisfying design constraints, and scene reconstruction in computer vision. Since different parameter values can have a different number of real solutions, the parameter space is decomposed into regions whose boundary forms the real discriminant locus. This article views locating the real discriminant locus as a supervised classification problem in machine learning where the goal is to determine classification boundaries over the parameter space, with the classes being the number of real solutions. For multidimensional parameter spaces, this article presents a novel sampling method which carefully samples the parameter space. At each sample point, homotopy continuation is used to obtain the number of real solutions to the corresponding polynomial system. Machine learning techniques including nearest neighbor and deep learning are used to efficiently approximate the real discriminant locus. One application of having learned the real discriminant locus is to develop a real homotopy method that only tracks the real solution paths unlike traditional methods which track all~complex~solution~paths. Examples show that the proposed approach can efficiently approximate complicated solution boundaries such as those arising from the equilibria of the Kuramoto model.

Review text

Systems of polynomial equations arising in applications typically occur in \textit{parametric form}; for many real-valued choices of parameter values, we may need to solve the system over and over again. For both numerical homotopy continuation methods and the so-called algebraic methods (Gröbner bases, etc.), a weakness from the applied point of view is that they usually must compute all solutions over the complex numbers, whereas only real solutions are of interest. This paper investigates several approaches to sampling the discriminant locus of a parametric family of systems where the behavior of the real solutions changes, and using these samples to drive inference about the number of real solutions and how many solution paths to track. A key contribution is a novel sampling scheme for sampling parameter points near the boundary of the discriminant locus. Using training data sampled in this way, experimental results show that classification of the number of real solutions on several test cases than for uniformly sampled training data. This can be accomplished without ever computing the equation of the discriminant using a \textit{witness set} of parameter values whose cardinality is the degree of the discriminant. Examples involving parametrized univariate quadratic and cubic polynomials are studied, along with the multivariate equations of equillibria for the Kuramoto model with 3 or 4 oscillators. Experiments study neural networks, support vector machines, and nearest-neighbor classifiers. Experiments on the chosen examples demonstrate the ability to compute, with high rates of success, all real solutions by tracking only real paths chosen via nearest-neighbors from a sufficiently large set of pre-computed samples.

Recommendations

• Real solutions to systems of polynomial equations and parameter continuation
• Solving parametric polynomial systems
• Structure of discriminant set of real polynomial
• Complexity of the resolution of parametric systems of polynomial equations and inequations
• On solving parametric polynomial systems

Cites work

• A Neural Root Finder of Polynomials Based on Root Moments
• Adaptive strategies for solving parameterized systems using homotopy continuation
• Algorithm 921: alphaCertified: certifying solutions to polynomial systems
• Algorithms in real algebraic geometry
• Applications of polynomial systems. With contributions by Carlos D'Andrea, Alicia Dickenstein, Jonathan Hauenstein, Hal Schenck, and Jessica Sidman
• Approximation by superpositions of a sigmoidal function
• Certified Hermite Matrices from Approximate Roots - Univariate Case
• Coefficient-parameter polynomial continuation
• Comprehensive Gröbner bases
• Deep learning
• Determining the number of real roots of polynomials through neural networks
• Discriminants, resultants, and multidimensional determinants
• Efficient path tracking methods
• Exploring the potential energy landscape over a large parameter-space
• Finding all flux vacua in an explicit example
• From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
• scientific article; zbMATH DE number 47593 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 3806869 (Why is no real title available?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Isosingular sets and deflation
• Learning algebraic varieties from samples
• Learning sparse polynomial functions
• Locating and counting equilibria of the Kuramoto model with rank-one coupling
• MATCONT
• Membership tests for images of algebraic sets by linear projections
• Multilayer feedforward networks are universal approximators
• Nearest neighbor pattern classification
• Newton's method with deflation for isolated singularities of polynomial systems
• Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
• Numerically solving polynomial systems with Bertini
• Paramotopy: parameter homotopies in parallel
• Pattern recognition and machine learning.
• Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks
• Real monodromy action
• Regions of multistationarity in cascades of Goldbeter-Koshland loops
• Scikit-learn: machine learning in Python
• Smooth points on semi-algebraic sets
• Solving parametric polynomial systems
• Solving parametric systems of polynomial equations over the reals through Hermite matrices
• Synchronization in complex networks of phase oscillators: a survey
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Witness sets of projections

Cited in

(9)

• Catastrophe in elastic tensegrity frameworks
• Real solutions to systems of polynomial equations and parameter continuation
• Real circles tangent to 3 conics
• Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition
• Constrained neural networks for interpretable heuristic creation to optimise computer algebra systems
• Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD
• Routing functions for parameter space decomposition to describe stability landscapes of ecological models
• Towards learning the positive real discriminant of the Wnt signaling pathway shuttle model
• Lissajous varieties

Describes a project that uses

Uses Software

• Bertini
• Scikit
• alphaCertified
• AUTO
• Paramotopy
• DISCOVERER
• PyTorch
• MATCONT

This page was built for publication: Machine learning the real discriminant locus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674017)