Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Greedy Optimization Provably Wins the Lottery: Logarithmic Number of
  Winning Tickets is Enough   Despite the great success of deep learning, recent works show that large deep
neural networks are often highly redundant and can be significantly reduced in
size. However, the theoretical question of how much we can prune a neural
network given a specified tolerance of accuracy drop is still open. This paper
provides one answer to this question by proposing a greedy optimization based
pruning method. The proposed method has the guarantee that the discrepancy
between the pruned network and the original network decays with exponentially
fast rate w.r.t. the size of the pruned network, under weak assumptions that
apply for most practical settings. Empirically, our method improves prior arts
on pruning various network architectures including ResNet, MobilenetV2/V3 on
ImageNet.

28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
6
The categories of this paper are: astro-ph
33
The categories of this paper are: plasm-ph
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
10
The categories of this paper are: q-bio
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
29
The categories of this paper are: funct-an