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

9.2%18.4%27.7%36.9% · May 201919922001200920172026
48 results for VGG network

There are many award-winning pre-trained Convolutional Neural Network (CNN), which have a common phenomenon of increasing depth in convolutional layers. However, I inspect on VGG network, which is one of the famous model submitted to ILSVRC-2014, to show that slight modification in the basic architecture can enhance th…

2019-11-20abs ↗pdf ↗

Improved image classification accuracy on CIFAR-10 dataset.

problem Classifying images from the CIFAR-10 dataset with high accuracy.
method Combining features from manual and deep learning approaches, including VGG16, Inception ResNet v2, HOG, and pixel intensities.
result Achieved 94.6% testing accuracy by combining top 1000 principal components.

The paper calculates upper bounds on ReLU network Lipschitz constants.

problem Determining the maximum perturbation size for robustness of neural networks.
method Analyzing ReLU, affine-ReLU, and max pooling functions; combining results; tracking zero elements; using a computational approach.
result The method produces the largest known bounds on minimum adversarial perturbations for large networks.

A new pruning method reduces neural network computation without retraining.

problem Efficiently reduce neural network computation while maintaining accuracy.
method Structured directional pruning via perturbation orthogonal projection.
result Achieves state-of-the-art pruned accuracy without retraining.

Effective training of neural networks requires much data. In the low-data regime, parameters are underdetermined, and learnt networks generalise poorly. Data Augmentation alleviates this by using existing data more effectively. However standard data augmentation produces only limited plausible alternative data. Given t…

2017-11-12abs ↗pdf ↗

Shallow supervised 1-hidden layer neural networks have a number of favorable properties that make them easier to interpret, analyze, and optimize than their deep counterparts, but lack their representational power. Here we use 1-hidden layer learning problems to sequentially build deep networks layer by layer, which ca…

2018-12-29abs ↗pdf ↗

Deep Neural Networks are quite vulnerable to adversarial perturbations. Current state-of-the-art adversarial attack methods typically require very time consuming hyper-parameter tuning, or require many iterations to solve an optimization based adversarial attack. To address this problem, we present a new family of trus…

2018-12-16abs ↗pdf ↗

Adversarial attack methods have demonstrated the fragility of deep neural networks. Their imperceptible perturbations are frequently able fool classifiers into potentially dangerous misclassifications. We propose a novel way to interpret adversarial perturbations in terms of the effective input signal that classifiers …

2018-03-21abs ↗pdf ↗

This work investigates fundamental questions related to learning features in convolutional neural networks (CNN). Empirical findings across multiple architectures such as VGG, ResNet, Inception, DenseNet and MobileNet indicate that weights near the center of a filter are larger than weights on the outside. Current regu…

2019-05-25abs ↗pdf ↗

We propose a novel approach for semantic segmentation that uses an encoder in the reverse direction to decode. Many semantic segmentation networks adopt a feedforward encoder-decoder architecture. Typically, an input is first downsampled by the encoder to extract high-level semantic features and continues to be fed for…

2019-08-22abs ↗pdf ↗

We explore a recently proposed Variational Dropout technique that provided an elegant Bayesian interpretation to Gaussian Dropout. We extend Variational Dropout to the case when dropout rates are unbounded, propose a way to reduce the variance of the gradient estimator and report first experimental results with individ…

2017-01-19abs ↗pdf ↗

Large CNNs have delivered impressive performance in various computer vision applications. But the storage and computation requirements make it problematic for deploying these models on mobile devices. Recently, tensor decompositions have been used for speeding up CNNs. In this paper, we further develop the tensor decom…

2015-11-19abs ↗pdf ↗

We propose a general framework for neural network compression that is motivated by the Minimum Description Length (MDL) principle. For that we first derive an expression for the entropy of a neural network, which measures its complexity explicitly in terms of its bit-size. Then, we formalize the problem of neural netwo…

2018-12-18abs ↗pdf ↗

The paper sparsifies networks by finding efficient paths in their functional space.

problem Sparsifying neural networks to improve performance and efficiency.
method The authors use the geometry of weight spaces and functional manifolds to find efficient paths (geodesics) in the functional space of neural networks.
result The proposed framework can sparsify networks and improve performance on various tasks.

Deep Neural Networks (DNNs) are usually over-parameterized, causing excessive memory and interconnection cost on the hardware platform. Existing pruning approaches remove secondary parameters at the end of training to reduce the model size; but without exploiting the intrinsic network property, they still require the f…

2019-11-11abs ↗pdf ↗

GOTEX synthesizes textures by optimizing feature distributions using optimal transport.

problem Texture synthesis with control over feature distributions.
method Optimal transport for statistical feature distribution comparison, semi-dual formulation, minimax optimization.
result GOTEX produces high-quality textures with various features, outperforming state-of-the-art methods.

Lookahead pruning extends single-layer optimization to multi-layer, outperforming magnitude-based pruning.

problem Pruning neural networks to reduce computational cost and memory usage.
method Developed a multi-layer optimization approach extending the single-layer optimization of magnitude-based pruning.
result Consistently outperforms magnitude-based pruning on various networks, especially in high sparsity.

Convolutional Neural Networks (CNNs) have proven very effective in image classification and show promise for audio. We use various CNN architectures to classify the soundtracks of a dataset of 70M training videos (5.24 million hours) with 30,871 video-level labels. We examine fully connected Deep Neural Networks (DNNs)…

2016-09-29abs ↗pdf ↗

The early layers of a deep neural net have the fewest parameters, but take up the most computation. In this extended abstract, we propose to only train the hidden layers for a set portion of the training run, freezing them out one-by-one and excluding them from the backward pass. Through experiments on CIFAR, we empiri…

2017-06-15abs ↗pdf ↗

The paper uses CNNs to classify road conditions in real-time.

problem Classifying road conditions in real-time using images from cameras across North America.
method Used state-of-the-art convolutional neural networks (VGG-16, ResNet50, Xception, InceptionResNetV2, EfficientNet-B0 and EfficientNet-B4) to classify images by road condition.
result EfficientNet-B4 framework achieved validation accuracy of 90.6% in real-time map building.

Prunes neural networks at initialization to save resources, achieving high accuracy.

problem Efficiently reducing resource requirements for neural networks at both training and test time.
method Gradient Signal Preservation (GraSP) to prune networks at initialization.
result Pruning 80% of VGG-16 weights on ImageNet with only a 1.6% drop in accuracy.

This study explores training Bayesian neural networks at scale using high-performance computing.

problem Challenges in training Bayesian neural networks at scale due to computational overhead.
method High-performance computing with distributed training, network pruning.
result Pruning up to 80% of the network can reduce inference time by 7.0% without significant accuracy loss.

Gradient amplification boosts deep learning model performance without increasing training time.

problem Vanishing gradients in deep neural networks.
method Gradient amplification approach to prevent vanishing gradients and training strategy to enable/disable across epochs.
result Improves performance of deep learning models with reduced training time.

Training deep neural networks with Stochastic Gradient Descent, or its variants, requires careful choice of both learning rate and batch size. While smaller batch sizes generally converge in fewer training epochs, larger batch sizes offer more parallelism and hence better computational efficiency. We have developed a n…

2017-12-06abs ↗pdf ↗

We analyze the loss landscape and expressiveness of practical deep convolutional neural networks (CNNs) with shared weights and max pooling layers. We show that such CNNs produce linearly independent features at a "wide" layer which has more neurons than the number of training samples. This condition holds e.g. for the…

2017-10-30abs ↗pdf ↗

Select-DC reduces GFLOPS for uncertainty estimation in neural networks.

problem Computational inefficiency in estimating model uncertainty for low-latency applications.
method Select-DC uses a subset of layers to model epistemic uncertainty with MCDC, reducing GFLOPS.
result Significant reduction in GFLOPS required for uncertainty estimation with marginal performance loss.

B-cos transforms improve neural network interpretability by aligning weights.

problem Improving interpretability of deep neural networks.
method Replacing linear transforms with B-cos transforms that promote weight-input alignment during training.
result B-cos transforms lead to highly interpretable and task-relevant linear summaries of neural network computations.

Dirichlet pruning compresses neural networks by removing unimportant units.

problem Compressing large neural network models without sacrificing performance.
method Assigns Dirichlet distribution over network layers' units and uses variational inference to estimate parameters.
result Achieves state-of-the-art compression performance on larger architectures like VGG and ResNet.

New method uses information bottleneck to quantify variable importance in neural networks.

problem Quantifying the importance of individual input variables in neural networks.
method Restricting the flow of information by adding noise to intermediate feature maps.
result Our method outperforms all baselines in five out of six settings.

We propose a Multi-Task Learning (MTL) paradigm based deep neural network architecture, called MTCNet (Multi-Task Crowd Network) for crowd density and count estimation. Crowd count estimation is challenging due to the non-uniform scale variations and the arbitrary perspective of an individual image. The proposed model …

2019-08-23abs ↗pdf ↗