A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Understanding the inductive bias of neural networks is critical to explaining their ability to generalise. Here, for one of the simplest neural networks -- a single-layer perceptron with n input neurons, one output neuron, and no threshold bias term -- we prove that upon random initialisation of weights, the a priori p…
A relation between the conformal anomaly and the logarithmic term in the entanglement entropy is known to exist for CFT's in even dimensions. In odd dimensions the local anomaly and the logarithmic term in the entropy are absent. As was observed recently, there exists a non-trivial integrated anomaly if an odd-dimensio…
We study the word length entropy of automorphisms of residually nilpotent groups, and how the entropy of such group automorphisms relates to the entropy of induced automorphisms on various nilpotent quotients. We show that much like the structure of a nilpotent group is dictated to a large degree by its abelianization,…
We adapt tools from information theory to analyze how an observer comes to synchronize with the hidden states of a finitary, stationary stochastic process. We show that synchronization is determined by both the process's internal organization and by an observer's model of it. We analyze these components using the conve…
Machine learning is usually defined in behaviourist terms, where external validation is the primary mechanism of learning. In this paper, I argue for a more holistic interpretation in which finding more probable, efficient and abstract representations is as central to learning as performance. In other words, machine le…
Feature selection methods are usually evaluated by wrapping specific classifiers and datasets in the evaluation process, resulting very often in unfair comparisons between methods. In this work, we develop a theoretical framework that allows obtaining the true feature ordering of two-dimensional sequential forward feat…
This paper analyzes several interest rates time series from the United Kingdom during the period 1999 to 2014. The analysis is carried out using a pioneering statistical tool in the financial literature: the complexity-entropy causality plane. This representation is able to classify different stochastic and chaotic reg…
Given two networks with the same training loss on a dataset, when would they have drastically different test losses and errors? Better understanding of this question of generalization may improve practical applications of deep networks. In this paper we show that with cross-entropy loss it is surprisingly simple to ind…
Data samples collected for training machine learning models are typically assumed to be independent and identically distributed (iid). Recent research has demonstrated that this assumption can be problematic as it simplifies the manifold of structured data. This has motivated different research areas such as data poiso…
The fastICA method is a popular dimension reduction technique used to reveal patterns in data. Here we show both theoretically and in practice that the approximations used in fastICA can result in patterns not being successfully recognised. We demonstrate this problem using a two-dimensional example where a clear struc…
Suppose an agent is in a (possibly unknown) Markov Decision Process in the absence of a reward signal, what might we hope that an agent can efficiently learn to do? This work studies a broad class of objectives that are defined solely as functions of the state-visitation frequencies that are induced by how the agent be…
New method uses hindsight to make exploration robust in stochastic environments.
problem Exploration in sparse-reward or reward-free environments, especially in stochastic settings.
method Learn representations of the future that capture unpredictable aspects, using them to predict and reward only the predictable parts of the world.
result Improves exploration in Atari games and Montezuma's Revenge, robust to stochasticity.
ML models predict extreme events in the Hénon map with accuracy scaling with system parameters.
problem Predicting extreme events in chaotic dynamical systems like the Hénon map.
method Used machine learning algorithms to analyze and forecast extreme events in the Hénon map.
result The success rate of ML models depends on prediction time, number of training samples, and network size, with scaling relations to the system's topological entropy.
Dirac structures are geometric objects that generalize both Poisson structures and presymplectic structures on manifolds. They naturally appear in the formulation of constrained mechanical systems. In this paper, we show that the evolution equa- tions for nonequilibrium thermodynamics admit an intrinsic formulation in …