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

Trend · papers per month

35810 · Feb 202019922001200920172026
48 results for VGG

Improved VGG networks enhance image classification accuracy.

problem Enhancing image classification accuracy using modified VGG architectures.
method Two improved VGG architectures were created by freezing the first two blocks and applying different dilation rates in the last three blocks.
result Significant out-performance on image classification tasks on CIFAR-10 and CIFAR-100 datasets.

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.

A novel feedbackward approach for semantic segmentation reduces parameter count.

problem Semantic segmentation challenges in terms of model complexity and performance.
method Reverse-direction encoder-decoder architecture using the same network for both encoding and decoding.
result Significantly outperforms other models using only 13 VGG-16 layers, achieving higher IoU scores.

This study evaluates how adversarial examples transfer between different models.

problem Transferability of adversarial examples across models poses a threat to machine learning reliability.
method Evaluation of three adversarial attacks (FGSM, Basic Iterative Method, Carlini & Wagner) on two model classes (VGG and Inception). Use of specific parameters and metrics (L-Infinity clipping, SSIM) for assessment.
result Adversarial examples can be transferred between models, indicating a vulnerability in machine learning systems.

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 ↗

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.

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 ↗

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.

Origami uses SGX enclaves and blinding to protect deep neural network inference privacy.

problem Protecting deep neural network inference privacy in machine learning services.
method Combines enclave execution, cryptographic blinding, and accelerator-based computation.
result Demonstrates improved privacy-preserving inference performance compared to prior work.

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 ↗

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 ↗

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 ↗

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 ↗

Mitigates faults in DNNs by clipping activation values, improving their resilience.

problem Fault tolerance of DNNs in safety-critical applications.
method Clipping activation functions to reduce impact of faulty weights.
result Significant improvement in classification accuracy (68.92%) for fault mitigation.

Study reveals pervasive label errors in test sets, affecting machine learning benchmarks.

problem Label errors in test sets destabilize machine learning benchmarks.
method Identified label errors in 10 common datasets using confident learning algorithms and human validation.
result Lower capacity models may be more useful in real-world datasets with high proportions of erroneously labeled data.

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 ↗

In this work, we investigate Batch Normalization technique and propose its probabilistic interpretation. We propose a probabilistic model and show that Batch Normalization maximazes the lower bound of its marginalized log-likelihood. Then, according to the new probabilistic model, we design an algorithm which acts cons…

2018-02-13abs ↗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 ↗

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.

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 ↗

In this paper we study deep learning-based music source separation, and explore using an alternative loss to the standard spectrogram pixel-level L2 loss for model training. Our main contribution is in demonstrating that adding a high-level feature loss term, extracted from the spectrograms using a VGG net, can improve…

2019-01-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.

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.

With ever-increasing computational demand for deep learning, it is critical to investigate the implications of the numeric representation and precision of DNN model weights and activations on computational efficiency. In this work, we explore unconventional narrow-precision floating-point representations as it relates …

2018-08-07abs ↗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.

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 ↗

A new method speeds up uncertainty estimation in image classification.

problem Fast and accurate uncertainty estimation for robust robotics applications.
method Deep sub-ensembles, where only layers close to the output are ensembled.
result Significant speedup in uncertainty estimation with minimal error and NLL increase.

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 present a filter correlation based model compression approach for deep convolutional neural networks. Our approach iteratively identifies pairs of filters with the largest pairwise correlations and drops one of the filters from each such pair. However, instead of discarding one of the filters from each such pair naï…

2018-11-26abs ↗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 ↗