Research
On-device research index

arXiv research

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.

168,742 papers · 148 categories

Trend · papers per month

2515027521,003 · Jun 202019922001200920172026
48 results for multilayer neural networks

Global convergence of multilayer neural networks proven for any depth.

problem Global convergence of multilayer neural networks in the mean field regime.
method Mean field limit framework, neuronal embedding, bidirectional diversity condition.
result Global convergence for multilayer networks of any depths, including correlated initializations.

Framework captures neural network learning in large-width limit.

problem Understanding learning dynamics in large neural networks.
method Developed a rigorous framework for multilayer neural networks in mean field limit.
result Global convergence guarantees for various network architectures and initializations.

Artificial Neural Networks(ANN) has been phenomenally successful on various pattern recognition tasks. However, the design of neural networks rely heavily on the experience and intuitions of individual developers. In this article, the author introduces a mathematical structure called MLP algebra on the set of all Multi…

2017-01-18abs ↗pdf ↗

This work studies fluctuation in multilayer neural networks using mean field theory.

problem Understanding fluctuation in multilayer neural networks with mean field training.
method Developed a second-order mean field limit to capture fluctuation, demonstrating stability of gradient descent training.
result Gradient descent training in multilayer networks biases towards minimal fluctuation, even after convergence.

Neural NMF discovers hierarchical topics in multilayer data.

problem Detecting latent hierarchical structure in multilayer data.
method Recursive application of nonnegative matrix factorization (NMF) in layers with backpropagation optimization.
result Neural NMF outperforms other hierarchical NMF methods in synthetic and real-world datasets.

New method constructs equivariant neural networks for arbitrary matrix groups.

problem Challenges in constructing equivariant neural networks for complex groups.
method Completely general algorithm for solving equivariant layers of matrix groups.
result Constructs multilayer perceptrons equivariant to multiple groups including O(1,3), O(5), Sp(n), and Rubik's cube group.

SGD with over-param. makes neural net landscape connected, aiding optimization.

problem Spurious local minima and disconnected landscape in neural networks optimization.
method Stochastic Gradient Descent (SGD) with over-parameterization.
result SGD solutions are connected via a piecewise linear path, making the landscape approximately connected.

FVI method calculates bicausal OT with neural networks, outperforming other methods.

problem Computing bicausal optimal transport with adapted coupling structures.
method FVI method using multilayer neural networks to approximate value functions.
result FVI method outperforms linear programming and Sinkhorn methods in scalability.

A recent line of work studies overparametrized neural networks in the "kernel regime," i.e. when the network behaves during training as a kernelized linear predictor, and thus training with gradient descent has the effect of finding the minimum RKHS norm solution. This stands in contrast to other studies which demonstr…

2019-06-13abs ↗pdf ↗

In this work we use Recurrent Neural Networks and Multilayer Perceptrons to predict NYSE, NASDAQ and AMEX stock prices from historical data. We experiment with different architectures and compare data normalization techniques. Then, we leverage those findings to question the efficient-market hypothesis through a formal…

2019-08-28abs ↗pdf ↗

We utilize Wi-Fi communications from smartphones to predict their mobility mode, i.e. walking, biking and driving. Wi-Fi sensors were deployed at four strategic locations in a closed loop on streets in downtown Toronto. Deep neural network (Multilayer Perceptron) along with three decision tree based classifiers (Decisi…

2018-09-16abs ↗pdf ↗

Network data appears in very diverse applications, like biological, social, or sensor networks. Clustering of network nodes into categories or communities has thus become a very common task in machine learning and data mining. Network data comes with some information about the network edges. In some cases, this network…

2018-11-02abs ↗pdf ↗

ALMA improves clustering of multilayer networks.

problem Clustering multilayer networks with distinct layers and communities.
method Alternating minimization algorithm (ALMA) for simultaneous layer partition and community estimation.
result ALMA achieves higher accuracy than TWIST in clustering multilayer networks.

New method constructs multilayer networks from financial data, capturing dependencies across different risk factors.

problem Difficult construction of multilayer networks, neglecting time delays and interdependencies.
method Tucker tensor autoregression for direct multilayer network construction.
result Captures within and between connections, identifies strong interconnections between volumes and prices layers.

We propose a method for simultaneously detecting shared and unshared communities in heterogeneous multilayer weighted and undirected networks. The multilayer network is assumed to follow a generative probabilistic model that takes into account the similarities and dissimilarities between the communities. We make use of…

2018-06-16abs ↗pdf ↗

Study of infinitely deep but narrow neural networks using NTK theory.

problem Analyzing the role of depth in deep learning with overparameterized networks.
method Infinite-depth limit analysis of MLP and CNN using Neural Tangent Kernel (NTK) theory.
result Established trainability guarantee for infinitely deep but narrow neural networks.

In this paper we investigate the supervised backpropagation training of multilayer neural networks from a dynamical systems point of view. We discuss some links with the qualitative theory of differential equations and introduce the overfly algorithm to tackle the local minima problem. Our approach is based on the exis…

2018-07-27abs ↗pdf ↗

A new KAN variant uses sinusoidal activations to approximate functions.

problem Approximating multivariable functions using neural networks.
method Replacing inner and outer functions in Kolmogorov-Arnold representation with weighted sinusoidal functions.
result The new KAN variant outperforms fixed-frequency Fourier transform and achieves comparable performance to MLPs.

Many recent developments in network analysis have focused on multilayer networks, which one can use to encode time-dependent interactions, multiple types of interactions, and other complications that arise in complex systems. Like their monolayer counterparts, multilayer networks in applications often have mesoscale fe…

2019-08-11abs ↗pdf ↗

New proof shows neural networks can memorize training data with high accuracy.

problem Proving neural networks can memorize training data with high accuracy.
method Probabilistic construction exploiting sparsity.
result Proves neural networks with threshold or mixed threshold-ReLU activations can memorize training data.

The power law has been observed in the degree distributions of many biological neural networks. Sparse deep neural networks, which learn an economical representation from the data, resemble biological neural networks in many ways. In this paper, we study if these artificial networks also exhibit properties of the power…

2018-05-04abs ↗pdf ↗

This study compares MLPs and KANs in low-data regimes, finding MLPs with personalized activation functions outperform KANs.

problem Comparing MLPs and KANs in low-data regimes.
method Introduced an effective technique for designing MLPs with unique, parameterized activation functions for each neuron.
result MLPs with personalized activation functions achieve significantly higher predictive accuracy with only a modest increase in parameters, especially in low-data regimes.

Proposes a new algorithm to estimate invariant subspaces across multilayer networks.

problem Estimating invariant subspaces across heterogeneous multiple networks.
method Bias-corrected joint spectral embedding algorithm that recursively calibrates diagonal bias and iteratively updates the subspace estimator.
result Established entrywise subspace perturbation bound and entrywise eigenvector central limit theorem for the algorithm.