SearcharxivSearch

arXiv subjects

William T Redman

Publications and source records attributed to William T Redman.

5 recordsLinked to original sources

Local error quantification for Neural Network Differential Equation solvers

Neural networks have been identified as powerful tools for the study of complex systems. A noteworthy example is the neural network differential equation (NN DE) solver, which can provide functional approximations to the solutions of a wide variety of differential equations. Such solvers produce robust functional expressions, are well suited for further manipulations on the quantities of interest (for example, taking derivatives), and capable of leveraging the modern advances in parallelization and computing power. However, there is a lack of work on the role precise error quantification can play in their predictions: usually, the focus is on ambiguous and/or global measures of performance like the loss function and/or obtaining global bounds on the errors associated with the predictions. Precise, local error quantification is seldom possible without external means or outright knowledge of the true solution. We address these concerns in the context of dynamical system NN DE solvers, leveraging learnt information within the NN DE solvers to develop methods that allow them to be more accurate and efficient, while still pursuing an unsupervised approach that does not rely on external tools or data. We achieve this via methods that can precisely estimate NN DE solver prediction errors point-wise, thus allowing the user the capacity for efficient and targeted error correction. We exemplify the utility of our methods by testing them on a nonlinear and a chaotic system each.

cs.LG

Optimizing Neural Networks via Koopman Operator Theory

Koopman operator theory, a powerful framework for discovering the underlying dynamics of nonlinear dynamical systems, was recently shown to be intimately connected with neural network training. In this work, we take the first steps in making use of this connection. As Koopman operator theory is a linear theory, a successful implementation of it in evolving network weights and biases offers the promise of accelerated training, especially in the context of deep networks, where optimization is inherently a non-convex problem. We show that Koopman operator theoretic methods allow for accurate predictions of weights and biases of feedforward, fully connected deep networks over a non-trivial range of training time. During this window, we find that our approach is >10x faster than various gradient descent based methods (e.g. Adam, Adadelta, Adagrad), in line with our complexity analysis. We end by highlighting open questions in this exciting intersection between dynamical systems and neural network theory. We highlight additional methods by which our results could be expanded to broader classes of networks and larger training intervals, which shall be the focus of future work.

cs.NE

Renormalization Group as a Koopman Operator

Koopman operator theory is shown to be directly related to the renormalization group. This observation allows us, with no assumption of translational invariance, to compute the critical exponents $η$ and $δ$, as well as ratios of critical exponents, of classical spin systems from single observables alone. This broadens the types of problems that the renormalization group framework can be applied to and establish universality classes of. In addition, this connection may allow for a new, data-driven way in which to find the renormalization group fixed point(s), and their relevant and irrelevant directions.

cond-mat.stat-mech

An O(n) method of calculating Kendall correlations of spike trains

The ability to record from increasingly large numbers of neurons, and the increasing attention being paid to large scale neural network simulations, demands computationally fast algorithms to compute relevant statistical measures. We present an O(n) algorithm for calculating the Kendall correlation of spike trains, a correlation measure that is becoming especially recognized as an important tool in neuroscience. We show that our method is around 50 times faster than the O (n ln n) method which is a current standard for quickly computing the Kendall correlation. In addition to providing a faster algorithm, we emphasize the role that taking the specific nature of spike trains had on reducing the run time. We imagine that there are many other useful algorithms that can be even more significantly sped up when taking this into consideration. A MATLAB function executing the method described here has been made freely available on-line.

q-bio.QM

A General Approach to Coding in Early Olfactory and Visual Neural Populations

Recent experimental and theoretical work on neural populations belonging to two separate early sensory systems, olfaction and vision, has challenged the notion that the two operate under different computational paradigms by providing evidence for the respective neural population codes having three central, common features: they are highly redundant; they are organized such that information is carried in the identity, and not the relative timing, of the active neurons; they are capable of error correction. We present the first model that captures these three properties in a general manner, making it possible to investigate whether similar structure is present in other population codes. Our model also makes specific predictions about additional, as yet unseen, structure in such codes. If these predictions are found in real data, this would provide new evidence that such population codes are operating under more general computational principles.

q-bio.QM