Man, Machine, and Mathematics

📅 2026-04-29
📈 Citations: 0
Influential: 0
📄 PDF

career value

243K/year
🤖 AI Summary
This work proposes a sparse and unified theoretical framework to systematically uncover the core mechanisms underlying learning, optimization, and modeling. It conceptualizes learning as a multi-level process arising from the coupling of problem formulation, method selection, and optimization dynamics. By precisely defining “solvable problems” and “parameterized methods,” the framework reduces complex learning theory to a few fundamental concepts rooted in dynamical systems, differential geometry, and foundational physics. The approach yields a general convergence theorem and establishes a universal theoretical foundation for cross-domain modeling and algorithm design, substantially enhancing both the parsimony and explanatory power of learning theory.
📝 Abstract
Nonlinear models and optimization methods have successfully tackled a rapidly growing set of problems in recent years. Indeed, a relatively small toolbox of such models and methods can provide sufficient performance across a large landscape of tasks: deep learning alone has made significant recent contributions in scientific modelling, natural language processing, visual analysis, etc. A similar relationship exists between physical theories and phenomena, where many applications and observations emerge neatly from remarkably minimal foundations. It is natural to wonder if sparse unified frameworks could be built to steer discussion and discovery in the fields concerned with learning, optimization, and modelling. In this work, we posit and examine a possible outline for such a unified theory, interpreting the notion of ''learning'' in a broad sense. In particular, we pursue our goals by viewing learning as an inter-connected process on multiple levels: problem setup, choosing methods, and the analysis of their interplay via imposed optimisation dynamics. We begin by proposing a precise yet versatile definition for ''solvable'' problems. We then define the ''parametrised methods'' by which their solution(s) may be ''learned''. Our goal is to sketch a ''universal convergence theorem'', specifying how and when solvable problems become amenable to the methods chosen for them. We find these constructions reduce the study of learning down to remarkably few ideas and tools - many of which are simply adapted from existing ones in dynamical systems theory, geometry, and fundamental physics.
Problem

Research questions and friction points this paper is trying to address.

unified theory
learning
optimization
solvable problems
parametrised methods
Innovation

Methods, ideas, or system contributions that make the work stand out.

solvable problems
parametrised methods
universal convergence theorem
optimization dynamics
unified learning theory
A
Akshunna S. Dogra
The NSF AI Institute for Artificial Intelligence and Fundamental Interactions (IAIFI), USA; EPSRC Centre for Doctoral Training: Mathematics of Random Systems, UK; Center of Mathematical Sciences and Applications, Harvard University, USA; Department of Physics, Massachusetts Institute of Technology (MIT), USA; Department of Mathematics, Imperial College London, UK; MathePhysics, India