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

121242362483 · Jun 202019922001200920172026
48 results for derivative layer

Introduces Causal Energy Minimization to understand Transformer layers.

problem Empirical parameterization of Transformer blocks remains largely unexplored.
method Causal Energy Minimization framework that recasts Transformer layers as optimization steps on conditional energy functions.
result Identifies design space for Transformer layers including weight sharing and energy-based interpretations.

A neural network derived from first principles using MaxEnt.

problem Developing a neural network from first principles.
method Derived a neural network using the principle of Maximum Entropy, with linear dimension-reducing transformations and conditional mean estimators.
result Unified theoretical justification for activation functions like sigmoid, softplus, and relu.

We propose the Limited Multi-Label (LML) projection layer as a new primitive operation for end-to-end learning systems. The LML layer provides a probabilistic way of modeling multi-label predictions limited to having exactly k labels. We derive efficient forward and backward passes for this layer and show how the layer…

2019-06-20abs ↗pdf ↗

The study sets limits on how well nonlinear models can generalize from training data.

problem Understanding the limits of generalization for nonlinear learning models.
method Deriving explicit generalization lower bounds for multi-layer neural networks and linear regression.
result Explicit bounds for general biased estimators in nonlinear networks, showing unacceptable performance for unbiased estimators.

The paper generalizes equivariant neural networks on homogeneous spaces to the non-linear setting.

problem Equivariant neural networks on homogeneous spaces.
method Deriving generalized steerability constraints for non-linear equivariant layers.
result The universality of the derived construction for non-linear equivariant layers.

Multi-layered representation is believed to be the key ingredient of deep neural networks especially in cognitive tasks like computer vision. While non-differentiable models such as gradient boosting decision trees (GBDTs) are the dominant methods for modeling discrete or tabular data, they are hard to incorporate with…

2018-05-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.

Proposes BN layers for neural networks on complex domains, improving training stability and accuracy.

problem Training stability and accuracy issues in neural networks on complex domains.
method Developed Riemannian batch normalization (BN) layers with connections to existing layers.
result Demonstrated improved performance on radar clutter classification, node classification, and action recognition.

CLAPS improves conformal regression by adaptively scaling interval widths based on last-layer Laplace uncertainty.

problem Lack of adaptive interval width scaling in conformal regression for heterogeneous inputs.
method CLAPS uses heteroscedastic last-layer Laplace uncertainty to adaptively scale interval widths, combining aleatoric and epistemic uncertainties.
result CLAPS provides competitive interval efficiency with nominal-level coverage, reducing to aleatoric scaling as epistemic uncertainty decreases.

This work analyzes how bottleneck layers and skip connections affect linear denoising autoencoders' generalization.

problem Understanding the generalization of linear denoising autoencoders in overparameterized regimes.
method Analyzes two-layer linear denoising autoencoders with a bottleneck layer and skip connection, deriving test risk formulas.
result Bottleneck layers introduce an additional complexity measure, while skip connections can mitigate variance.

Two-layer neural networks learn efficiently using kernel methods in mean-field analysis.

problem Feature learning ability of two-layer neural networks in the mean-field regime.
method Mean-field analysis through kernel methods, focusing on dynamics of the first layer's kernel.
result Two-layer neural networks can learn a union of multiple reproducing kernel Hilbert spaces more efficiently than kernel methods.

New bounds for neural networks without loss boundedness assumption.

problem Generalization error bounds for two-layer neural networks.
method Wasserstein distance estimates and moment bounds for stochastic gradient method.
result Dimension-free rate of order O(n1/2)O(n^{-1/2}) for independent test data.

EigenGAN discovers interpretable dimensions in GAN layers for semantic control.

problem Lack of explicit dimensions to control semantic attributes in GAN layers.
method EigenGAN embeds linear subspaces with orthogonal bases into each generator layer, learning eigen-dimensions corresponding to semantic attributes via adversarial training.
result EigenGAN can produce samples with continuous changes corresponding to specific semantic attributes.

Derives formulae for general permutation equivariant layers and presents a second order graph variational encoder.

problem Tackles the limitation of previous equivariant neural networks by considering permutations of matrices.
method Derives formulae for general permutation equivariant layers, including matrix permutations. Presents a second order graph variational encoder.
result Latent distribution of equivariant generative models must be exchangeable.

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 ↗

This paper explains double descent in linear neural networks, identifying new factors.

problem Understanding double descent in linear neural networks.
method Gradient flow derivation and necessary conditions for double descent.
result Singular values of input-output covariance matrix are important for double descent in two-layer models.

New method diagnoses criticality in deep neural networks, improving performance.

problem Improving theoretical understanding and practical initialization of deep neural networks.
method Introducing partial Jacobians and deriving recurrence relations for their norms to analyze criticality.
result Proper stacking of LayerNorm and residual connections leads to a critical architecture for any initialization.

We introduce a guide to help deep learning practitioners understand and manipulate convolutional neural network architectures. The guide clarifies the relationship between various properties (input shape, kernel shape, zero padding, strides and output shape) of convolutional, pooling and transposed convolutional layers…

2016-03-23abs ↗pdf ↗

Channel Pruning, widely used for accelerating Convolutional Neural Networks, is an NP-hard problem due to the inter-layer dependency of channel redundancy. Existing methods generally ignored the above dependency for computation simplicity. To solve the problem, under the Bayesian framework, we here propose a layer-wise…

2018-12-02abs ↗pdf ↗

Gradient descent converges linearly for overparameterized linear networks.

problem Convergence of gradient descent for overparameterized neural networks.
method Local Polyak-Lojasiewicz and Descent Lemma for overparameterized linear models.
result Gradient descent achieves linear convergence for two-layer linear networks under relaxed assumptions.

Improved recommendation systems using multi-layer embeddings reduce model size while maintaining accuracy.

problem Improving model accuracy in recommendation systems while minimizing model size.
method Introducing a multi-layer embedding training (MLET) architecture that trains embeddings via a sequence of linear layers.
result Substantial advantages in model accuracy and memory footprint are achieved with reduced embedding dimensions.

We consider the problem of reconstructing a signal from multi-layered (possibly) non-linear measurements. Using non-rigorous but standard methods from statistical physics we present the Multi-Layer Approximate Message Passing (ML-AMP) algorithm for computing marginal probabilities of the corresponding estimation proble…

2017-01-24abs ↗pdf ↗

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.

Paper proposes an efficient method to optimize neural networks without backpropagation.

problem Computational inefficiency and scalability issues in neural network optimization.
method Derives explicit solutions to optimize neural networks, reducing computational costs.
result Explicit solutions achieve near-optimality and can discover better optima than backpropagation.

A Gaussian restricted Boltzmann machine (GRBM) is a Boltzmann machine defined on a bipartite graph and is an extension of usual restricted Boltzmann machines. A GRBM consists of two different layers: a visible layer composed of continuous visible variables and a hidden layer composed of discrete hidden variables. In th…

2015-12-03abs ↗pdf ↗

Study on VC dimension of GCNNs with input resolution effects.

problem Understanding the generalization capabilities of GCNNs.
method Derived upper and lower bounds for VC dimension, analyzed factors affecting it.
result Extended previous results on VC dimension of GCNNs, providing insights into input resolution dependence.

Derives asymptotic generalization error for large-margin classifiers.

problem Understanding the generalization error of large-margin classifiers.
method Statistical physics replica method for deriving asymptotic expression.
result Establishes phase transition boundary for class separability.

Derives equations for deep learning biases and weights, showing data complexity reduction.

problem Understanding interpretability in supervised learning.
method Gradient flow equations and dynamical truncation of training data.
result Data complexity reduction at an exponential rate with training.

Designs a neural network to reduce training cost by mapping to higher dimensions.

problem High training cost in neural networks.
method Maps feature vectors to higher dimensional space, designs weight matrices to reduce cost, uses convex constraints.
result Reduces training cost as the number of layers increases, without cross-validation.