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

98196294392 · Jun 202019922001200920172026
48 results for pruning techniques

Study examines effects of pruning techniques on deep learning models.

problem Understanding the impact of pruning methods on deep learning model structure and dynamics.
method Investigated differences in connectivity and learning dynamics of pruned models using various iterative pruning techniques.
result Emergence of structure in pruned models through magnitude-based unstructured pruning and weight rewinding.

Pruning is an efficient model compression technique to remove redundancy in the connectivity of deep neural networks (DNNs). Computations using sparse matrices obtained by pruning parameters, however, exhibit vastly different parallelism depending on the index representation scheme. As a result, fine-grained pruning ha…

2019-05-14abs ↗pdf ↗

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.

Pruning is one of the most effective model reduction techniques. Deep networks require massive computation and such models need to be compressed to bring them on edge devices. Most existing pruning techniques are focused on vision-based models like convolutional networks, while text-based models are still evolving. The…

2019-09-10abs ↗pdf ↗

HYDRA prunes robust neural networks to improve both benign and adversarial robustness.

problem Lack of robustness against adversarial attacks and large neural network size in deep learning.
method HYDRA integrates pruning techniques with adversarial training and verifiable robust training objectives.
result HYDRA achieves compressed networks with state-of-the-art benign and robust accuracy.

Gibbs pruning optimizes neural networks by combining physics and regularization.

problem Large neural networks are impractical for many applications.
method Combines statistical physics and stochastic regularization to train and prune networks simultaneously.
result Gibbs pruning achieves state-of-the-art performance on ResNet-56.

Gradient-based training and pruning for radial basis function networks in materials physics.

problem Interpretable and robust machine learning for materials physics problems.
method Gradient-based training and pruning of radial basis function networks with closed-form optimization criteria.
result Pruned models provide compact and interpretable versions of larger models, offering insights into atom-level migration processes.

CPOT prunes deep networks by identifying redundant filters using optimal transport.

problem Redundant filters in deep neural networks make models hard to deploy on resource-limited platforms.
method CPOT uses optimal transport to find the mean of channel distributions, pruning redundant information.
result CPOT outperforms state-of-the-art methods in pruning ResNet models and image-to-image translation tasks.

The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.

problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.

New pruning method for sparse additive models speeds up causal structure learning.

problem Efficiently prune spurious edges from fully-connected DAG induced by estimated topological order.
method Sparse additive models combined with randomized tree embedding and group-wise sparse regression.
result Significantly faster than existing pruning methods while maintaining comparable accuracy.

Gradual pruning reduces inference cost by pruning least important channels during training.

problem Reduction of deep neural network inference cost.
method Gradual channel pruning using feature relevance scores during training.
result Achieved significant model compression with minimal accuracy loss.

Deep neural networks (DNNs) although achieving human-level performance in many domains, have very large model size that hinders their broader applications on edge computing devices. Extensive research work have been conducted on DNN model compression or pruning. However, most of the previous work took heuristic approac…

2018-10-17abs ↗pdf ↗

This paper introduces GLT for better input data representation in BNN and proposes a compact topology with block pruning.

problem Improving input data representation for Binary Neural Networks (BNN).
method Generic Learned Thermometer (GLT) for encoding, block pruning and Knowledge Distillation for compact topology.
result Significant accuracy gains and lightweight fully-binarized models with limited accuracy degradation.

Pruning is a standard technique for removing unnecessary structure from a neural network to reduce its storage footprint, computational demands, or energy consumption. Pruning can reduce the parameter-counts of many state-of-the-art neural networks by an order of magnitude without compromising accuracy, meaning these n…

2019-06-29abs ↗pdf ↗

Performance-aware channel pruning improves CNN on embedded GPUs.

problem Inefficient channel pruning on embedded GPUs leads to performance slowdowns.
method Evaluate higher-level libraries that analyze input characteristics for optimized code generation.
result Performance-aware pruning can achieve significant performance speedups, up to 10x.

This paper analyzes privacy risks in neural network pruning and proposes a defense mechanism.

problem Privacy risks in neural network pruning due to membership inference attacks.
method Investigates the impact of pruning on prediction divergence and proposes a self-attention membership inference attack.
result Proposed defense mechanism mitigates privacy risks while maintaining sparsity and accuracy.

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.

A new pruning method improves neural network efficiency and accuracy.

problem Optimizing neural network efficiency and accuracy through pruning.
method Formulated as a Knapsack Problem, the method optimizes trade-off between neuron importance and computational cost. Channels are pruned while maintaining network structure, and fine-tuned using inner knowledge distillation from parent network.
result State-of-the-art pruning results on ImageNet, CIFAR-10, and CIFAR-100.

Paper proposes a method to prune neural networks, reducing storage and computation costs.

problem Reduction of storage and computational costs for deep neural networks.
method Statistical analysis of component significance using F-statistic-based screening technique.
result Pruned models are highly competitive with state-of-the-art approaches.

New pruning methods improve dynamic sparse training performance.

problem Improving dynamic sparse training performance.
method Design and empirical analysis of pruning criteria.
result Most pruning methods yield similar results, but magnitude-based pruning performs best in low-density regimes.

A new method quantifies feature-map discriminativeness for efficient pruning of deep neural networks.

problem Efficiently pruning deep neural networks to reduce computation while maintaining accuracy.
method Presented a novel mathematical formulation (Discriminant Information, DI) to quantify feature-map discriminativeness, enabling efficient pruning and intra-layer mixed precision quantization.
result Our pruned ResNet50 achieves 44% FLOPs reduction without any Top-1 accuracy loss.

Dynamic sample pruning speeds up spatio-temporal forecasting models.

problem Training deep learning models on large, redundant datasets is computationally expensive.
method Dynamic sample pruning based on real-time learning state.
result Significant acceleration of training speed with improved performance.

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.

ALF reduces network parameters and operations by 70% and 61%, respectively, on embedded hardware.

problem Efficient deployment of deep learning models on resource-constrained hardware.
method Autoencoder-based low-rank filter-sharing technique.
result ALF achieves significant compression with minimal accuracy loss.

New method grows deep networks efficiently by dynamically pruning and growing layers.

problem Training deep networks is computationally expensive and inefficient.
method Structured continuous sparsification starting from a small seed architecture.
result 49.7% inference FLOPs and 47.4% training FLOPs savings with 75.2% top-1 accuracy.

Paper proposes neural network for efficient MIMO channel estimation and pilot reduction.

problem High overhead from pilot transmission in wideband MIMO systems.
method Neural network architecture for frequency-aware pilot design and channel estimation, with pruning technique.
result Neural network outperforms linear minimum mean square error (LMMSE) estimation.

This paper improves Koopman operator approximations by pruning subspaces in RKHS.

problem Improving predictive accuracy of Koopman operator approximations.
method Computes principal angles and vectors in RKHS to prune subspaces.
result Validated approach enhances Koopman operator approximations for large datasets.