From f0a23b76429e432955412ec4b819dd07909ea467 Mon Sep 17 00:00:00 2001 From: Dhia naouali Date: Mon, 18 May 2026 02:49:21 +0100 Subject: [PATCH 1/3] add: sub-04 bib, wasn't loaded successfully --- .../assets/bibliography/2026-04-27-sub-04.bib | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 2026/challenge/assets/bibliography/2026-04-27-sub-04.bib diff --git a/2026/challenge/assets/bibliography/2026-04-27-sub-04.bib b/2026/challenge/assets/bibliography/2026-04-27-sub-04.bib new file mode 100644 index 0000000..8c1883a --- /dev/null +++ b/2026/challenge/assets/bibliography/2026-04-27-sub-04.bib @@ -0,0 +1,29 @@ +@inproceedings{kornblith2019similarity, + title = {Similarity of Neural Network Representations Revisited}, + author = {Kornblith, Simon and Norouzi, Mohammad and Lee, Honglak and Hinton, Geoffrey}, + booktitle = {Proceedings of the 36th International Conference on Machine Learning}, + pages = {3519--3529}, + year = {2019}, + editor = {Chaudhuri, Kamalika and Salakhutdinov, Ruslan}, + volume = {97}, + series = {Proceedings of Machine Learning Research}, + publisher = {PMLR} +} + +@inproceedings{nguyen2021wide, + title = {Do Wide and Deep Networks Learn the Same Things? {U}ncovering How Neural Network Representations Vary with Width and Depth}, + author = {Nguyen, Thao and Raghu, Maithra and Kornblith, Simon}, + booktitle = {International Conference on Learning Representations}, + year = {2021} +} + +@article{halko2011finding, + title = {Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions}, + author = {Halko, Nathan and Martinsson, Per-Gunnar and Tropp, Joel A.}, + journal = {SIAM Review}, + volume = {53}, + number = {2}, + pages = {217--288}, + year = {2011}, + publisher = {SIAM} +} From eced44c363753f964522b5c375e9c8e84b7f9148 Mon Sep 17 00:00:00 2001 From: Dhia naouali Date: Mon, 18 May 2026 03:10:51 +0100 Subject: [PATCH 2/3] fix: sub-04 latex --- 2026/challenge/blog/sub-04/index.html | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/2026/challenge/blog/sub-04/index.html b/2026/challenge/blog/sub-04/index.html index 3132918..3be94c7 100644 --- a/2026/challenge/blog/sub-04/index.html +++ b/2026/challenge/blog/sub-04/index.html @@ -294,7 +294,7 @@

2.2 Vectorised CKA Matrix

We use the unbiased HSIC estimator:

-\[\text{HSIC}(K, L) = \frac{\operatorname{tr}(KL) + \dfrac{(\mathbf{1}^\top K \mathbf{1})(\mathbf{1}^\top L \mathbf{1})}{(n-1)(n-2)} - \dfrac{2\,(K\mathbf{1})^\top(L\mathbf{1})}{n-2}}{n(n-3)}\] +\[\text{HSIC}(K, L) = \frac{\mathrm{tr}(KL) + \dfrac{(\mathbf{1}^\top K \mathbf{1})(\mathbf{1}^\top L \mathbf{1})}{(n-1)(n-2)} - \dfrac{2\,(K\mathbf{1})^\top(L\mathbf{1})}{n-2}}{n(n-3)}\] \[\text{CKA}(K, L) = \frac{\text{HSIC}(K, L)}{\sqrt{\text{HSIC}(K,K)\cdot\text{HSIC}(L,L)}}\] @@ -302,7 +302,7 @@

2.2 Vectorised CKA Matrix