Abstract: Machine learning (ML) in its current form implies that an answer to any problem can be well approximated by a function of a very peculiar form: a specially adjusted iteration of Heavyside theta-functions. It is natural to ask if the answers to the questions, which we already know, can be naturally represented in this form. We provide elementary, still non-evident examples that this is indeed possible, and suggest to look for a systematic reformulation of existing knowledge in a ML-consistent way. Success or a failure of these attempts can shed light on a variety of problems, both scientific and epistemological.
Cites work
- A novel symmetry of colored HOMFLY polynomials coming from \(\mathfrak{sl}(N|M)\) superalgebras
- Gaussian distribution of LMOV numbers
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- Implications for colored HOMFLY polynomials from explicit formulas for group-theoretical structure
- Interplay between Macdonald and Hall-Littlewood expansions of extended torus superpolynomials
- Introduction to nonlinear algebra
- Machine learning Lie structures \& applications to physics
- Multilayer feedforward networks are universal approximators
- New and old results in resultant theory
- Problems in the theory of automorphic forms to Salomon Bochner in gratitude
- Superintegrability summary
- Superstring theory. Volume 1: Introduction. Volume 2: Loop amplitudes, anomalies and phenomenology
This page was built for publication: Machine learning of the well-known things
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161005)
