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

1234 · Feb 202019922001200920172026
48 results for VGG-16

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 ↗

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 ↗

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.

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.

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 ↗

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 ↗

Estimating the relative importance of each sample in a training set has important practical and theoretical value, such as in importance sampling or curriculum learning. This kind of focus on individual samples invokes the concept of sample-wise learnability: How easy is it to correctly learn each sample (cf. PAC learn…

2019-01-08abs ↗pdf ↗

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 ↗

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.

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.

Quantizing large Neural Networks (NN) while maintaining the performance is highly desirable for resource-limited devices due to reduced memory and time complexity. It is usually formulated as a constrained optimization problem and optimized via a modified version of gradient descent. In this work, by interpreting the c…

2019-10-18abs ↗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 ↗

New findings challenge the use of flatness measures in neural networks.

problem The validity of flatness measures in assessing generalization in neural networks.
method Analysis of Hessian-based flatness norms and their relation to generalization.
result Solutions with large weights and low loss are often sharper than expected, contradicting flatness measures.

This paper uses deep reinforcement learning to compress CNN models, reducing size and maintaining accuracy.

problem Reducing model size for efficient deployment on limited hardware resources.
method Two-stage compression pipeline: pruning and quantization using deep reinforcement learning.
result Significant reduction in model size with minimal loss in accuracy.

Analyzes symmetries in neural networks to predict learning dynamics.

problem Understanding the dynamics of neural network parameters during training.
method Unified theoretical framework based on symmetries and conservation laws.
result Symmetries impose geometric constraints on gradients and Hessians, leading to conservation laws.

Adversarial perturbations are more effective in Y-channel of YCbCr color space.

problem Vulnerability of deep models to adversarial perturbations in images.
method Proposed ResUpNet defense that removes perturbations only from the Y-channel of YCbCr color space.
result ResUpNet achieves the best balance between defense and maintaining original image accuracy.

Pixel-wise relevance method shows how CNNs classify faces, varying across datasets and tasks.

problem Interpreting black-box CNN face recognition models.
method Layer-wise relevance propagation (LRP) applied to VGG-16 models trained for face recognition.
result Relevance maps are generally stable across random initializations and tasks, but less so across pretraining datasets.

Dynamic pruning during training reduces deep network complexity without significant accuracy loss.

problem High memory and computational requirements of deep networks during training and inference.
method Dynamic pruning of convolutional filters during training, using L1 normalization for optimization.
result L1 normalization-based pruning yields up to 50% reduction in filters with minimal accuracy loss.

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.