Efficient echo state network with explicit memory performs well on benchmark tasks.
problem Training differentiable neural computers is difficult and time-consuming.
method Echo state network with an explicit memory.
result Echo state network can recognize all regular languages, including those contractive networks cannot.
RNNs compute by warping neural representations over time.
problem Understanding how RNNs perform task computations.
method Developed a Riemannian geometric framework to derive the manifold topology and geometry of RNNs.
result Dynamic warping is a fundamental feature of RNN computations.
Fault-tolerant neural networks inspired by biological error correction codes.
problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.
Synthesizes computational approaches to understand neural timescales.
problem Varying definitions and measurements of neural timescales across studies.
method Reviews data analysis methods, biophysical models, and machine learning models.
result Complements experimental studies with a holistic view of neural timescales.
EPINET improves neural networks with less computation.
problem Efficiently estimating uncertainty in neural networks.
method Introduces EPINET architecture that augments any neural network with minimal additional training.
result EPINET outperforms large ensembles with significantly less computation.
Survey on quantum computing and neural networks.
problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.
Neural networks learn discrete tasks on continuous data via emergent geometry.
problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.
New BNN architectures reduce computational cost for uncertainty quantification.
problem High computational cost in Bayesian neural networks.
method Partial trace-class Bayesian neural networks (PaTraC BNNs).
result Comparable uncertainty quantification with fewer parameters.
Hybrid quantum neural networks predict continuous variables.
problem Predicting continuous variables using quantum computing.
method Quantum classical hybrid neural networks for continuous variable prediction.
result Quantum neural networks outperform classical methods in continuous variable prediction.
Novel algorithms improve efficiency of finite width NTK computation.
problem Efficiency of computing finite width Neural Tangent Kernel (NTK).
method Leveraging neural network structure, propose two novel algorithms.
result Significantly improved efficiency in compute and memory requirements.
New phases identified in neural scaling laws with compute limits.
problem Understanding neural scaling laws under compute constraints.
method Solved neural scaling model with stochastic gradient descent, derived loss curves, analyzed model-parameter-count phases.
result Identified 4 phases (+3 subphases) in data-complexity/target-complexity phase-plane, derived exponents.
Optimized neural networks for Edge TPU achieve high accuracy in real-time image classification.
problem Designing neural networks for hardware accelerators to achieve optimal performance.
method Hardware-aware neural architecture search and model customization for Edge TPU.
result Improved accuracy-latency tradeoff on Pixel 4's Edge TPU compared to existing models.
Graphs of neural networks are represented to preserve symmetry, improving performance across various tasks.
problem Lack of equivariance in neural network representations of other neural networks.
method Represent neural networks as computational graphs and use graph neural networks to preserve permutation symmetry.
result Single model encodes diverse neural architectures, outperforming state-of-the-art methods.
This paper shows neural networks can solve complex graph problems efficiently.
problem Solving exact maximum flow computation and minimum spanning tree problems.
method Introduces Max-Affine Arithmetic Programs and shows equivalence to neural networks.
result Two combinatorial optimization problems can be solved with polynomial-size neural networks.
This work integrates differentiation and integration in Physics-Informed Neural Networks.
problem Solving integro-differential equations and computing integral transforms.
method Augmenting Physics-Informed Neural Networks with automatic integration.
result Solving complex integral transforms and integro-differential equations.
Study on functions computed by deep-layered machines finds same distribution in neural networks and Boolean circuits.
problem Understanding the space of functions computed by deep-layered machines.
method Investigation of Boolean functions on random-layered machines, including neural networks and Boolean circuits.
result The space of functions computed at large depth limit is characterized and the macroscopic entropy of Boolean functions is either monotonically increasing or decreasing with depth.
Quantum Ridgelet Transform speeds up neural network learning.
problem Efficiently finding sparse trainable subnetworks in neural networks.
method Developed a quantum ridgelet transform (QRT) for linear runtime.
result Quantum Ridgelet Transform efficiently finds sparse trainable subnetworks.
Paper introduces a Gaussian Process for operator learning in computational mechanics.
problem Efficient and accurate solutions for large datasets with reliable uncertainty quantification.
method Gaussian Process (GP) embedded in a neural operator framework with stochastic dual descent (SDD) algorithm.
result Improves GP resolution independence and scalability for high-dimensional and non-linear systems.
MSA compares neural representations' intrinsic geometry for better understanding.
problem Existing similarity measures fail to capture subtle distinctions between neural network solutions.
method Metric similarity analysis (MSA) using Riemannian geometry.
result MSA can disentangle features of neural computations and compare nonlinear dynamics.
New metric compares noisy neural trajectories using optimal transport.
problem Existing metrics fail to capture differences in noisy, dynamic neural responses.
method Proposed an optimal transport distance metric for Gaussian processes.
result Metric effectively compares neural dynamics in different systems.
Neural Bootstrapper reduces bootstrapping cost for deep neural networks.
problem Computational burden in bootstrapping deep neural networks.
method Neural Bootstrapper learns to generate bootstrapped neural networks through single model training.
result Neural Bootstrapper outperforms bagging methods with lower computational cost.
Deep neural networks have been successfully deployed in a wide variety of applications including computer vision and speech recognition. However, computational and storage complexity of these models has forced the majority of computations to be performed on high-end computing platforms or on the cloud. To cope with com…
New method accelerates Parallel Tempering using neural samplers.
problem Challenges in sampling from high-dimensional, multimodal distributions.
method Leverages neural samplers to reduce overlap between distributions.
result Improves sample quality and reduces computational cost.
The rise and fall of artificial neural networks is well documented in the scientific literature of both computer science and computational chemistry. Yet almost two decades later, we are now seeing a resurgence of interest in deep learning, a machine learning algorithm based on multilayer neural networks. Within the la…
Enhances neural network dynamics to boost computational capacity.
problem Improving computational capacity of neural networks.
method Introducing Phase Transition Adaptation to drive system dynamics towards edge of stability.
result Consistently achieves enhancement in computational capacity over multiple datasets.
Deep quantum neural networks applied to finance for efficient risk management.
problem Efficiently solving numerical problems in finance, especially risk management.
method Application of deep quantum neural networks to finance, focusing on implied volatilities, option prices, and Greeks.
result Deep quantum neural networks can compute Greeks analytically and efficiently solve financial numerical problems.
Paper reduces neural network complexity for image classification.
problem High computational complexity in deep neural networks.
method Proposes a two-step classification process: coarse-grain and fine-grain.
result Achieves similar accuracy with less computational complexity.
Regularizes persistent homology gradients for neural network integration.
problem Ill-posed inverse problem in computing gradients of persistent homology.
method Regularization through a grouping term to define gradients for larger entities.
result Ensures gradients are defined with respect to larger entities, not individual points.
We provide a proof of backpropagation algorithm in matrix notation.
problem The lack of a full induction proof of backpropagation algorithm in matrix notation.
method We provide a full induction proof of the BP algorithm in matrix notation, situating it in the framework of matrix differential calculus.
result We prove the validity of the backpropagation algorithm in inductive form.
Innovative neural networks reduce memory usage for efficient, accurate segmentation.
problem Efficiently segmenting large graphs with limited memory.
method Iterative neural networks with loops and multiple outputs.
result State-of-the-art semantic segmentation results on demanding datasets.
Improved neural framework for scaling entropic MOT with significant computational gains.
problem High computational overhead in multimarginal optimal transport.
method Neural Entropic MOT (NEMOT) using mini-batch training to reduce complexity.
result Significant speedups and feasibility improvements for multimarginal data.
A new method uses neural tangent kernel to efficiently compute MMD statistic.
problem Efficiently computing Maximum Mean Discrepancy (MMD) statistic with low memory and computational complexity.
method Identifies a connection between neural tangent kernel (NTK) and MMD to develop a computationally and memory-efficient approach.
result The proposed NTK-MMD statistic is validated through numerical experiments on synthetic and real-world datasets.
Different neural network (NN) architectures have different advantages. Convolutional neural networks (CNNs) achieved enormous success in computer vision, while recurrent neural networks (RNNs) gained popularity in speech recognition. It is not known which type of NN architecture is the best fit for classification of co…
Speeds up deep neural networks training by 10x using GPU concurrency.
problem Training deep residual neural networks efficiently.
method Layer-wise parallel training with GPU concurrency and Nonlinear Multigrid.
result 10.2x speedup over traditional techniques.
Revisits orbital minimization for neural operator decomposition.
problem Training neural networks to approximate eigenfunctions of operators.
method Adapts orbital minimization method (OMM) for neural networks.
result Justifies broader applicability of OMM in modern learning pipelines.
New algorithm for efficient prediction intervals in neural networks.
problem Challenges in estimating uncertainty in neural network predictions.
method Applies matrix sketching to approximate Jacobian matrix for efficient uncertainty estimation.
result Produces approximate prediction intervals with competitive performance.
New method certifies neural network function space norms from point evaluations.
problem Certifying neural network function space norms from point evaluations alone.
method Combining interval arithmetic enclosures, adaptive marking/refinement, and quadrature-based aggregation.
result Certified computation of Lp, W1,p, and W2,p norms. Next-gen reservoir computers fail to predict complex processes, highlighting need for better architectures.
problem Predicting complex, non-Markovian processes with recurrent neural networks.
method Lower bound from Fano's inequality and analysis of large probabilistic state machines.
result Next-generation reservoir computers have an error probability at least 60% higher than optimal for highly non-Markovian processes.
New methods improve statistical accuracy of complex models without high computational cost.
problem Improving statistical accuracy of complex models without high computational cost.
method Neural posterior and likelihood estimation (NPE and NLE) methods.
result NPE and NLE methods have similar theoretical guarantees to ABC and BSL, but achieve accuracy at a reduced computational cost.
New method speeds up neural kernel computations for various activations.
problem Inefficient computation of neural kernels for general activations.
method Fast sketching method using truncated Hermite expansion.
result 106x speedup for approximate CNTK computation on CIFAR-10.
Improved neural PDEs trained on augmented data enhance model accuracy and efficiency.
problem Training neural PDEs on limited data to accurately represent complex systems.
method Space-filling sampling of local states to generate augmented training data.
result Data-augmented neural PDEs outperform traditional emulators in accuracy and stability.
In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy. Given a knot with unknown quasipositivity we use these predictions to identify b…
Vertex centrality measures are a multi-purpose analysis tool, commonly used in many application environments to retrieve information and unveil knowledge from the graphs and network structural properties. However, the algorithms of such metrics are expensive in terms of computational resources when running real-time ap…
This study explores training Bayesian neural networks at scale using high-performance computing.
problem Challenges in training Bayesian neural networks at scale due to computational overhead.
method High-performance computing with distributed training, network pruning.
result Pruning up to 80% of the network can reduce inference time by 7.0% without significant accuracy loss.
It is well-known that neural networks are computationally hard to train. On the other hand, in practice, modern day neural networks are trained efficiently using SGD and a variety of tricks that include different activation functions (e.g. ReLU), over-specification (i.e., train networks which are larger than needed), a…
Novel tRSA combines geometry and topology for brain and model analysis.
problem Traditional RSA overlooks topological information in neural representations.
method Topological RSA (tRSA) using nonlinear monotonic transforms.
result Robust model comparisons and novel insights into neural computation.
Neural networks have shown great potential in many applications like speech recognition, drug discovery, image classification, and object detection. Neural network models are inspired by biological neural networks, but they are optimized to perform machine learning tasks on digital computers. The proposed work explores…
Paper presents a neural network method for efficient xVA computation and risk management.
problem High-dimensional counterparty credit risk valuation and management.
method Neural network-based BSDE solver for coupled system of BSDEs for xVA.
result Efficient computation of xVA for high-dimensional portfolios.