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

Trend · papers per month

53107160213 · Jun 202019922001200920172026
48 results for fully-connected layer

The study shows removing fully connected output layers improves efficiency without sacrificing performance.

problem Large number of parameters in fully connected layers for high-category datasets.
method Examined architectures replacing fully connected output layers with fixed layers and compared performance.
result Fixed classifiers offer no additional benefit over removing the output layer and its parameters.

FCC-GAN combines fully connected and convolutional layers for improved GAN performance.

problem Lack of understanding in choosing GAN network architectures.
method Proposes FCC-GAN, a hybrid architecture combining fully connected and convolutional layers.
result FCC-GAN outperforms traditional GAN architectures in terms of learning speed and sample quality.

This article demonstrates that convolutional operation can be converted to matrix multiplication, which has the same calculation way with fully connected layer. The article is helpful for the beginners of the neural network to understand how fully connected layer and the convolutional layer work in the backend. To be c…

2017-12-04abs ↗pdf ↗

In this paper, we propose a novel multi-task learning method based on the deep convolutional network. The proposed deep network has four convolutional layers, three max-pooling layers, and two parallel fully connected layers. To adjust the deep network to multi-task learning problem, we propose to learn a low-rank deep…

2019-04-12abs ↗pdf ↗

A network architecture improves classification performance on various datasets.

problem Improving classification performance on diverse datasets.
method Divide fully connected layer into three levels, learn existing layers, cluster similar classes, reclassify using clustering masks.
result Achieved state-of-the-art performance with an error rate of 11.56% on Cifar-100.

Deep learning improves sparse representation for better classification.

problem Improving classification accuracy using sparse representation.
method A transductive deep learning network combining convolutional autoencoder and fully-connected layers.
result The proposed network achieves better classification results than state-of-the-art SRC methods.

The parameter server architecture is prevalently used for distributed deep learning. Each worker machine in a parameter server system trains the complete model, which leads to a hefty amount of network data transfer between workers and servers. We empirically observe that the data transfer has a non-negligible impact o…

2018-12-27abs ↗pdf ↗

Recently popularized graph neural networks achieve the state-of-the-art accuracy on a number of standard benchmark datasets for graph-based semi-supervised learning, improving significantly over existing approaches. These architectures alternate between a propagation layer that aggregates the hidden states of the local…

2018-03-10abs ↗pdf ↗

The fully connected layers of a deep convolutional neural network typically contain over 90% of the network parameters, and consume the majority of the memory required to store the network parameters. Reducing the number of parameters while preserving essentially the same predictive performance is critically important …

2014-12-22abs ↗pdf ↗

RIFLE improves deep transfer learning by reinitializing fully-connected layers.

problem Limited improvement in transfer learning accuracy with pre-trained models on small datasets.
method Re-Initializing fully-connected layers with random scratch during fine-tuning.
result Significant improvement in deep transfer learning accuracy across various datasets.

Proves DCNNs with expansive convolution are strongly universally consistent.

problem Theoretical consistency of deep convolutional neural networks (DCNNs).
method Empirical risk minimization on DCNNs with expansive convolution (with zero-padding).
result DCNNs with expansive convolution are strongly universally consistent.

Deep Reinforcement Learning (RL) recently emerged as one of the most competitive approaches for learning in sequential decision making problems with fully observable environments, e.g., computer Go. However, very little work has been done in deep RL to handle partially observable environments. We propose a new architec…

2018-04-17abs ↗pdf ↗

Tensor regression networks achieve high compression rate of neural networks while having slight impact on performances. They do so by imposing low tensor rank structure on the weight matrices of fully connected layers. In recent years, tensor regression networks have been investigated from the perspective of their comp…

2017-12-27abs ↗pdf ↗

Recent DNN pruning algorithms have succeeded in reducing the number of parameters in fully connected layers, often with little or no drop in classification accuracy. However, most of the existing pruning schemes either have to be applied during training or require a costly retraining procedure after pruning to regain c…

2018-03-12abs ↗pdf ↗

Deep neural networks can handle high dimensions without losing accuracy.

problem The curse of dimensionality in nonparametric regression.
method Least squares estimates on fully connected neural networks with ReLU activation functions.
result Similar convergence results to deep learning models with sparsity constraints can be achieved without such constraints.

The paper calculates bounds on the local Lipschitz constants of neural network layers.

problem Understanding the Lipschitz constants of neural network layers for robustness analysis.
method Analytical approach to determine upper bounds on local Lipschitz constants of affine-ReLU functions.
result The method produces tighter bounds than the standard conservative bound, especially for small perturbations.

A simple 2-layer linear network outperforms neural networks in learning sparse targets.

problem Learning sparse targets from a sparse input with gradient descent.
method A 2-layer linear network with fully connected input layer and sparse targets.
result The 2-layer linear network achieves a lower expected square loss than neural networks.

Deep neural networks converge to Gaussian mixtures as layer width increases.

problem Understanding the distribution of outputs from deep neural networks.
method Proof and experiments with a simple model showing the convergence of neural network outputs to Gaussian mixtures.
result Neural networks converge to Gaussian mixtures as the width of the last hidden layer increases.

We improve neural network explainability by bypassing batch normalization.

problem Lack of transparency in neural networks.
method Layer-wise Relevance Propagation with a method to include normalization layers.
result Heatmaps are more accurate for convolutional layers with our method.

This paper extends ResNet theory to infinitely deep networks, linking them to diffusion processes.

problem Training infinitely deep ResNets with i.i.d. initializations leads to undesirable properties.
method Introduced doubly infinite ResNets with i.i.d. initializations, linking to diffusion processes.
result The dynamics of quantities of interest converge to deterministic limits in the limit of infinite depth.

This paper presents two unsupervised learning layers (UL layers) for label-free video analysis: one for fully connected layers, and the other for convolutional ones. The proposed UL layers can play two roles: they can be the cost function layer for providing global training signal; meanwhile they can be added to any re…

2017-05-24abs ↗pdf ↗

We demonstrate that a very deep ResNet with stacked modules with one neuron per hidden layer and ReLU activation functions can uniformly approximate any Lebesgue integrable function in dd dimensions, i.e. 1(Rd)\ell_1(\mathbb{R}^d). Because of the identity mapping inherent to ResNets, our network has alternating layers of…

2018-06-28abs ↗pdf ↗

Structured linear substitutions improve both efficiency and accuracy in neural networks.

problem Improving neural network efficiency and accuracy tradeoff.
method Replacing linear components in pointwise convolutions with structured linear decompositions.
result Structured layers provide Pareto-optimal benefits in efficiency/accuracy.

We propose a new notion of `non-linearity' of a network layer with respect to an input batch that is based on its proximity to a linear system, which is reflected in the non-negative rank of the activation matrix. We measure this non-linearity by applying non-negative factorization to the activation matrix. Considering…

2018-10-08abs ↗pdf ↗

Proposes a new deep learning framework for financial stock trading.

problem Lack of effective techniques to fuse multi-channel financial time-series data.
method Inspired by convolution transform learning, SDCF processes channels through 1-D convolutions, fuses outputs with fully-connected layers, and applies softmax classification.
result Proposed framework yields better results than state-of-the-art techniques for stock trading.

Bounds neural network output distribution to Gaussian for random initialization.

problem Quantifying the distribution of randomly initialized deep neural networks.
method Quantitative Gaussian approximation using quadratic Wasserstein distance.
result Explicit inequalities show how network sizes affect Gaussian behavior.

The paper sets information-theoretic lower bounds for neural networks' parameter recovery and excess risk.

problem Establishing sample complexity lower bounds for neural network parameters and excess risk.
method Using information-theoretic tools, the paper proves lower bounds by constructing a generative network.
result Proves information-theoretic lower bounds for exact parameter recovery and positive excess risk.

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.

In our previous work we have shown that resistive cross point devices, so called Resistive Processing Unit (RPU) devices, can provide significant power and speed benefits when training deep fully connected networks as well as convolutional neural networks. In this work, we further extend the RPU concept for training re…

2018-06-01abs ↗pdf ↗

DropCluster clusters features in convolutional layers to prevent overfitting.

problem Dropout's effectiveness in convolutional layers is limited due to feature spatial correlation.
method DropCluster clusters features in convolutional layers and randomly drops clusters during training.
result DropCluster controls overfitting better than other approaches on various datasets.

Deep neural networks are powerful learning models that achieve state-of-the-art performance on many computer vision, speech, and language processing tasks. In this paper, we study a fundamental question that arises when designing deep network architectures: Given a target network architecture can we design a smaller ne…

2017-10-21abs ↗pdf ↗

In the analysis of machine learning models, it is often convenient to assume that the parameters are IID. This assumption is not satisfied when the parameters are updated through training processes such as SGD. A relaxation of the IID condition is a probabilistic symmetry known as exchangeability. We show the sense in …

2018-10-19abs ↗pdf ↗

IRNet improves material property prediction from composition and crystal structure.

problem Predicting material properties from composition and crystal structure.
method Deep residual regression network with individual residual learning.
result IRNet outperforms state-of-the-art machine learning approaches in predicting material properties.

While convolutional neural networks (CNNs) have recently made great strides in supervised classification of data structured on a grid (e.g. images composed of pixel grids), in several interesting datasets, the relations between features can be better represented as a general graph instead of a regular grid. Although re…

2018-10-31abs ↗pdf ↗

The paper addresses differentially private learning for neural networks, focusing on risk bounds and algorithm feasibility.

problem Achieving differentially private learning for neural networks with theoretical guarantees.
method Developed algorithms and theoretical analysis for differentially private stochastic optimization of neural networks.
result Established theoretical bounds for excess population risk in differentially private learning of neural networks.

We study alignment in linear neural networks and its relation to gradient descent.

problem Understanding alignment in linear neural networks and its impact on training.
method Defined alignment for fully connected networks, analyzed alignment under gradient descent, and compared gradient descent to projected gradient descent for layer-constrained networks.
result Gradient descent can converge linearly to a global minimum when alignment is invariant, and alignment is impossible with large datasets in layer-constrained networks.