Paper: Perfect Alignment May be Poisonous to Graph Contrastive Learning (ICLR-2024)

Reviewer comment (Theory):
In Theorem 2.3, Equations (2) and (3) are a form of infimum. Then, authors say, “However, the right hand side of Inequality (3) should decrease gradually as both ${\delta _{aug}}$ and ${\delta _{{y^ - }}}$ increase, so the negative center similarity would be more likely to be lower.“ This is problematic because a smaller lower bound does not tell us whether the left side of equation 3 is smaller.

Author response:
Indeed, the smaller lower bound does not explicitly tells a smaller left side of equation 3, but it does show that the left side could potentially be lower, so we use the word "more likely", and __we did not make the conclusion only by the theorem__, we perform experiments and those experiments show that negative center similarity is actually decreasing when the augmentation gets stronger. So __we find the negative center similarity might be lower through the theorem, and then perform experiments to show it is actually happening.__

Reviewer comment (Experiments):
The authors say, "Initially, as the dropout rate increases, positive center similarity may decrease sometimes, but downstream performance could be enhanced as negative center similarity decreases much faster." This is problematic. From Figure 1, we can observe that, except for the second subgraph, the performance of the model is basically positively correlated with positive center similarity. The result of the second subgraph may be due to the randomness of the dataset selection, and I suggest that the authors give the average of the results of many different experiments.

Author response:
We think there exists some misunderstanding. __Experiments shown in Figure 1 supports our finding that downstream performs correlates with negative center similarity better.__ When we first increase the magnitude of augmentation, the downstream performance tends to increase or stay steady, but the positive center similarity is mostly decreasing, so it shows no positive correlation. 

In the first subgraph, positive center similarity stays steady with increasing downstream performance it is the decreasing negative center similarity helps the downstream performance. In the second and fourth subgraph, positive center similarity is decreasing, but the downstream performance steadys steady or even increases as the negative center similarity decreases much faster. In the third subgraph the positive center similarity is decreasing even faster than the negative center similarity, which results in the decreasement in downstream performance. __In both four datasets the downstream performance show great negative correlation with negative center similarity and no evident positive correlation with positive center similarity.__ All the results are average of 10 repeated experiments and we have conducted more experiments on other datasets in Appendix C.8, they also show similar tendency.

Reviewer comment (Theory):
In Theorem 2.5, the related equation is a form of infimum. Then, the authors say, "So better generalization correlates with worse positive center similarity." This is problematic because a smaller lower bound does not tell us whether the left side of the equation is smaller.

Author response:
The lower bound does not explicitly tells whether the left side of the equation is smaller, but it means __the model could potentially achieve better performance__, if the lower bound is large, then the model could never achieve good downstream performance, and our theorem tells that with stronger augmentation, the positive center similarity may be decreased, but the generalization might be better, so downstream performance could be increased. __Also emperical results supports our finding, it means the lower bound is not too loose to be invalid, and the lower bound is meaningful because we derive the bound mathematically, the left side is correlated with the right sise.__

Reviewer comment (Theory):
From Theorem 2.5, I think we cannot determine why, as the augmentation becomes stronger, negative center similarity decreases while positive center similarity remains unpredictable. First, when minimizing the NCE loss, the numerator is also changing. So, It's not reasonable to substitute $1 - {\delta _{aug}}$ directly directly for $f{(v_i^1)^T}f(v_i^2)$. Second, even if the right-hand side of the related equation is equal to 0, that doesn't mean the left-hand side of the related equation is equal to 0. Because the right side of the related equation is the lower bound of the left.

Author response:
We think there exists some misunderstanding, **we did not substitute $1-\delta_{aug}$ directly for $f(v_i^1)^Tf(v_i^2)$**, we just want to tell that the numerator $f(v_i^1)^Tf(v_i^2)$ is highly related with the strength of augmentation, a stronger augmentation would make the numerator harder to maximize, and we do not need to focus on how is numerator changing during training, we only want to know the final result (we study how is downstream performance changing with augmentation rather than training). Also we define $\delta_{aug}$ as $\mathbb{E} ||f(v)-f(v^+)||^2$, so $\delta_{aug}$ is actually model related and is also chaning with the model. And the smaller lower bound does not explicitly indicate a better performance, however, as we metioned before, the bound is not that loose and it is meaningful, emperical experiments also show that the model is expressive enough to perform better while the bound being smaller. __We did not give an invalid bound like $accuracy \geq 0$, the model is approaching the bound.__

Reviewer comment (Evaluation):
The improvement in performance is negligible.

Author response:
As we claimed in the paper, the two methods are mainly used to verify our theory, so we design two simple methods. But it does not mean it is not effective, the marginal improvement is mainly caused by causal hyperparameter selection, for example in the information augmentation, we fix the 4 dropout rate, learning rate, weight decay and all other hyperparameters shared with GRACE, and we just set the number to be masked as twice of the number to be unmasked. If we just fine the drop rate from 0.05 to 0.75 (we use the same drop rate for feature/edge drop of two views, but GRACE uses 4 different drop rate), we can get the result below:

|             | Cora                 | CiteSeer             | PubMed               | DBLP                 | Amazon-P             | Amazon_C             |
| :---:       |    :----:            |       :---:          |       :---:          |       :---:          |       :---:          |       :---:          |
| GRACE       | 82.52$\pm$0.75       | 68.44$\pm$0.91       | 84.97$\pm$0.7        | 84.01$\pm$0.34       | 91.17$\pm$0.15       | 86.36$\pm$0.13       |
| GRACE+I     | **83.78$\pm$1.08**   | **72.89$\pm$0.87**   | 84.97$\pm$0.5        | 84.80$\pm$0.47       | 91.64$\pm$0.21       | **87.67$\pm$0.07**   |
| GRACE+S     | 83.61$\pm$0.85       | 72.83$\pm$0.47       | **85.45$\pm$0.5**    | **84.83$\pm$0.38**   | **91.99$\pm$0.17**   | 87.57$\pm$0.12       |
| GCA         | 83.74$\pm$0.78       | 71.09$\pm$0.79       | 85.38$\pm$0.35       | 83.99$\pm$0.46       | 91.67$\pm$0.33       | 86.77$\pm$0.05       |

So our methods achieve great improvement in performance, but to make the mutual information and $\delta_{aug}$ in Figure 2 comparable and show that our methods helps enlarge $\delta_{aug}$ while keep enough information, we use the same drop rate.

Reviewer comment (Theory):
My personal understanding of the two methods proposed in this paper is as follows: (1) From the perspective of information theory, the traditional GCL is based on learning, so that the mutual information between positive samples is as large as possible. This paper proposes that the mutual information between positive samples can be increased directly by data augmentation. (2) From the perspective of spectrum, the traditional GCL smoothen the spectrum through regularization, while this paper proposes that the mutual information between positive samples can be increased directly through data augmentation. Therefore, the motivation presented in this paper is not convincing.

Author response:
**Our paper does not mean mutual information between positive samples can be increased directly by data augmentation**, actually we propose to conduct stronger augmentation and the mutual information is decreasing because of stronger augmentation. Both of the two methods are trying to achieve a trade-off between the mutual information and strength of augmentation, the information augmentation directly protect the important features/edges from being masked and mask more those unimportant ones to prevent $\delta_{aug}$ from dropping sharply. The spectrum augmentation is also intended to improve $\delta_{aug}$ by modify the spectrum of graph. **So our two methods aims to achieve a trade-off between strength of augmentation ($\delta_{aug}$) and the mutual information**, one tries to increase mutual information while preventing $\delta_{aug}$ from dropping, and the other tries to increase $\delta_{aug}$ while prevent the mutual information from dropping.

Reviewer comment (Evaluation):
In the figure 8, we can see that the information augmentation achieves highest positive center similarity. However, it also achieve highest negative similarity, which is not promising. Will that affect the final downstream performance?

Author response:
Actually we find that positive center similarity and negative center similarity changes in similar pattern as shown in Figure 1, so if we want higher positive center similarity the negative center similarity also increases. In result, the infomation augmentation the highest positive and negative center similarity, also you can observe from Figure 8 that the spectrum augmentation also gets both lower positive and negative center similarity. But still they achieve better performance.

__The reason why positive and negative center similarity tends to change in similar pattern might be augmentation overlap.__ Contrastive learning helps intra-class gathering mainly by augmentation overlap, for example, if two different nodes $v_i^0$, $v_j^0$ get the same augmentation $v^+$, then the best solution to contrative learning is $f(v_i^0)=f(v^+)=f(v_j^0)$. But if there is no augmentation overlap, __intra-class nodes are being separated just like inter-class nodes.__ And Saunshi et al. 2022 [1] propose that augmentation overlap is actually rare in contrastive learning. So actually intra-class nodes are treated the same with inter-class nodes, then posotive and negative center similarity changes in similar pattern.

Reviewer comment (Evaluation):
From table 1, we can see that for same base methods, information augmentation performs better on certain datasets and spectrum augmentation performs better on others. If possible, can author discuss about how the data affect the efficiency of the data augmentation?

Author response:
We believe that the for larger datasets, the information could still be well kept even after strong augmentation, so the information augmentation might not be that helpful as in small datasets. And the spectrum augmentation directly modify the spectrum which influence the whole graph, so it might help more significantly in larger graphs. The exception is AD GCL, as it aims to minimize the mutual information by neural network, so it loses lots of useful information and the information augmentation helps more significantly.

Reviewer comment (Theory):
Theorem 2.5 explains why as the augmentation becomes stronger, negative center similarity decreases, (The answer is simultaneously we also want the inner class samples to be closer, and there is a tension between these two objectives. But this is almost always expected regardless of theorem 2.5). This does not mean that pulling closer the augmentations is completely harmful, as there is potentially a sweet point between pulling closer inner class samples and pushing away inter class samples that is optimal to the optimization, which is also (intuitively) dependent on the dimension of the features. I guess maybe the conclusion can be made more interesting and more surprising if it addresses where that sweet point is (if perfect alignment is not the sweet point). It is even better if this sweet point is connected to the value of the threshold $\epsilon$. Currently, $\epsilon$ seems to be a heuristic and is not associated with the positive negative balance problem. Please kindly correct me if I have misunderstood your motivation.

Author response:
Thanks for your suggestion, It is a quite exciting idea. But $\delta_{aug}$ is defined using $\mathbb{E}||f(v^+)-f(v)||^2$, and we assume that when augmentation gets stronger $\delta_{aug}$ increases which means the alignment performance decreases. So we think that perfect alignment may not help downstream performance because only weak augmentation could be adopted (Appendix C.9 directly shows that stronger augmentation leads to worse alignment). So the sweet point correlates with the model, for example if the model is expressive enough to project all augmented samples the same no matter how strong the augmentation is, then the sweet point is exactly perfect alignment as $\mathbb{E}||f(v+)-f(v)||_2^2 = 0$, and this is the implicitly assumption of previous works.

In regular scenes that the model is not so imaginary powerful, alignment performance still decreases with stronger augmentation. The right hand side of Theorem 2.5 is a quadratic function about $\delta_{aug}$, but $\mathrm{Var}(f(v^+)|y) \leq (\delta_{aug}+\sqrt{\mathrm{Var}(f(v_y^0)|y)})^2$, so the best $\delta_{aug}$ is related to  $\mathrm{Var}(f(v_y^0)|y)$ and it requires the class label information which is unknow while pretraining, so the sweet point can not be directly calculated according to our theory.

But the theory could still help model analysing and design. You can gradually change the structure or hyperparameter of a model and observe how is the InfoNCE loss and positive pair difference $\delta_{aug}$ changing to understand how is the model working and why it helps. And if your model performs well on contrastive loss but fails to generalize to downstream tasks, you may need to conduct stronger augmentation while adopting other methods to keep InfoNCE loss steady.

Reviewer comment (Evaluation):
Empirical evidence shows very marginal improvements over the existing baselines, and there is no error bar reported. This concerns me in if the performance is stable and reliable. Please could you report error bars of the algorithms where each algorithm is implemented for several times and the result is averaged over the runs.

Author response:
Our results are actually the average of 10 runs, and it is stable and reliable, we have reported the error bar in Appendix C.10. Also the marginal improvements mainly blame to the hyperparameter, we follow all the hyperparameters of GRACE, but actually the two methods could bear different augmentation with GRACE as the two methods behaves differently when perform augmentation. But to show that our methods could indeed increase $\delta_{aug}$ while preserving information and make the result comparable with GRACE in Figure 2, we use the same drop rate with GRACE. And if we finetune the drop rate from 0.05 to 0.75 (we use the same drop rate for feature/edge drop of two views, but GRACE uses 4 different drop rate), we can get the result below:
|             | Cora                 | CiteSeer             | PubMed               | DBLP                 | Amazon-P             | Amazon_C             |
| :---:       |    :----:            |       :---:          |       :---:          |       :---:          |       :---:          |       :---:          |
| GRACE       | 82.52$\pm$0.75       | 68.44$\pm$0.91       | 84.97$\pm$0.7        | 84.01$\pm$0.34       | 91.17$\pm$0.15       | 86.36$\pm$0.13       |
| GRACE+I     | **83.78$\pm$1.08**   | **72.89$\pm$0.87**   | 84.97$\pm$0.5        | 84.80$\pm$0.47       | 91.64$\pm$0.21       | **87.67$\pm$0.07**   |
| GRACE+S     | 83.61$\pm$0.85       | 72.83$\pm$0.47       | **85.45$\pm$0.5**    | **84.83$\pm$0.38**   | **91.99$\pm$0.17**   | 87.57$\pm$0.12       |
| GCA         | 83.74$\pm$0.78       | 71.09$\pm$0.79       | 85.38$\pm$0.35       | 83.99$\pm$0.46       | 91.67$\pm$0.33       | 86.77$\pm$0.05       |

We can observe that our methods achieve comparable even better performance with GCA, which is also a variant of GRACE.

Reviewer comment (Novelty):
The novelty of the proposed methodology is limited.

Author response:
__Answer__: The two proposed methods are simple, but the information augmentation directly mask more nodes to increase positive pair difference, which is always achieved implicitly by previous works, so the information augmentation reveals the reason why previous works help. And as far as we know, there is no previous work reveal that smoothen the graph spectrum could help contrastive learning, also we use the change of network parameter to judge is the model correctly trained and perform spectrum augmentation based on the status of the model, which is also a novel and effective method.

Reviewer comment (Experiments):
Some details on the experiments are missing. For example, what are the sizes of the datasets/train sets/validation sets/test sets? Are the reported performances tested for statistical significance? These are important details that will help the reader to be more convinced and make a stronger point on the improvement of the performances.

Author response:
__Answer__: Thanks for your suggestion, we use 10% of nodes as train set and others as test setm and similar to GRACE, logistic regression is adopted as classifier. We have added more experiment details in Appendix C.1, and we report the statistical significance in Table 1 it shows that our methods actually improve the downstream performance, also we show the error bar of proposed methods on various datasets in Appendix C.10.

Reviewer comment (Experiments):
Another important detail on the experiments would be to add the run times, so that the reader would be able to see by adding the different augmentation strategies what is the extra computation time that it takes for those improvements?

Author response:
__Answer__: Thanks for your suggestion, we have conducted experiments on the run times (seconds) as shown below and added it in Appendix C.10  
|       | Cora      | CiteSeer  | PubMed    | DBLP    | Amazon-P  | Amazon_C   |  
| :---: |:----:     | :---:     | :---:     |:---:    | :---:     |  :---:     |  
| GRACE | 8.02      | 10.08     | 62.37     |56.89    | 19.05     | 28.71      |  
|GRACE+I| 10.74     | 13.49     | 68.97     |62.82    | 22.67     | 29.61      |  
|GRACE+S| 9.61      | 12.46     | 78.11     |69.44    | 21.13     | 36.94      |  

we can observe that the information augmentation method achieve better performance with only few more time consuming, this is mainly because we do not calculate the importance of features/edges every epoch we only calculate it once and use the same importance for the following training. The spectrum augmentation consumes more time when dealing with large graphs because we explicitly change the spectrum and calculate the new adjacency matrix, which could be replaced by some approximation methods. But to prevent interference from random noise and show smoothing the spectrum works, we use no approximation.

Reviewer comment (Novelty):
Lack of related work. I note that you positioned the related work in the appendix. However, given that you mentioned other works (like Wang et al. 2022b, Saunshi et al. 2022) many times in the paper, an explicit and focused discussion on the differences between your work and others is expected.

Author response:
The main difference between our work and previous ones is that, previous works like Wang et al. 2022b regard perfect alignment and augmentation overlap as the key to success, but Saunshi et al. 2022 argues that augmentation overlap might be rare in contrastive learning. We propose that perfect alignment requires for weak augmentation and it tends to result in bad downstream performance while stronger augmentation leads to better downstream performance but inevitably hinders the alignment performance. So perfect alignment does not imply a good contrastive model.

Reviewer comment (Novelty):
Lack of novelty for proposed augmentations. For the information-theory augmentation, it is quite similar with that proposed in Wei et al. 2023 (GCS). Similarly, the graph-spectrum augmentation is somewhat based on Liu et al. 2022 (GAME). However, both GCS and GAME are not chosen as a baseline in the experiments. As claimed, “this algorithm is primarily intended for theoretical verification”, I think the contribution is more like explaining existing augmentations by theory.

Author response:
The two mathods are indeed trying to explain existing augmentations by theory. But they do not follow existing methods, we propose the information augmentation directly by Corollary 3.1, and the information based methods just use saliency to mearuse the importance of features/edges but the main architecture is totally different with GCS, GCS use the saliency to split the graph into the semantic and environment subgraph and maximize the mutual information between semantic and minimize the mutual information between the environment. But we only use the saliency to indicate the importance and then choose to mask the feature/edge or unmask it by the saliency.

And the GAME rule requires to change high-frequency information while capturing the common low-frequency information by data augmentation. However, what we propose is to smooth the eigenvalues of adjacency matrix. For a graph with adjacency matrix $A$ and two augmentation views $A',A''$, and $\lambda,\lambda',\lambda''$ are the eigenvalue of $A,A',A''$, respectively. The GAME rule requires that for $\lambda_i \in [0,1]$ and $\lambda_j \in [-1,0]$, the augmentation should satisfy $|\lambda_i'-\lambda_i''| > |\lambda_j'-\lambda_j''|$ (Figure 7 of GAME). But we want that for any $\lambda_i$, the augmentation spectrum $\lambda_i' \cdot \lambda_i''$ should be smaller, __so different from GAME, we treat $\lambda_i \in [0,1]$ and $\lambda_j \in [-1,0]$ the same__, and then we use the parameter $\theta$ to gradually lower $\lambda' \cdot \lambda''$ and smooth the spectrum. Also the GAME is actually conclusion of emperical results that low-frequency information matters more in GNN, but for graph with heterophily, high-frequency information is the key. __So GAME is emperical conclusion on some dataset, and our method is derived by theory and could be adopted on various of datasets.__

Also we have conducted experiments on GCS and GAME and the result show that our methods outperform them and the results are shown in Table 1.

Reviewer comment (Experiments):
I have a concern that label-consistency is more hard to guarantee on graphs (unlike images that can be judged manually). Therefore, it is difficult to figure out what kind of graph augmentations is strong enough while not perturbs the labels (i.e. satisfying the basis Assumption 2.1). Considering that, maybe experiments on images are more convincing.

Author response:
Actually the label-consistency is easier to guarantee on graphs. Although the images can be judged manually, it is impossible to actually conducted manual judgement on large datasets, and augmentations like crop can easily change the class label, so the training could be confused. In graph contrastive learning, the augmentation may also change some nodes significantly, but the random augmentation is repeated every epoch, so even for some epoch, a node loses too much information, in other epochs, the node could still be correctly trained, so every node could be correctly trained unless the drop rate is too strong.

To verify this, we first train a well-defined model (the GCL model with best performance) and use the prediction as the true label probability, then we change the drop rate from 0.05 to 0.95, predict the label probability and calculate the KL divergence with true label probability. We show the KL divergence when the drop rate is 45% below and other results could be seen in Appendix C.9
|       | Cora      | CiteSeer  | PubMed    | DBLP    | Amazon-P  | Amazon-C   |
| :---: |:----:     | :---:     | :---:     |:---:    | :---:     |  :---:     |
| 45%   | 0.06      | 0.04      | 0.05      |0.01     | 0.03      | 0.01       |

We can observe that the label is consistent with 45% drop rate, and from Figure 1, we can tell that the downstream performance tends to decrease when drop rate is greater than 0.5, and our theory considers the situation when downstream performance is increasing and GCL methods are not likely to use augmentation stronger than 45% drop, so the label consisteny assumption is easy to hold.

Also we conduct experiments on images, and the result shows that it also aligns with our expectation that downstream performance correlates with inter-class separating stronger. Please refer to answer to Q1 for further discussion.

Reviewer comment (Theory):
In Para3 of Introduction, you said “But it works the same in other fields.” Given that $L_{NCE}$ and theorems in the paper are all based on graph nodes, I wonder if they can generate to other domains like images. It is worth mentioning that graph contrastive learning and vision contrastive learning can not be confused with each other, see [1].

Author response:
Actually the theoretical is not closely related to graph, we only conduct experiments on graph datasets because the magnitude of augmentation on graphs (drop rate of feature/edge) is easy to control and. And we have conducted experiments on images to extend our theory to images. We use the color distortion as data augmentation and change the color distortion strength and observe how the positive/negative center similarity changes as shown below, more results could be seen in Appendix C.8:
| stl10 | 0.2       | 0.4       | 0.6       | 0.8     | 1.0       |
| :---: |:----:     | :---:     | :---:     |:---:    | :---:     |
| PCS   | 0.48      | 0.47      | 0.43      |0.47     | 0.47      |
| NCS   | 0.11      | 0.09      | 0.05      |0.04     | 0.04      |
| Acc   | 0.68      | 0.69      | 0.71      |0.73     | 0.73      |

We can see that contrastive learning in CV also show similar tendency that negative center similarity (NCS) contributes to downstream performance, but different from GCL (graph contrastive learning), VCL (vision contrastive learning) also benefits from increasing positive center similarity (PCS) especially when the color distortion strength (CDS) is stronger. But still, decreasing NCS plays a more important role when CDS is not that strong, so our theory could also be extended to VCL.

Reviewer comment (Evaluation):
Regarding Figure 1, according to Theorem 2.3 and your statement “Therefore, from Inequality (2), …, to be lower.”, it seems like the tendencies of positive and negative center similarity are different, but I did not see such phenomenon in Figure 1.

Author response:
1. Actually we did not mean that the tendencies of positive and negative center similarity are different, we want to tell that the positive center similarity is hard to predict as the $\delta_{aug}$ increases and $\delta_{y^+}$ decreases, but the negative similarity are likely to decrease as $\delta_{aug}$ and $\delta_{y^-}$ both increases. __So we imply that as the augmentation gets stronger and downstream performance getting better, negative center similarity should be decreasing, and the positive center similarity may not be increasing.__ In Figure 1, the __PCS and NCS are mostly decreasing together when at the begining which is consistent with our expectation.__ The PCS and NCS show similar tendency may blame to rare augmentation overlap proposed by Saunshi et al. 2022, without augmentation overlap, the intra-class nodes are treated the same with inter-class nodes, so all nodes are being separated further then PCS and NCS both decreases.

Reviewer comment (Experiments):
Regarding Figure 1, the tendencies are not consistent across 4 datasets. For example, accuracy tendencies on only 2/4 datasets (Cora, DBLP) are similar, i.e. increasing first and then decreasing. Considering the diversity of graph benchmarks, can you show more evidence on other benchmarks besides citation networks?

Author response:
2. Of course, we conduct further experiments on the shopping network (Amazon-Photo and Amazon-Computers), graph with heterophily (Chameleon) and the Coauthor network (Coathor-CS), they all show similar tendency and the results are shown in Appendix C.8. Actually the dataset CiteSeer and PubMed also follows the schema as we set the start point of dropout of 0.05 rather than 0, because 0 means no augmentation and contrastive could learn nothing about the graph. So we also conduct experiments when the drop rate is small in Figure 12. Experimental results show that with the augmentation being stronger the downstream performance is likely to increase at the begining and decreases later. And they both show that the downstream performacne correlates with negative center similarity stronger.

Reviewer comment (Reproducibility):
Regarding Figure 1, more experimental details are needed, including the backbone and data splitting. Especially, no current GCL methods under widely-adopted settings can reach nearly 100% accuracy on these citation benchmarks, as far as I know.

Author response:
3. We use a 2-layer GCN as the backbone and use 10% of data for training and the rest for testing, we provide further experimental detail in Appendix C.1. And we also did not reach nearly 100% accuracy. As we aim to to show the tendency of positive/negative center similarity, __Figure 1 shows the Min-Max Normalized data, so the maximization is 1.__

Reviewer comment (Theory):
According to Corollary 3.1, you said “the best augmentation would be one that maximize the mutual information and positive pair difference”. It seems to be contrary to the InfoMin principle [2], which claims that good views should minimize $I(v_1,v_2)$ while keep the label unchanged (i.e. $I(v_1,y)=I(v_2,y)=I(x,y)$). Can you give some explanations for the difference?

Author response:
The InfoMin principle actually wants to minimize $I(v_1,v_2)$ while preserve as much downstream information as possible. However, downstream tasks is unknown while pretraining, so this is acutally impossible to achieve. Our theory indicates that the augmentation should be strong while preserve as much information as possible, so we do not want to maximize the mutual infomation as stronger augmentation would inevitably leads to smaller mutual information. We want to achieve a trade-off between augmentation and mutual information, and we think the best trade off would be the one satisfying InfoMin which means the augmentation gets rid of all useless information and keeps the downstream related ones. __So InfoMin propose the ideal augmentation which can not be achieved, and we propose a actual target to train a better model.__

Reviewer comment (Writing):
In section 2.3, “Theorem 2.5 explains why as the augmentation becomes stronger, negative center similarity decreases”. Maybe it should be Theorem 2.3.

Author response:
Thanks for your reminder, we have corrected this in the revised vision.