Searcharxiv⌕ Search

arXiv subjects

Dalton A R Sakthivadivel

Publications and source records attributed to Dalton A R Sakthivadivel.

At least 19 recordsLinked to original sources

On two differing geometric descriptions of the passage from microscopy to macroscopy in Markov diffusion theory

In various disparate settings one studies how random processes give way to parabolic partial differential equations and in turn to functional inequalities involving gradients and variational calculus. Particles subject to gradient forces, the fields which move them, the empirical measures which they form, the smooth laws which those measures approximate, and differentiable functionals of these laws constitute a hierarchy of descriptions of diffusion. Intervening on this hierarchy is a choice of how a conintuity operator converts particle velocity to the evolution of measures. Here a central object is constructed mediating two different such descriptions. The space of smooth positive probability densities on a closed Riemannian manifold is treated as a Fréchet manifold whose full continuous cotangent space consists of nonconstant distributions and whose regular cotangent space consists of sufficiently regular nonconstant functions. Beginning from the operator on this space arising as the infinitesimal lift of diffeomorphisms of the base manifold, two different Hilbert completions of this space of densities account for a wide class of objects relevant, leading to a partial universalisation of the microscopic--mesoscopic--macroscopic hierarchy in Markov analysis.

math.PR↗

The nonequilibrium statistical mechanics of Markov interacting particles

We consider coupled stochastic systems decomposed into exterior, boundary, and interior variables, with the boundary variables sometimes carrying the directed structure of a sensor and actuator. The central question is when the conditional law of histories factorises, and how this path space statement is detected by log likelihoods, by Girsanov changes of measure, and by information theoretic quantities used in nonequilibrium statistical physics. The basic object is a regular conditional probability on a path space. Under domination by clamped reference laws, the boundary property becomes multiplicative separation of a Radon--Nikodym derivative, or equivalently additive separation of a path log likelihood. For Itō diffusions this log likelihood is computed by Girsanov's theorem; its expectation is the quadratic control energy appearing in the Föllmer entropy identity and in the stochastic control formulation of Schrödinger bridge problems. When exact factorisation fails, the remaining coupling is measured by conditional mutual information, namely the relative entropy between the true boundary-conditioned path law and the product of its conditional marginals. This gives a common language for boundary screening, path likelihood inference, controlled changes of path law, and the thermodynamic value of mutual information.

cond-mat.stat-mech↗

Topological constraints on self-organisation in locally interacting systems

All intelligence is collective intelligence, in the sense that it is made of parts which must align with respect to system-level goals. Understanding the dynamics which facilitate or limit navigation of problem spaces by aligned parts thus impacts many fields ranging across life sciences and engineering. To that end, consider a system on the vertices of a planar graph, with pairwise interactions prescribed by the edges of the graph. Such systems can sometimes exhibit long-range order, distinguishing one phase of macroscopic behaviour from another. In networks of interacting systems we may view spontaneous ordering as a form of self-organisation, modelling neural and basal forms of cognition. Here, we discuss necessary conditions on the topology of the graph for an ordered phase to exist, with an eye towards finding constraints on the ability of a system with local interactions to maintain an ordered target state. By studying the scaling of free energy under the formation of domain walls in three model systems -- the Potts model, autoregressive models, and hierarchical networks -- we show how the combinatorics of interactions on a graph prevent or allow spontaneous ordering. As an application we are able to analyse why multiscale systems like those prevalent in biology are capable of organising into complex patterns, whereas rudimentary language models are challenged by long sequences of outputs.

cond-mat.stat-mech↗

A framework for the use of generative modelling in non-equilibrium statistical mechanics

We discuss an approach to mathematically modelling systems made of objects that are coupled together, using generative models of the dependence relationships between states (or trajectories) of the things comprising such systems. This broad class includes open or non-equilibrium systems and is especially relevant to self-organising systems. The ensuing variational free energy principle (FEP) has certain advantages over using random dynamical systems explicitly, notably, by being more tractable and offering a parsimonious explanation of why the joint system evolves in the way that it does, based on the properties of the coupling between system components. The FEP is a method whose use allows us to build a model of the dynamics of an object as if it were a process of variational inference, because variational free energy (or surprisal) is a Lyapunov function for its dynamics. In short, we argue that using generative models to represent and track relations amongst subsystems leads us to a particular statistical theory of interacting systems. Conversely, this theory enables us to construct nested models that respect the known relations amongst subsystems. We point out that the fact that a physical object conforms to the FEP does not necessarily imply that this object performs inference in the literal sense; rather, it is a useful explanatory fiction which replaces the `explicit' dynamics of the object with an `implicit' flow on free energy gradients -- a fiction that may or may not be entertained by the object itself.

cond-mat.stat-mech↗

Completions of complexes of differential modules on singular schemes

Spencer cohomology theory studies the cohomology of chain complexes of modules over the ring of differential operators $\mathscr{D}$ of a smooth analytic space. In this paper we give a generalisation of Spencer cohomology suitable for singular schemes of finite type over a field. Our motivation was a conjecture of Vinogradov concerning the homological properties of differential operators on singular affine varieties; namely, that complexes of certain such operators are acyclic if and only if the variety is smooth. We will provide a negative answer to Vinogradov's conjecture as stated. In principle Vinogradov's conjecture can also be posed for the Spencer complex of a general $\mathscr{D}$-module -- however the answer is trivial, since singularities prohibit a definition of Spencer cohomology with any good properties. Our main result will be the construction of a Spencer complex on a large class of singular schemes which is suitable as a cohomology theory for the space. Following this we are able to ask the same question as Vinogradov in this case, where we give a more positive answer. Our main technique draws from Hartshorne's construction of de Rham cohomology by formal completion.

math.AG↗

The relation of bias with risk in empirically constrained inferences

We give some results relating asymptotic characterisations of maximum entropy probability measures to characterisations of Bayes optimal classifiers. Our main theorems show that maximum entropy is a universally Bayes optimal decision rule given constraints on one's knowledge about some observed data in terms of an expected loss. We will extend this result to the case of uncertainty in the observations of expected losses by generalising Sanov's theorem to distributions of constraint values.

math.ST↗

On the map-territory fallacy fallacy

This paper presents a meta-theory of the usage of the free energy principle (FEP) and examines its scope in the modelling of physical systems. We consider the so-called `map-territory fallacy' and the fallacious reification of model properties. By showing that the FEP is a consistent, physics-inspired theory of inferences of inferences, we disprove the assertion that the map-territory fallacy contradicts the principled usage of the FEP. As such, we argue that deploying the map-territory fallacy to criticise the use of the FEP and Bayesian mechanics itself constitutes a fallacy: what we call the {\it map-territory fallacy fallacy}. In so doing, we emphasise a few key points: the uniqueness of the FEP as a model of particles or agents that model their environments; the restoration of convention to the FEP via its relation to the principle of constrained maximum entropy; the `Jaynes optimality' of the FEP under this relation; and finally, the way that this meta-theoretical approach to the FEP clarifies its utility and scope as a formal modelling tool. Taken together, these features make the FEP, uniquely, {\it the} ideal model of generic systems in statistical physics.

physics.hist-ph↗

Resilience and adaptability in self-evidencing systems

In this paper we will articulate a view of resilience under the free energy principle and vice versa. The free energy principle is about existence and identity, and resilience is the condition under which things exist at all. In previous work this has been investigated as modelling resilience using the free energy principle. We will extend that work by making the case that self-organisation under the free energy principle is about resilience, in the sense that identity is a constant process of self-reconfiguration, implying the existence of a self-model and the energy to reconfigure that self-model -- and hence, the resilience of a maintained identity under changes. A general framework for thinking about resilience in this context will be sketched out and some models will be provided using that framework.

nlin.AO↗

Magnetisation and mean field theory in the Ising model

In this set of notes, a complete, pedagogical tutorial for applying mean field theory to the two-dimensional Ising model is presented. Beginning with the motivation and basis for mean field theory, we formally derive the Bogoliubov inequality and discuss mean field theory itself. We proceed with the use of mean field theory to determine a magnetisation function, and the results of the derivation are interpreted graphically, physically, and mathematically. We give a new interpretation of the self-consistency condition in terms of intersecting surfaces and constrained solution sets. We also include some more general comments on the thermodynamics of the phase transition. We end by evaluating symmetry considerations in magnetisation, and some more subtle features of the Ising model. Together, a self-contained overview of the mean field Ising model is given, with some novel presentation of important results.

cond-mat.stat-mech↗

From bordisms of three-manifolds to domain walls between topological orders

We study a correspondence between spin three-manifolds and bosonic abelian topological orders. Let $N$ be a spin three-manifold. We can define a $(2+1)$-dimensional topological order $\mathrm{TO}_N$ as follows: its anyons are the torsion elements in $H_1(N)$, the braiding of anyons is given by the linking form, and their topological spins are given by the quadratic refinement of the linking form obtained from the spin structure. Under this correspondence, a surgery presentation of $N$ gives rise to a classical Chern--Simons description of the associated topological order $\mathrm{TO}_N$. We then extend the correspondence to spin bordisms between three-manifolds, and domain walls between topological orders. In particular, we construct a domain wall $\mathcal{D}_M$ between $\mathrm{TO}_N$ and $\mathrm{TO}_{N'}$, where $M$ is a spin bordism from $N$ to $N'$. This domain wall unfolds to a composition of a gapped boundary, obtained from anyon condensation, and a gapless Narain boundary CFT.

math-ph↗

Designing Ecosystems of Intelligence from First Principles

This white paper lays out a vision of research and development in the field of artificial intelligence for the next decade (and beyond). Its denouement is a cyber-physical ecosystem of natural and synthetic sense-making, in which humans are integral participants -- what we call ''shared intelligence''. This vision is premised on active inference, a formulation of adaptive behavior that can be read as a physics of intelligence, and which inherits from the physics of self-organization. In this context, we understand intelligence as the capacity to accumulate evidence for a generative model of one's sensed world -- also known as self-evidencing. Formally, this corresponds to maximizing (Bayesian) model evidence, via belief updating over several scales: i.e., inference, learning, and model selection. Operationally, this self-evidencing can be realized via (variational) message passing or belief propagation on a factor graph. Crucially, active inference foregrounds an existential imperative of intelligent systems; namely, curiosity or the resolution of uncertainty. This same imperative underwrites belief sharing in ensembles of agents, in which certain aspects (i.e., factors) of each agent's generative world model provide a common ground or frame of reference. Active inference plays a foundational role in this ecology of belief sharing -- leading to a formal account of collective intelligence that rests on shared narratives and goals. We also consider the kinds of communication protocols that must be developed to enable such an ecosystem of intelligences and motivate the development of a shared hyper-spatial modeling language and transaction protocol, as a first -- and key -- step towards such an ecology.

cs.AI↗

Entropy-Maximising Diffusions Satisfy a Parallel Transport Law

We show that the principle of maximum entropy, a variational method appearing in statistical inference, statistical physics, and the analysis of stochastic dynamical systems, admits a geometric description from gauge theory. Using the connection on a principal $G$-bundle, the gradient flow maximising entropy is written in terms of constraint functions which interact with the dynamics of the probabilistic degrees of freedom of a diffusion process. This allows us to describe the point of maximum entropy as parallel transport over the state space. In particular, it is proven that the solubility of the stationary Fokker--Planck equation corresponds to the existence of parallel transport in a particular associated vector bundle, extending classic results due to Jordan--Kinderlehrer--Otto and Markowich--Villani. A reinterpretation of splitting results in stochastic dynamical systems is also suggested. Beyond stochastic analysis, we are able to indicate a collection of geometric structures surrounding energy-based inference in statistics.

math-ph↗

Functorial Statistical Physics: Feynman--Kac Formulae and Information Geometries

The main results of this paper comprise proofs of the following two related facts: (i) the Feynman--Kac formula is a functor $F_*$, namely, between a stochastic differential equation and a dynamical system on a statistical manifold, and (ii) a statistical manifold is a sheaf generated by this functor with a canonical gluing condition. Using a particular locality property for $F_*$, recognised from functorial quantum field theory as a `sewing law,' we then extend our results to the Chapman--Kolmogorov equation {\it via} a time-dependent generalisation of the principle of maximum entropy. This yields a partial formalisation of a variational principle which takes us beyond Feynman--Kac measures driven by Wiener laws. Our construction offers a robust glimpse at a deeper theory which we argue re-imagines time-dependent statistical physics and information geometry alike.

math-ph↗

Formalising the Use of the Activation Function in Neural Inference

We investigate how the activation function can be used to describe neural firing in an abstract way, and in turn, why it works well in artificial neural networks. We discuss how a spike in a biological neurone belongs to a particular universality class of phase transitions in statistical physics. We then show that the artificial neurone is, mathematically, a mean field model of biological neural membrane dynamics, which arises from modelling spiking as a phase transition. This allows us to treat selective neural firing in an abstract way, and formalise the role of the activation function in perceptron learning. The resultant statistical physical model allows us to recover the expressions for some known activation functions as various special cases. Along with deriving this model and specifying the analogous neural case, we analyse the phase transition to understand the physics of neural network learning. Together, it is shown that there is not only a biological meaning, but a physical justification, for the emergence and performance of typical activation functions; implications for neural learning and inference are also discussed.

q-bio.NC↗

A Worked Example of the Bayesian Mechanics of Classical Objects

Bayesian mechanics is a new approach to studying the mathematics and physics of interacting stochastic processes. Here, we provide a worked example of a physical mechanics for classical objects, which derives from a simple application thereof. We summarise the current state of the art of Bayesian mechanics in doing so. We also give a sketch of its connections to classical chaos, owing to a particular $\mathcal{N}=2$ supersymmetry.

physics.class-ph↗

Weak Markov Blankets in High-Dimensional, Sparsely-Coupled Random Dynamical Systems

This paper formulates a notion of high-dimensional random dynamical systems that couple to another system, like an embedding environment, in such a way that each system engages in controlled exchange with the other system. Using the adiabatic theorem and asymptotic arguments about the behaviour of systems with many degrees of freedom, we show that this sort of controlled, but not strictly sparse, coupling structure is ubiquitous in high-dimensional systems. In doing so we prove a conjecture of K Friston.

math-ph↗

Regarding Flows Under the Free Energy Principle: A Comment on "How Particular is the Physics of the Free Energy Principle?" by Aguilera, Millidge, Tschantz, and Buckley

In a recent technical critique of the free energy principle (FEP) due to Aguilera-Millidge-Tschantz-Buckley, it is argued that there are a number of instances where the FEP$\unicode{x2014}$as conventionally written, in terms of densities over states$\unicode{x2014}$is uninformative about the dynamics of many physical systems, and by extension, many 'things.' In this informal comment on their critique, I highlight two points of interest where their derivations are largely correct, but where their arguments are not fatal to the FEP. I go on to conjecture that a path-based formulation of the FEP has key features which restore its explanatory power in broad physical regimes. Correspondingly, this piece takes the position that the application of a state-based formulation of the FEP is inappropriate for certain simple systems, but, that the FEP can be expected to hold regardless.

cond-mat.stat-mech↗

Some Minimal Notes on Notation and Minima: A Comment on "How Particular is the Physics of the Free Energy Principle?" by Aguilera, Millidge, Tschantz, and Buckley

We comment on a technical critique of the free energy principle in linear systems by Aguilera, Millidge, Tschantz, and Buckley, entitled "How Particular is the Physics of the Free Energy Principle?" Aguilera and colleagues identify an ambiguity in the flow of the mode of a system, and we discuss the context for this ambiguity in earlier papers, and their proposal of a more adequate interpretation of these equations. Following that, we discuss a misinterpretation in their treatment of surprisal and variational free energy, especially with respect to their gradients and their minima. In sum, we argue that the results in the target paper are accurate and stand up to rigorous scrutiny; we also highlight that they, nonetheless, do not undermine the FEP.

cond-mat.stat-mech↗