Search Space Pruning: A Simple Solution for Better Coreference Resolvers
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringCoreference ResolutionSimilar Papers 제목 키워드 기반
Sub-network Multi-objective Evolutionary Algorithm for Filter Pruning
Filter pruning is a common method to achieve model compression and acceleration in deep neural networks (DNNs).Some research regarded filter pruning as a combinatorial optimization problem and thus used evolutionary algo…
Combinatorial OptimizationEvolutionary AlgorithmsModel CompressionArchtree: on-the-fly tree-structured exploration for latency-aware pruning of deep neural networks
Deep neural networks (DNNs) have become ubiquitous in addressing a number of problems, particularly in computer vision. However, DNN inference is computationally intensive, which can be prohibitive e.g. when considering …
An Once-for-All Budgeted Pruning Framework for ConvNets Considering Input Resolution
We propose an efficient once-for-all budgeted pruning framework (OFARPruning) to find many compact network structures close to winner tickets in the early training stage considering the effect of input resolution during …
Allimage-classificationImage Classificationobject-detection+1GHFP: Gradually Hard Filter Pruning
Filter pruning is widely used to reduce the computation of deep learning, enabling the deployment of Deep Neural Networks (DNNs) in resource-limited devices. Conventional Hard Filter Pruning (HFP) method zeroizes pruned …
Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training
Dynamic Sparse Training (DST) is a rapidly evolving area of research that seeks to optimize the sparse initialization of a neural network by adapting its topology during training. It has been shown that under specific co…