Skip to content

Commit 0eb72a6

Browse files
committed
Updated on 2024-09-01
1 parent 2b53ce0 commit 0eb72a6

File tree

2 files changed

+10
-1
lines changed

2 files changed

+10
-1
lines changed

index.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@ <h3>
3939
When?
4040
</h3>
4141
<p>
42-
Last time this was edited was 2024-08-31 (YYYY/MM/DD).
42+
Last time this was edited was 2024-09-01 (YYYY/MM/DD).
4343
</p>
4444
<small><a href="misc.html">misc</a></small>
4545
</body>

papers/list.json

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,14 @@
11
[
22

3+
{
4+
"title": "Max-Affine Spline Insights Into Deep Network Pruning",
5+
"author": "Haoran You et al",
6+
"year": "2022",
7+
"topic": "early-bird, lottery-hypothesis, pruning, low-precision",
8+
"venue": "TMLR",
9+
"description": "The authors make connections from spline-theory (AKA, consdering DNNs as a continuous piecewise affline mapping) and pruning. Basically, they say that pruning removes redundant decision boundaries in layers that are pruned, and that we can compare the decision boundaries of unpruned networks to their pruned counterparts to show this (they have some nice visualizations). They also note that the final decision boundary often does not always depend on existing subdivision lines. Finally, they demonstrate another way of finding EB tickets using this spline formulation.",
10+
"link": "https://arxiv.org/pdf/2101.02338"
11+
},
312
{
413
"title": "Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks",
514
"author": "Haoran You et al",

0 commit comments

Comments
 (0)