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,657 papers · 148 categories

Trend · papers per month

236473709945 · Jun 202019922001200920172026
48 results for three-layer networks

New proof shows neural networks can represent all multivariate functions.

problem Representing all multivariate functions with neural networks.
method Proved that three-layer neural networks can represent both continuous and discontinuous functions.
result Three-layer neural networks can represent all multivariate functions, including discontinuous ones.

Analytical solution found for a three-layer network with a specific activation function.

problem Understanding the power of depth in neural networks.
method Found analytical solutions for a three-layer network with a matrix exponential activation function.
result Analytical solutions for equations involving a three-layer network with a matrix exponential activation function.

Three-layer neural networks learn hierarchical polynomial functions efficiently.

problem Learning hierarchical polynomial functions with three-layer neural networks.
method Layerwise gradient descent on square loss, focusing on feature learning.
result Achieves optimal sample complexity for learning hierarchical polynomials.

Global convergence proved for three-layer neural networks in mean field regime.

problem Optimization efficiency of multilayer neural networks in the mean field regime.
method Developed a rigorous framework for mean field limit of three-layer networks using stochastic gradient descent and neuronal embedding.
result Global convergence guarantee for unregularized feedforward three-layer networks in the mean field regime.

The paper extends mean field results to three-layer neural networks using SGD.

problem Understanding the dynamics of training three-layer neural networks with SGD.
method Extending mean field results from two-layer networks to three-layer networks with two hidden layers, using non-linear partial differential equations.
result The distributions of weights in the two hidden layers are independent.

The study analyzes a three-layer neural network's training dynamics using a functional-space mean-field theory.

problem Understanding the training dynamics of partially-trained three-layer neural networks.
method Generalized mean-field theory to functional spaces, proving convergence and feature learning.
result The training loss of the model decays to zero at a linear rate in the L2L_2 regression setting.

Three-layer networks learn complex hierarchical polynomials of multiple nonlinear features.

problem Understanding how neural networks learn hierarchical features of multiple nonlinear inputs.
method Examine a broad class of functions using three-layer neural networks, showing complete recovery and efficient learning.
result Three-layer neural networks trained via gradient descent can learn hierarchical polynomials of multiple nonlinear features efficiently.

This paper extends stability and generalization analysis of GD for multi-layer NNs.

problem Understanding the generalization of multi-layer neural networks trained by GD.
method Comprehensive stability and generalization analysis of GD for multi-layer NNs, focusing on two-layer and three-layer networks.
result Derives excess risk rates of O(1/n)O(1/\sqrt{n}) for GD in two-layer and three-layer NNs under specific conditions.

Polynomial-time convex optimization for CNNs with ReLU activations.

problem Training Convolutional Neural Networks (CNNs) with ReLU activations.
method Developed a convex analytic framework using semi-infinite duality to formulate equivalent convex optimization problems for CNN architectures.
result Proved that two-layer CNNs can be globally optimized via an 2\ell_2 norm regularized convex program.

Study analyzes error in neural network solving PDEs, providing convergence and error bounds.

problem Error analysis of neural network solving PDEs.
method Three-layer tanh neural network with projected gradient descent (PGD).
result Comprehensive error analysis including approximation, generalization, and optimization errors.

Study clarifies Bayesian generalization error in CBM for 3-layered linear neural networks.

problem Understanding the generalization error in concept bottleneck models.
method Mathematical analysis of Bayesian generalization error and free energy in CBM for 3-layered linear neural networks.
result CBM significantly alters the parameter region and Bayesian generalization error compared to standard models.

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.

This informal technical report details the geometric illustration of decision boundaries for ReLU units in a three layer fully connected neural network. The network is designed and trained to predict pixel intensity from an (x, y) input location. The Geometric Illustration of Neural Networks (GINN) tool was built to vi…

2018-10-02abs ↗pdf ↗

Examines learning efficiency in neural networks and related models.

problem Analyzing efficiency in deep learning models with singular learning coefficients.
method Examined learning coefficients in neural networks and three-layer neural networks with ReLU units.
result Extended results to include Softmax function, providing a broader understanding of learning efficiency.

In this paper, we prove a conjecture published in 1989 and also partially address an open problem announced at the Conference on Learning Theory (COLT) 2015. With no unrealistic assumption, we first prove the following statements for the squared loss function of deep linear neural networks with any depth and any widths…

2016-05-23abs ↗pdf ↗

FluxLayer solves cross-chain liquidity fragmentation for better MEV capture.

problem Cross-chain fragmented liquidity and MEV optimization.
method Three-layer framework integrating settlement, intent, and leverage mechanisms.
result FluxLayer enhances cross-chain MEV by capturing more arbitrage opportunities.

The study explores the compressive power of Boolean threshold autoencoders, finding that seven layers are necessary but three are not.

problem Understanding the compressive limits of Boolean threshold autoencoders.
method Investigation into the minimum number of layers and nodes required for autoencoders to accurately transform binary vectors.
result There exists a seven-layer autoencoder with a logarithmic middle layer size for any set of distinct vectors, but not a three-layer one.

This work explains neural collapse in shallow neural networks and its impact on generalization.

problem Understanding neural collapse in shallow neural networks and its effect on generalization.
method Analysis of two and three-layer ReLU neural networks, focusing on data dimension, sample size, and signal-to-noise ratio.
result Neural collapse occurs in shallow ReLU networks under certain conditions related to data properties and network architecture.

Adversarial attacks against machine learning models are a rather hefty obstacle to our increasing reliance on these models. Due to this, provably robust (certified) machine learning models are a major topic of interest. Lipschitz continuous models present a promising approach to solving this problem. By leveraging the …

2019-04-09abs ↗pdf ↗

3-layer NTK models generalize better than 2-layer models, especially with large input dimensions.

problem Understanding the generalization of overparameterized neural networks.
method Analyzing the 3-layer NTK model's test error and comparing it to 2-layer NTK models.
result 3-layer NTK models have a faster descent in test error with respect to the number of neurons in the second hidden layer.

Deep learning can learn compositional functions more efficiently by breaking them into stages.

problem Understanding why deep learning performs better than shallow models in learning compositional functions.
method Analyzed learnability of compositional target functions using a three-layer fitting model trained with layer-wise spectral estimators.
result Learning compositional functions can be simplified by breaking them into stages, reducing the complexity of the learning problem.

Unified framework reveals regularization mechanism in deep ReLU networks via convex optimization.

problem Understanding the success of deep neural networks.
method Developed a unified framework using convex optimization to reveal regularization mechanisms.
result ReLU networks can be globally optimized via convex programs, enforcing sparsity.

Proves deep networks can learn hierarchical structures efficiently.

problem Understanding how deep networks learn hierarchical structures in data.
method Random Hierarchy Models, gradient-based methods, layerwise training.
result Proves deep networks can efficiently learn hierarchical structures.

Simplifies deep learning scaling analysis without sacrificing accuracy.

problem Interpreting feature learning mechanisms and determining network implicit bias in high-dimensional settings.
method Developed a heuristic approach for predicting data and width scales of feature learning patterns.
result Predictions align with known results and extend to complex architectures.

PCBM improves neural network generalization by partially observing concepts.

problem Decreased generalization performance due to observing all concepts in CBM.
method Developed a theoretical analysis of PCBM's Bayesian generalization error.
result PCBM's generalization error is lower than CBM's due to partial concept observation.

We consider a three-layer Sejnowski machine and show that features learnt via contrastive divergence have a dual representation as patterns in a dense associative memory of order P=4. The latter is known to be able to Hebbian-store an amount of patterns scaling as N^{P-1}, where N denotes the number of constituting bin…

2019-11-28abs ↗pdf ↗

How can neural networks such as ResNet efficiently learn CIFAR-10 with test accuracy more than 96%, while other methods, especially kernel methods, fall relatively behind? Can we more provide theoretical justifications for this gap? Recently, there is an influential line of work relating neural networks to kernels in t…

2019-05-24abs ↗pdf ↗

Paper analyzes SHB method for neural networks, proving stability, connectivity, and global convergence.

problem Theoretical understanding of SHB method for neural networks.
method Mean-field analysis of SHB dynamics related to a partial differential equation.
result SHB method converges to global optimum and exhibits stability and connectivity.

The paper demonstrates the use of the fully convolutional neural network for glioma segmentation on the BraTS 2019 dataset. Three-layers deep encoder-decoder architecture is used along with dense connection at encoder part to propagate the information from coarse layer to deep layers. This architecture is used to train…

2019-09-20abs ↗pdf ↗

A new framework explains GNN predictions by simulating graph structure and feature changes.

problem Lack of transparency in GNN predictions hinders understanding.
method TraP2 framework using a three-layer architecture: Translation, Perturbation, and Paraphrase layers.
result TraP2 achieves 10.2% higher explanation accuracy than state-of-the-art methods.

Study improves chiral photonic metasurface design using neural networks and genetic algorithms.

problem Optimizing chiral photonic metasurfaces for high chiral dichroism and reflectivity.
method Combines neural network and genetic algorithm approaches with improved fitness functions and data augmentation.
result Demonstrates a significant increase in chiral dichroism and reflectivity.

This paper proposes a new approach to Transformers by integrating hierarchical associative memory with MetaFormers.

problem Theoretical framework for Transformers and MLP-Mixers remains underdeveloped.
method Integrating hierarchical associative memory with MetaFormers to create a parallelized MLP-Mixer.
result Symmetry-breaking effects improve the performance of the MLP-Mixer in image recognition tasks.

Neural network solves inverse problem in multiscale mechanics.

problem Identifying elastic properties of random materials.
method Artificial neural networks trained on processed databases.
result Robust identification method validated with synthetic and real data.