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

144287431574 · Jun 202019922001200920172026
48 results for hidden feature layers

Deep Convolutional Neural Networks (CNN) enforces supervised information only at the output layer, and hidden layers are trained by back propagating the prediction error from the output layer without explicit supervision. We propose a supervised feature learning approach, Label Consistent Neural Network, which enforces…

2016-02-03abs ↗pdf ↗

LIFE framework improves model accuracy and interpretability.

problem Achieving high prediction accuracy and interpretability in neural networks.
method Three-step process: subset definition, feature creation, and linear model combination.
result LIFE consistently outperforms other models in prediction accuracy and interpretability.

To infer multilayer deep representations of high-dimensional discrete and nonnegative real vectors, we propose an augmentable gamma belief network (GBN) that factorizes each of its hidden layers into the product of a sparse connection weight matrix and the nonnegative real hidden units of the next layer. The GBN's hidd…

2015-12-09abs ↗pdf ↗

We study how finite Bayesian neural networks adapt their hidden representations.

problem Understanding how finite Bayesian neural networks differ from infinite ones.
method We analyze the asymptotics of learned feature kernels for various network architectures.
result The leading finite-width corrections to feature kernels have a universal form.

It is widely believed that the backpropagation algorithm is essential for learning good feature detectors in early layers of artificial neural networks, so that these detectors are useful for the task performed by the higher layers of that neural network. At the same time, the traditional form of backpropagation is bio…

2018-06-26abs ↗pdf ↗

While neural networks are powerful approximators used to classify or embed data into lower dimensional spaces, they are often regarded as black boxes with uninterpretable features. Here we propose Graph Spectral Regularization for making hidden layers more interpretable without significantly impacting performance on th…

2018-09-30abs ↗pdf ↗

Algorithm predicts performance of learning in multi-layer networks with matrix-valued hidden variables.

problem Signal recovery and learning in multi-layer neural networks with matrix-valued hidden variables.
method Unified approximation algorithm for MAP and MMSE inference, extending ML-VAMP to handle matrix-valued unknowns.
result Performance of ML-Mat-VAMP algorithm can be predicted in a random large-system limit.

Neural networks favor simple features over complex ones, even when complex features are available.

problem Neural networks exhibit a bias towards simple features over complex ones, even when complex features are present.
method Rigorously defined simplicity bias, theoretical and empirical demonstrations, ensemble approach to improve robustness.
result One hidden layer neural networks favor simple features over complex ones, even in the presence of more robust features.

CoulGAT interprets GAT models by analyzing node interactions.

problem Understanding and interpreting the complex interactions within graph attention networks.
method Developed a CoulGAT framework to analyze and interpret GAT model layers and datasets.
result Extracted node-node and node-feature interactions to define a standard model for graph structure.

Generative model initializes 2-layer network weights for small datasets.

problem Approximating functions with 2-layer networks using small datasets and gradient-based training.
method Initialize hidden weights with a learned proposal distribution parameterized as a deep generative model. Refine with gradient-based post-processing and regularization.
result Demonstrates effectiveness of the approach with numerical examples.

Learning and inferring features that generate sensory input is a task continuously performed by cortex. In recent years, novel algorithms and learning rules have been proposed that allow neural network models to learn such features from natural images, written text, audio signals, etc. These networks usually involve de…

2015-06-01abs ↗pdf ↗

A new tensor-based layer reduces neural network dimensions without losing important features.

problem Reducing dimensionality in tensor-structured feature data for deep neural networks.
method TensorProjection layer that projects input tensors into output tensors with reduced dimensions through mode-wise projections.
result The TensorProjection layer outperforms traditional downsampling methods in tasks like medical image classification and segmentation.

We show that a collection of Gaussian mixture models (GMMs) in RnR^{n} can be optimally classified using O(n)O(n) neurons in a neural network with two hidden layers (deep neural network), whereas in contrast, a neural network with a single hidden layer (shallow neural network) would require at least O(exp(n))O(\exp(n)) neurons …

2019-02-15abs ↗pdf ↗

Deep neural networks show some layers better align with data than others.

problem Understanding why some layers in deep neural networks better align with data.
method Introducing the Equilibrium Hypothesis to connect alignment pattern to signal propagation.
result The Equilibrium Hypothesis explains the ascent-descent pattern of alignment in deep neural networks.

Our proposed deeply-supervised nets (DSN) method simultaneously minimizes classification error while making the learning process of hidden layers direct and transparent. We make an attempt to boost the classification performance by studying a new formulation in deep networks. Three aspects in convolutional neural netwo…

2014-09-18abs ↗pdf ↗

To infer a multilayer representation of high-dimensional count vectors, we propose the Poisson gamma belief network (PGBN) that factorizes each of its layers into the product of a connection weight matrix and the nonnegative real hidden units of the next layer. The PGBN's hidden layers are jointly trained with an upwar…

2015-11-06abs ↗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.

Regularized training of an autoencoder typically results in hidden unit biases that take on large negative values. We show that negative biases are a natural result of using a hidden layer whose responsibility is to both represent the input data and act as a selection mechanism that ensures sparsity of the representati…

2014-02-13abs ↗pdf ↗

Traditionally, when generative models of data are developed via deep architectures, greedy layer-wise pre-training is employed. In a well-trained model, the lower layer of the architecture models the data distribution conditional upon the hidden variables, while the higher layers model the hidden distribution prior. Bu…

2014-05-06abs ↗pdf ↗

Self-regularizing RBMs learn optimal hidden units efficiently.

problem Learning optimal number of hidden units in RBMs.
method Grand-canonical extension of RBMs with varying hidden units, using chemical potential to control size.
result Efficiently deduces optimal number of hidden units with small generalization error.

Consider a feedforward neural network ψ:RdRdψ: \mathbb{R}^d\rightarrow \mathbb{R}^d such that ψfψ\approx \nabla f, where f:RdRf:\mathbb{R}^d \rightarrow \mathbb{R} is a smooth function, therefore ψψ must satisfy jψi=iψj\partial_j ψ_i = \partial_i ψ_j pointwise. We prove a theorem that a ψψ network with more than one hidden layer…

2019-10-28abs ↗pdf ↗

Universal MLPs with a single hidden layer can learn any function.

problem Learning on various data structures like sequences, images, sets, and graphs.
method Using group theory, the paper proves the universality of a broad class of equivariant MLPs with a single hidden layer.
result Having a hidden layer on which the group acts regularly is sufficient for universal equivariance (invariance).

Transferability of learned features between tasks can massively reduce the cost of training a neural network on a novel task. We investigate the effect of network width on learned features using activation atlases --- a visualization technique that captures features the entire hidden state responds to, as opposed to in…

2019-09-25abs ↗pdf ↗

Enhanced feature learning using neural networks and kernel methods with improved robustness.

problem Improving feature learning and function estimation in supervised learning.
method Regularised empirical risk minimisation with a new kernel approach.
result The proposed method, BKerNN, converges to the minimal risk with explicit high-probability rates.

Two-layer networks favor simple features, especially in complex datasets.

problem Simplicity bias in neural networks over-reliing on simple features.
method Characterization of two-layer neural networks with small weights and gradient flow.
result Features learned in middle training stages are more useful for out-of-distribution transfer.

This paper presents a new artificial neuron model capable of learning its receptive field in the topological domain of inputs. The model provides adaptive and differentiable local connectivity (plasticity) applicable to any domain. It requires no other tool than the backpropagation algorithm to learn its parameters whi…

2018-08-31abs ↗pdf ↗

A neural network with a single hidden layer can't represent certain multivariable functions.

problem Representing certain multivariable functions with a neural network having only one hidden layer.
method Developed a continuum version of a one-hidden-layer neural network with ReLU activation, and proved constraints on its parameters and second derivative.
result Existence of a smooth binary function that cannot be precisely represented by any such neural network.

Recent results on optimization and generalization properties of neural networks showed that in a simple two-layer network, the alignment of the labels to the eigenvectors of the corresponding Gram matrix determines the convergence of the optimization during training. Such analyses also provide upper bounds on the gener…

2019-05-13abs ↗pdf ↗

Improved DNN calibration without sacrificing accuracy.

problem Poor calibration of over-parametrized DNNs in safety-critical applications.
method Decoupling feature extraction and classification layers, and applying Gaussian priors.
result Significant improvement in model calibration with minimal training cost.

Study explores how neural networks and Transformers learn modular arithmetic with multiple inputs.

problem Understanding how neural networks and Transformers learn modular arithmetic with multiple inputs.
method Analytical characterization of features learned by neural networks and Transformers, focusing on margin maximization and Fourier spectra.
result Neural networks and Transformers require a minimum neuron count of \( m \geq 2^{2k-2} \cdot (p-1) \) to solve modular addition problems with \( k \) inputs and modulus \( p \).

In this paper we propose a function space approach to Representation Learning and the analysis of the representation layers in deep learning architectures. We show how to compute a weak-type Besov smoothness index that quantifies the geometry of the clustering in the feature space. This approach was already applied suc…

2017-10-09abs ↗pdf ↗

Chemical networks outperform spiking neural networks in classification tasks.

problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.

Binary autoencoder with sparse hidden layer preserves information and zero reconstruction error.

problem Preserving information and zero reconstruction error in binary neural networks.
method Binary autoencoder with random binary weights, sparse hidden layer, and varying neuron thresholds.
result Zero reconstruction error for any input with a large hidden layer and varying neuron thresholds.