Original: A Lower Bound of Hash Codes’ Performance
Revised: A Lower Bound of Hash Codes’ Performance

Original: Abstract
Revised: Abstract

Original: As a crucial approach for compact representation learning, hashing has achieved great success in effectiveness and efficiency.
Revised: As a crucial approach for compact representation learning, hashing has achieved great success in effectiveness and efficiency.

Original: Numerous heuristic Hamming space metric learning objectives are designed to obtain high-quality hash codes.
Revised: Numerous heuristic Hamming space metric learning objectives are designed to obtain high-quality hash codes.

Original: Nevertheless, a theoretical analysis of criteria for learning good hash codes remains largely unexploited.
Revised: Nevertheless, a theoretical analysis of criteria for learning good hash codes remains largely unexploited.

Original: In this paper, we prove that inter-class distinctiveness and intra-class compactness among hash codes determine the lower bound of hash codes’ performance.
Revised: In this paper, we prove that inter-class distinctiveness and intra-class compactness among hash codes determine the lower bound of hash codes’ performance.

Original: Promoting these two characteristics could lift the bound and improve hash learning.
Revised: Promoting these two characteristics could lift the bound and improve hash learning.

Original: We then propose a surrogate model to fully exploit the above objective by estimating the posterior of hash codes and controlling it, which results in a low-bias optimization.
Revised: We then propose a surrogate model to fully exploit the above objective by estimating the posterior of hash codes and controlling it, which results in a low-bias optimization.

Original: Extensive experiments reveal the effectiveness of the proposed method.
Revised: Extensive experiments reveal the effectiveness of the proposed method.

Original: By testing on a series of hash-models, we obtain performance improvements among all of them, with an up to 26 .
Revised: By testing on a series of hash-models, we obtain performance improvements among all of them, with an up to 26 .

Original: 5% increase in mean Average
Revised: 5% increase in mean Average

Original: Precision and an up to 20 .
Revised: Precision and an up to 20 .

Original: 5% increase in accuracy.
Revised: 5% increase in accuracy.

Original: Our code is publicly available at https://github.com/VL-Group/LBHash .
Revised: Our code is publicly available at https://github.com/VL-Group/LBHash .

Original:  Introduction
Revised:  Introduction

Original: The explosive increase of multimedia digital content requires people to develop large-scale processing techniques for effective and efficient multimedia understanding [47, 50, 52, 53].
Revised: The explosive increase of multimedia digital content requires people to develop large-scale processing techniques for effective and efficient multimedia understanding [47, 50, 52, 53].

Original: Meanwhile, growing focus on carbon neutrality initiatives urges researchers to handle above issues with low power and memory consumption [31, 30].
Revised: Meanwhile, growing focus on carbon neutrality initiatives urges researchers to handle above issues with low power and memory consumption [30, 31].

Original: Fortunately, hashing, as a key role in compact representation learning, has demonstrated efficiency and effectiveness over the past few decades towards above demands [22].
Revised: Fortunately, hashing, as a key role in compact representation learning, has demonstrated efficiency and effectiveness over the past few decades towards above demands [22].

Original: By digesting multimedia contents into short binary codes, hashing is able to significantly reduce storage, boost speed and preserve key information [15, 56, 27, 25, 21].
Revised: By digesting multimedia contents into short binary codes, hashing is able to significantly reduce storage, boost speed and preserve key information [15, 21, 25, 27, 56].

Original: In recent years, learning to hash has shown its advantages in alleviating information loss by performing data-dependent Hamming space projection with a non-linear model [32, 46, 24] compared to handcrafted hashing functions.
Revised: In recent years, learning to hash has shown its advantages in alleviating information loss by performing data-dependent Hamming space projection with a non-linear model [24, 32, 46] compared to handcrafted hashing functions.

Original: The purpose of optimizing hash-models is to generate semantically meaningful hash codes for downstream tasks.
Revised: The purpose of optimizing hash-models is to generate semantically meaningful hash codes for downstream tasks.

Original: A practical convention is to increase similarities among codes of the same category, otherwise the opposite.
Revised: A practical convention is to increase similarities among codes of the same category, otherwise the opposite.

Original: Such convention is validated to be effective in many applications [8,41, 26,  40, 48, 33].
Revised: Such convention is validated to be effective in many applications [8, 26, 33, 40, 41, 48].

Original: Practices in current advances still leave two questions which remain primarily unexploited: When should we determine a hash-model for producing good codes, and by what means to achieve this goal?
Revised: Practices in current advances still leave two questions which remain primarily unexploited: When should we determine a hash-model for producing good codes, and by what means to achieve this goal?

Original: Taking a comprehensive study on the above questions is essential since it not only guides us to develop high-performance algorithms in typical hash-based applications but also provides potential possibilities to inspire future works in hash learning.
Revised: Taking a comprehensive study on the above questions is essential since it not only guides us to develop high-performance algorithms in typical hash-based applications but also provides potential possibilities to inspire future works in hash learning.

Original: Although some works [46, 1] try to answer the above questions by building connections between hash codes and common descriptors with domain knowledge, we still seek theoretical guarantees for hash codes’ performance.
Revised: Although some works [1, 46] try to answer the above questions by building connections between hash codes and common descriptors with domain knowledge, we still seek theoretical guarantees for hash codes’ performance.

Original: Similar situations occur in related works [45, 44, 30], where objectives to optimize hash-models are designed by intuitions or heuristics.
Revised: Similar situations occur in related works [30, 44, 45], where objectives to optimize hash-models are designed by intuitions or heuristics.

Original: By formulating correlations among hash codes as inter-class distinctiveness and intra-class compactness, we try to address the above issues and provide a lower bound of hash codes’ performance.
Revised: By formulating correlations among hash codes as inter-class distinctiveness and intra-class compactness, we try to address the above issues and provide a lower bound of hash codes’ performance.

Original: Based on this, we could further derive from them as objectives to lift the lower bound.
Revised: Based on this, we could further derive from them as objectives to lift the lower bound.

Original: Moreover, to effectively train model towards such targets, estimating and further controlling the posterior of hash codes is necessary since bit-level dependence exists in posterior distribution.
Revised: Moreover, to effectively train model towards such targets, estimating and further controlling the posterior of hash codes is necessary since bit-level dependence exists in posterior distribution.

Original: If we neglect this, bias will be introduced during hash-model optimization, hindering performance.
Revised: If we neglect this, bias will be introduced during hash-model optimization, hindering performance.

Original: Summarizing both of them, Our main contributions are summarized as follows:
Revised: Summarizing both of them, Our main contributions are summarized as follows:

Original: 1) To the best of our knowledge, we are the first to formulate a lower bound of hash codes’ performance, which is directly proportional to inter-class distinctiveness and intra-class compactness among codes.
Revised: 1) To the best of our knowledge, we are the first to formulate a lower bound of hash codes’ performance, which is directly proportional to inter-class distinctiveness and intra-class compactness among codes.

Original: Based on this, an objective is further proposed to lift this lower bound and thus enhance performance.
Revised: Based on this, an objective is further proposed to lift this lower bound and thus enhance performance.

Original: A novel posterior estimation over hash codes is proposed to perform low-bias optimization towards the above objective.
Revised: A novel posterior estimation over hash codes is proposed to perform low-bias optimization towards the above objective.

Original: As a non-linear function, it could be utilized for optimizing hash-models via gradient descent.
Revised: As a non-linear function, it could be utilized for optimizing hash-models via gradient descent.

Original: Such plug-and-play component is able to integrate into current hash-models to boost performance.
Revised: Such plug-and-play component is able to integrate into current hash-models to boost performance.

Original: 3) Extensive experiments on three benchmark datasets reveal the effectiveness of the proposed method in two typical tasks.
Revised: 3) Extensive experiments on three benchmark datasets reveal the effectiveness of the proposed method in two typical tasks.

Original: Specifically, we obtain an up to 26 .
Revised: Specifically, we obtain an up to 26 .

Original: 5% increase on mean Average Precision for fast retrieval.
Revised: 5% increase on mean Average Precision for fast retrieval.

Original: We also observe an up to 20 .
Revised: We also observe an up to 20 .

Original: 5% increase on accuracy for hash-based recognition.
Revised: 5% increase on accuracy for hash-based recognition.

Original: The rest of paper is organized as follows: We first briefly review current hashing methods and give preliminaries (Secs. 2 and 3).
Revised: The rest of paper is organized as follows: We first briefly review current hashing methods and give preliminaries (Secs. 2 and 3).

Original: Then, lower bound on hash codes’ performance by inter-class distinctiveness and intra-class compactness is proposed (Sec. 4).
Revised: Then, lower bound on hash codes’ performance by inter-class distinctiveness and intra-class compactness is proposed (Sec. 4).

Original: To fully exploit such guidance, posterior estimation over multivariate Bernoulli distribution is designed for code control (Sec. 5).
Revised: To fully exploit such guidance, posterior estimation over multivariate Bernoulli distribution is designed for code control (Sec. 5).

Original: Experiments (Sec. 6) are then conducted for evaluation.
Revised: Experiments (Sec. 6) are then conducted for evaluation.

Original:  Related Works
Revised:  Related Works

Original: This paper will focus on data-dependent learning-to-hash methods.
Revised: This paper will focus on data-dependent learning-to-hash methods.

Original: Recent advances in building these models are validated to be effective in hash-based recognition and fast retrieval [18, 1, 26, 40, 17].
Revised: Recent advances in building these models are validated to be effective in hash-based recognition and fast retrieval [1, 17, 18, 26, 40].

Original: The typical approach utilizes a projection function to convert raw inputs into compact binary codes and conduct classification or approximate nearest neighbour search on codes for downstream tasks [8, 41, 48].
Revised: The typical approach utilizes a projection function to convert raw inputs into compact binary codes and conduct classification or approximate nearest neighbour search on codes for downstream tasks [8, 41, 48].

Original: As mentioned in introduction, to obtain such a projector, current practices suggest that we formulate it as a Hamming space metric learning problem under binary constraints.
Revised: As mentioned in introduction, to obtain such a projector, current practices suggest that we formulate it as a Hamming space metric learning problem under binary constraints.

Original: Pointwise [49, 21, 29], pairwise [26, 55, 4, 25, 5, 37], triplet [28, 10], listwise [54, 43] and prototype-based [6, 51, 17, 2] objectives are all studied for model training, where the core idea is to adjust similarities among samples from same / different categories.
Revised: Pointwise [21, 29, 49], pairwise [4, 5, 25, 26, 37, 55], triplet [10, 28], listwise [43, 54] and prototype-based [2, 6, 17, 51] objectives are all studied for model training, where the core idea is to adjust similarities among samples from same / different categories.

Original: Besides the above objectives, we should also note that hash-model optimization is NP-hard [1,46, 29, 40].
Revised: Besides the above objectives, we should also note that hash-model optimization is NP-hard [1, 29, 40, 46].

Original: That is caused by the discrete, binarized hash code formulation.
Revised: That is caused by the discrete, binarized hash code formulation.

Original: To tackle the issue, previous works propose many methods that target on following purposes: a) Surrogate functions that approximate hashing by continuous functions, such as tanh [5], Stochastic neuron [9], affine [38] or
Revised: To tackle the issue, previous works propose many methods that target on following purposes: a) Surrogate functions that approximate hashing by continuous functions, such as tanh [5], Stochastic neuron [9], affine [38] or

Original: Straight-Through [3].
Revised: Straight-Through [3].

Original: By adopting these, the discrete hash-model optimization is transformed into approximated but easier one via gradient descent.
Revised: By adopting these, the discrete hash-model optimization is transformed into approximated but easier one via gradient descent.

Original: b) Non-differentiable optimization algorithm design, which focuses on solutions that directly handle discrete inputs, including Coordinate descent [36],
Revised: b) Non-differentiable optimization algorithm design, which focuses on solutions that directly handle discrete inputs, including Coordinate descent [36],

Original: Discrete gradient estimation [13], etc .
Revised: Discrete gradient estimation [13], etc .

Original: There is also bag of tricks which help for stable training.
Revised: There is also bag of tricks which help for stable training.

Original: For example, minimizing quantization error reduces the gap between raw outputs of the model and final hash codes [26], and code-balancing alleviates the problem of producing trivial codes [12].
Revised: For example, minimizing quantization error reduces the gap between raw outputs of the model and final hash codes [26], and code-balancing alleviates the problem of producing trivial codes [12].

Original: Please refer to literature reviews on above works [45, 44, 30] for comprehensive studies on learning to hash.
Revised: Please refer to literature reviews on above works [30, 44, 45] for comprehensive studies on learning to hash.

Original: We could see two issues exist and remain primarily unexploited in above works.
Revised: We could see two issues exist and remain primarily unexploited in above works.

Original: The first is objective design, which is commonly proposed by intuitive and with few theoretical guarantees.
Revised: The first is objective design, which is commonly proposed by intuitive and with few theoretical guarantees.

Original: The second is model optimization, where bit-level dependence is essential in code control but most works neglect it.
Revised: The second is model optimization, where bit-level dependence is essential in code control but most works neglect it.

Original: To tackle these, we would firstly give a lower bound of hash codes’ performance and utilize it as a guidance for hash-model training.
Revised: To tackle these, we would firstly give a lower bound of hash codes’ performance and utilize it as a guidance for hash-model training.

Original: Then, a novel model optimization approach is proposed in a multivariate perspective for low-bias code control.
Revised: Then, a novel model optimization approach is proposed in a multivariate perspective for low-bias code control.

Original:  Preliminaries
Revised:  Preliminaries

Original: Learning to hash performs data-dependent compact representation learning.
Revised: Learning to hash performs data-dependent compact representation learning.

Original: Inputs x ∈ X ⊆ R d are firstly transformed into h -dim real-valued vector ℓ by F θ , a projection parameterized by θ :
Revised: Inputs x ∈ X ⊆ R d are firstly transformed into h -dim real-valued vector ℓ by F θ , a projection parameterized by θ :

Original: R d F θ −−→ R h .
Revised: R d F θ −−→ R h .

Original: And ℓ is then binarized to h bits binary code b ∈ B ⊆
Revised: And ℓ is then binarized to h bits binary code b ∈ B ⊆

Original: H h : x F θ −−→ ℓ bin −−→ b , where bin ( · ) =
Revised: H h : x F θ −−→ ℓ bin −−→ b , where bin ( · ) =

Original: (cid:26) +1 , ( · ) ≥ 0 , − 1 , ( · ) < 0 .
Revised: (cid:26) +1 , ( · ) ≥ 0 , − 1 , ( · ) < 0 .

Original: Typical usage of hash codes.
Revised: Typical usage of hash codes.

Original: Common hashing-based tasks include fast retrieval [19, 39, 27, 2] and recognition [26,  36, 40, 32].
Revised: Common hashing-based tasks include fast retrieval [2, 19, 27, 39] and recognition [26, 32, 36, 40].

Original: For fast retrieval, given a query under the same distribution of X , we convert it into query hash code q and conduct fast approximate nearest neighbour search in B to produce rank list R .
Revised: For fast retrieval, given a query under the same distribution of X , we convert it into query hash code q and conduct fast approximate nearest neighbour search in B to produce rank list R .

Original: In R , samples are organized from nearest to furthest to query.
Revised: In R , samples are organized from nearest to furthest to query.

Original: Correspondingly among all results in R , true positives tp i ∈ TP indicate samples that match with query while others are false positives fp
Revised: Correspondingly among all results in R , true positives tp i ∈ TP indicate samples that match with query while others are false positives fp

Original: i ∈ FP ( i indicates rank).
Revised: i ∈ FP ( i indicates rank).

Original: As a criterion, Average Precision (AP) is commonly adopted to determine how well the retrieved results are.
Revised: As a criterion, Average Precision (AP) is commonly adopted to determine how well the retrieved results are.

Original: It encourages true positives to have higher ranks than false positives: AP = 1 | TP | (cid:80) ∀
Revised: It encourages true positives to have higher ranks than false positives: AP = 1 | TP | (cid:80) ∀

Original: tp i,m ∈ TP P @
Revised: tp i,m ∈ TP P @

Original: i , where P @
Revised: i , where P @

Original: i is the rank- i precision.
Revised: i is the rank- i precision.

Original: As for hash-based recognition, since current works formulate it as a variant of retrieval, we could still adopt
Revised: As for hash-based recognition, since current works formulate it as a variant of retrieval, we could still adopt

Original: AP as a criterion to indicate performance.
Revised: AP as a criterion to indicate performance.

Original: The detailed explanation is placed in Supp.
Revised: The detailed explanation is placed in Supp.

Original: Sec. C.
Revised: Sec. C.

Original:  Lower Bound by Inter-Class Distinctiveness and Intra-Class Compactness
Revised:  Lower Bound by Inter-Class Distinctiveness and Intra-Class Compactness

Original: We start at an arbitrary rank list for studying the characteristics of codes in the above scenarios.
Revised: We start at an arbitrary rank list for studying the characteristics of codes in the above scenarios.

Original: To calculate AP easily, we first introduce mis-rank that indicates how many false positives take higher places than true positives.
Revised: To calculate AP easily, we first introduce mis-rank that indicates how many false positives take higher places than true positives.

Original: We refer readers to Supp.
Revised: We refer readers to Supp.

Original: Secs.
Revised: Secs.

Original: A and B for detailed description and proof.
Revised: A and B for detailed description and proof.

Original: Definition.
Revised: Definition.

Original: Mis-rank m indicates how many false positives have higher ranks than a true positive, e.g ., tp i,m is at rank i , meanwhile m = | (cid:8) d ( q , fp ) <
Revised: Mis-rank m indicates how many false positives have higher ranks than a true positive, e.g ., tp i,m is at rank i , meanwhile m = | (cid:8) d ( q , fp ) <

Original: d (cid:0) q , tp i,m (cid:1)(cid:9) | , where d ( q , · ) is distance between q and a sample, and | · | is number of elements in set.
Revised: d (cid:0) q , tp i,m (cid:1)(cid:9) | , where d ( q , · ) is distance between q and a sample, and | · | is number of elements in set.

Original: Remark.
Revised: Remark.

Original: The rank- i precision P @
Revised: The rank- i precision P @

Original: i is derived to be ( i − m ) / i .
Revised: i is derived to be ( i − m ) / i .

Original: Then, average precision could be derived as:
Revised: Then, average precision could be derived as:

Original: [Equation]
Revised: [Equation]

Original: for all true positives in rank list.
Revised: for all true positives in rank list.

Original: This is because the rank- i precision P @
Revised: This is because the rank- i precision P @

Original: i for any true positive tp
Revised: i for any true positive tp

Original: i,m equals to ( i − m ) / i .
Revised: i,m equals to ( i − m ) / i .

Original: From the derivation, we could immediately obtain that AP increases iff m decreases.
Revised: From the derivation, we could immediately obtain that AP increases iff m decreases.

Original: Therefore, now we could focus on how to reduce m to thereby increase average precision.
Revised: Therefore, now we could focus on how to reduce m to thereby increase average precision.

Original: Noticed that the value of m is highly related to two distances, d ( q , fp ) and d ( q , tp ) , the following proposition is raised:
Revised: Noticed that the value of m is highly related to two distances, d ( q , fp ) and d ( q , tp ) , the following proposition is raised:

Original: Proposition.
Revised: Proposition.

Original: [Equation]
Revised: [Equation]

Original: where · denotes upper bound.
Revised: where · denotes upper bound.

Original: Correspondingly,
Revised: Correspondingly,

Original: [Equation]
Revised: [Equation]

Original: where · denotes lower bound.
Revised: where · denotes lower bound.

Original: If inputs x j have associated labels y j , the above studies are able to be further generalized.
Revised: If inputs x j have associated labels y j , the above studies are able to be further generalized.

Original: Class-wise centers, inter-class distinctiveness and intra-class compactness are introduced to formulate our final lower-bound of hash codes’ performance.
Revised: Class-wise centers, inter-class distinctiveness and intra-class compactness are introduced to formulate our final lower-bound of hash codes’ performance.

Original: Definition.
Revised: Definition.

Original: Center c c ∈ C is a representative hash code of a specific class c :
Revised: Center c c ∈ C is a representative hash code of a specific class c :

Original: [Equation]
Revised: [Equation]

Original: where b j is the j -th sample in set B and y j is the label of b j .
Revised: where b j is the j -th sample in set B and y j is the label of b j .

Original: Definition.
Revised: Definition.

Original: Inter-class distinctiveness is min D inter where D inter is a set that measures distances between all centers over C : (cid:8) d (cid:0) c j , c k (cid:1)
Revised: Inter-class distinctiveness is min D inter where D inter is a set that measures distances between all centers over C : (cid:8) d (cid:0) c j , c k (cid:1)

Original: | ∀ c j , c k ∈ C (cid:9) .
Revised: | ∀ c j , c k ∈ C (cid:9) .

Original: In contrast, intra-class compactness is 1 / max D intra , where D intra = (cid:8) d (cid:0) b j , c c (cid:1) | ∀ y j = c (cid:9) measures the distances among samples of the same class to their corresponding center.
Revised: In contrast, intra-class compactness is 1 / max D intra , where D intra = (cid:8) d (cid:0) b j , c c (cid:1) | ∀ y j = c (cid:9) measures the distances among samples of the same class to their corresponding center.

Original: Combining above propositions and definitions, we could reach:
Revised: Combining above propositions and definitions, we could reach:

Original: Proposition.
Revised: Proposition.

Original: [Equation]
Revised: [Equation]

Original: This proposition reveals how AP is affected by the above two inter- and intra- factors.
Revised: This proposition reveals how AP is affected by the above two inter- and intra- factors.

Original: Actually, it could cover common scenarios as a criterion of hash codes’ performance, e.g ., fast retrieval and recognition, which will be explained in supplementary materials.
Revised: Actually, it could cover common scenarios as a criterion of hash codes’ performance, e.g ., fast retrieval and recognition, which will be explained in supplementary materials.

Original: Intuitively, lifting this lower bound would enhance performance, formulating the following objective:
Revised: Intuitively, lifting this lower bound would enhance performance, formulating the following objective:

Original: [Equation]
Revised: [Equation]

Original: Inspired by [51], we give a specific solution to implement Eqs.
Revised: Inspired by [51], we give a specific solution to implement Eqs.

Original: (2) and (3) under supervised hashing by firstly defining distance maximized class-specific centers and then shrinking hash codes to their corresponding centers.
Revised: (2) and (3) under supervised hashing by firstly defining distance maximized class-specific centers and then shrinking hash codes to their corresponding centers.

Original: We will validate the effectiveness of such a solution in experiments.
Revised: We will validate the effectiveness of such a solution in experiments.

Original: It is worth noting that achieving above goal is an open topic, including unsupervised or other complex scenarios, which we leave for future study.
Revised: It is worth noting that achieving above goal is an open topic, including unsupervised or other complex scenarios, which we leave for future study.

Original: Next, to optimize hash-models with the above supervision, we introduce posterior estimation over hash codes and then control it.
Revised: Next, to optimize hash-models with the above supervision, we introduce posterior estimation over hash codes and then control it.

Original:  Posterior Estimation for Code Control
Revised:  Posterior Estimation for Code Control

Original: It is essentially hard to minimize the distance between a hash code and a target to achieve Eq.
Revised: It is essentially hard to minimize the distance between a hash code and a target to achieve Eq.

Original: (3) for two reasons.
Revised: (3) for two reasons.

Original: Firstly, the posterior distribution of B given inputs X is formulated to be under multivariate Bernoulli distribution: p ( B | X ) ∼ MVB .
Revised: Firstly, the posterior distribution of B given inputs X is formulated to be under multivariate Bernoulli distribution: p ( B | X ) ∼ MVB .

Original: If we do not take correlations among different variables into account, optimization on B is biased.
Revised: If we do not take correlations among different variables into account, optimization on B is biased.

Original: Secondly, dealing with hash codes is a {− 1 , +1 } discrete optimization, which is not trivial to handle.
Revised: Secondly, dealing with hash codes is a {− 1 , +1 } discrete optimization, which is not trivial to handle.

Original: Therefore, we try to organize Eq.
Revised: Therefore, we try to organize Eq.

Original: (3) as a
Revised: (3) as a

Original: Maximum Likelihood Estimation (MLE) to tackle the above issues.
Revised: Maximum Likelihood Estimation (MLE) to tackle the above issues.

Original: Considering the definition of
Revised: Considering the definition of

Original: Hamming distance between an arbitrary hash code b and its target t :
Revised: Hamming distance between an arbitrary hash code b and its target t :

Original: [Equation]
Revised: [Equation]

Original: where 1 is the characteristic function and ( · ) i indicates value on the i -th dimension.
Revised: where 1 is the characteristic function and ( · ) i indicates value on the i -th dimension.

Original: Since Hamming distance measures how many bits are different between two codes, the probability of d ( b , t ) =
Revised: Since Hamming distance measures how many bits are different between two codes, the probability of d ( b , t ) =

Original: δ can be formulated as:
Revised: δ can be formulated as:

Original: [Equation]
Revised: [Equation]

Original: Therefore, b and t have distance δ iff p ( d ( b , t ) = δ ) is maximized.
Revised: Therefore, b and t have distance δ iff p ( d ( b , t ) = δ ) is maximized.

Original: However, to precisely calculate it is difficult, since it involves the joint probability of b .
Revised: However, to precisely calculate it is difficult, since it involves the joint probability of b .

Original: Therefore, we try to estimate all joint probabilities by adopting a surrogate model P π parameterized by π to perform estimation:
Revised: Therefore, we try to estimate all joint probabilities by adopting a surrogate model P π parameterized by π to perform estimation:

Original: [Equation]
Revised: [Equation]

Original: where o is the probabilities of a Categorical distribution p ( O | X ) (cid:98)
Revised: where o is the probabilities of a Categorical distribution p ( O | X ) (cid:98)

Original: = p ( B | X ) , which contains 2 h entries.
Revised: = p ( B | X ) , which contains 2 h entries.

Original: Each entry of o estimates one of a specific joint probability by feeding ℓ into P π :
Revised: Each entry of o estimates one of a specific joint probability by feeding ℓ into P π :

Original: [Equation]
Revised: [Equation]

Original: where ι is the h bits binary representation of i .
Revised: where ι is the h bits binary representation of i .

Original: For example, o 3 = p ( b = ( -1-1+1+1 )) when h = 4 .
Revised: For example, o 3 = p ( b = ( -1-1+1+1 )) when h = 4 .

Original: To train P π , we perform Maximum Likelihood Estimation (MLE) over p ( O | X ) :
Revised: To train P π , we perform Maximum Likelihood Estimation (MLE) over p ( O | X ) :

Original: [Equation]
Revised: [Equation]

Original: where i =
Revised: where i =

Original: h
Revised: h

Original: [Equation]
Revised: [Equation]

Original: If P π is ready for estimation, we could directly adopt it as a nice non-linear function to maximize p ( d ( b , t ) = k ) .
Revised: If P π is ready for estimation, we could directly adopt it as a nice non-linear function to maximize p ( d ( b , t ) = k ) .

Original: Note that to realize Eq.
Revised: Note that to realize Eq.

Original: (3), we want b and its corresponding center c are closest, i.e . maximize p ( d ( b , c ) = 0) .
Revised: (3), we want b and its corresponding center c are closest, i.e . maximize p ( d ( b , c ) = 0) .

Original: So, we could reformulate this maximization as another MLE:
Revised: So, we could reformulate this maximization as another MLE:

Original: [Equation]
Revised: [Equation]

Original: where p ( d ( b , c ) = 0) =
Revised: where p ( d ( b , c ) = 0) =

Original: p ( b i = c
Revised: p ( b i = c

Original: i
Revised: i

Original: [Equation]
Revised: [Equation]

Original: 1 ≤ i ≤ h ) ,
Revised: 1 ≤ i ≤ h ) ,

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: which could be optimized by calculating surrogate gradients of Eq.
Revised: which could be optimized by calculating surrogate gradients of Eq.

Original: (6) through P π :
Revised: (6) through P π :

Original: [Equation]
Revised: [Equation]

Original: Unfortunately, such joint probability estimation on MVB requires O (cid:0) 2 h (cid:1) complexity, which is not flexible when h is large.
Revised: Unfortunately, such joint probability estimation on MVB requires O (cid:0) 2 h (cid:1) complexity, which is not flexible when h is large.

Original: By adopting the idea of block code [42], the above estimation is able to perform on long hash bits by separating hash codes into a series of blocks.
Revised: By adopting the idea of block code [42], the above estimation is able to perform on long hash bits by separating hash codes into a series of blocks.

Original: Specifically, any h bits hash codes can be split into u blocks while each block consumes h / u bits.
Revised: Specifically, any h bits hash codes can be split into u blocks while each block consumes h / u bits.

Original: Correspondingly, u independent surrogate networks P π i , 1 ≤ i ≤ u are adopted to perform the above estimation and back-propagation simultaneously.
Revised: Correspondingly, u independent surrogate networks P π i , 1 ≤ i ≤ u are adopted to perform the above estimation and back-propagation simultaneously.

Original: With such decomposition, the whole problem is transformed into u sub-problems with a reduced complexity O (cid:0) 2 h (cid:1) → O (cid:0) u · 2 h / u (cid:1) .
Revised: With such decomposition, the whole problem is transformed into u sub-problems with a reduced complexity O (cid:0) 2 h (cid:1) → O (cid:0) u · 2 h / u (cid:1) .

Original: As a summarization all of things, overall optimization via gradient descent is placed in Alg.
Revised: As a summarization all of things, overall optimization via gradient descent is placed in Alg.

Original: We first perform Eq.
Revised: We first perform Eq.

Original: (2) step by using the pre-defined centers and then perform Eq.
Revised: (2) step by using the pre-defined centers and then perform Eq.

Original: (3) step by backpropagation via Eq.
Revised: (3) step by backpropagation via Eq.

Original: Two models F θ , P π are optimized with learning rate η 1 , η 2 respectively.
Revised: Two models F θ , P π are optimized with learning rate η 1 , η 2 respectively.

Original: Algorithm 1 One of implementations under supervised circumstance.
Revised: Algorithm 1 One of implementations under supervised circumstance.

Original: ▷ (
Revised: ▷ (

Original: Eq.
Revised: Eq.

Original: (3), return end
Revised: (3), return end

Original:  Experiments
Revised:  Experiments

Original: We conduct extensive experiments on three benchmark datasets to confirm the effectiveness of our proposed method.
Revised: We conduct extensive experiments on three benchmark datasets to confirm the effectiveness of our proposed method.

Original: To make fair comparisons, we first provide experiments setup.
Revised: To make fair comparisons, we first provide experiments setup.

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: 6.1 Setup
Revised: 6.1 Setup

Original: Our experiments focus on performance comparisons on two typical hash-based tasks, fast retrieval and recognition, with and without integrating our proposed method.
Revised: Our experiments focus on performance comparisons on two typical hash-based tasks, fast retrieval and recognition, with and without integrating our proposed method.

Original: The general evaluation pipeline is to train models in the training split, then hash all samples in the base split.
Revised: The general evaluation pipeline is to train models in the training split, then hash all samples in the base split.

Original: Then for retrieval, any hashed queries in query split are used to get rank lists of the base split from nearest to farthest according to Hamming distance.
Revised: Then for retrieval, any hashed queries in query split are used to get rank lists of the base split from nearest to farthest according to Hamming distance.

Original: As for recognition, we adopt a k NN classifier or a linear model to produce queries’ predictions.
Revised: As for recognition, we adopt a k NN classifier or a linear model to produce queries’ predictions.

Original: 6.1.1 Datasets
Revised: 6.1.1 Datasets

Original: [Table]
Revised: [Table]

Original: Our experiments are conducted on three datasets, varying in scale, variety and perplexity to validate methods’ performance in different scenarios.
Revised: Our experiments are conducted on three datasets, varying in scale, variety and perplexity to validate methods’ performance in different scenarios.

Original: Both single-label and multi-label datasets are included.
Revised: Both single-label and multi-label datasets are included.

Original: We follow previous works to generate three splits, which are detailed below:
Revised: We follow previous works to generate three splits, which are detailed below:

Original: CIFAR-10 [20] is a single-label 10 -class dataset.
Revised: CIFAR-10 [20] is a single-label 10 -class dataset.

Original: The whole dataset contains 6 , 000 images for each class.
Revised: The whole dataset contains 6 , 000 images for each class.

Original: Following [5], we split the dataset into 500 | 5 , 400 | 100 for each class randomly as train, base and query splits, respectively.
Revised: Following [5], we split the dataset into 500 | 5 , 400 | 100 for each class randomly as train, base and query splits, respectively.

Original: NUS-WIDE [7] consists of 81 labels and images may have one or more labels.
Revised: NUS-WIDE [7] consists of 81 labels and images may have one or more labels.

Original: We follow previous works [5] to pick the most frequent 21 labels and their associated images ( 195 , 834 ) for experiments.
Revised: We follow previous works [5] to pick the most frequent 21 labels and their associated images ( 195 , 834 ) for experiments.

Original: Specifically, 193 , 734 images are randomly picked to form the base split while remaining 2 , 100 images are adopted for queries.
Revised: Specifically, 193 , 734 images are randomly picked to form the base split while remaining 2 , 100 images are adopted for queries.

Original: 10 , 500 images are randomly sampled from the base split for training models.
Revised: 10 , 500 images are randomly sampled from the base split for training models.

Original: ImageNet [11] is a large-scale dataset consists of 1 , 000 classes.
Revised: ImageNet [11] is a large-scale dataset consists of 1 , 000 classes.

Original: To conduct experiments, we follow [5] to pick a subset of 100 classes where all images of these classes in the training set / validation set are as base split / query split respectively ( 128 , 503 | 4 , 983 images).
Revised: To conduct experiments, we follow [5] to pick a subset of 100 classes where all images of these classes in the training set / validation set are as base split / query split respectively ( 128 , 503 | 4 , 983 images).

Original: We then randomly sample 100 images per class in the base split for training.
Revised: We then randomly sample 100 images per class in the base split for training.

Original: 6.1.2 Implementation Details
Revised: 6.1.2 Implementation Details

Original: Our method is able to integrate into common hash-models.
Revised: Our method is able to integrate into common hash-models.

Original: Due to the limitation of computation resources, we choose a series of representative deep hashing methods for comparison, including
Revised: Due to the limitation of computation resources, we choose a series of representative deep hashing methods for comparison, including

Original: HashNet [5], DBDH [55], DSDH [26], DCH [4], GreedHash [40] and CSQ [51].
Revised: HashNet [5], DBDH [55], DSDH [26], DCH [4], GreedHash [40] and CSQ [51].

Original: When our method is integrated, we append a subscript ( · ) D to the original methods’ name.
Revised: When our method is integrated, we append a subscript ( · ) D to the original methods’ name.

Original: All methods adopted for experiments are implemented from a public benchmark with PyTorch [34].
Revised: All methods adopted for experiments are implemented from a public benchmark with PyTorch [34].

Original: For fair comparisons, we conduct experiments with the same backbone (ResNet-50 [16]) and hyper-parameters for all tested methods.
Revised: For fair comparisons, we conduct experiments with the same backbone (ResNet-50 [16]) and hyper-parameters for all tested methods.

Original: We adopt Adam [35] optimizer with default configuration and learning rate of our method η 1 =
Revised: We adopt Adam [35] optimizer with default configuration and learning rate of our method η 1 =

Original: η 2 = 1 e − 3 for training.
Revised: η 2 = 1 e − 3 for training.

Original: For multi-label datasets, we simply modify Alg.
Revised: For multi-label datasets, we simply modify Alg.

Original: 1 Linewith the sum of multiple losses.
Revised: 1 Linewith the sum of multiple losses.

Original: Block number u of P is set to bits / 8 .
Revised: Block number u of P is set to bits / 8 .

Original: For example, if the length of hash code is 64 , there will be 8 sub-models P
Revised: For example, if the length of hash code is 64 , there will be 8 sub-models P

Original: π 1 ∼ P π 8 trained in parallel.
Revised: π 1 ∼ P π 8 trained in parallel.

Original: To mitigate randomness, we report average performance for 5 runs on all experiments.
Revised: To mitigate randomness, we report average performance for 5 runs on all experiments.

Original: The evaluation metric adopted for retrieval is mean Average Precision (mAP@ R ) where R = 54 , 000 | 5 , 000 | 1 , 000 on CIFAR-10,
Revised: The evaluation metric adopted for retrieval is mean Average Precision (mAP@ R ) where R = 54 , 000 | 5 , 000 | 1 , 000 on CIFAR-10,

Original: NUS-WIDE, ImageNet, respectively.
Revised: NUS-WIDE, ImageNet, respectively.

Original: For recognition performance, if methods have an auxiliary classification branch, we directly use its predictions from it.
Revised: For recognition performance, if methods have an auxiliary classification branch, we directly use its predictions from it.

Original: Otherwise, we adopt a k NN classifier built on base split and vote with 100 nearest neighbours.
Revised: Otherwise, we adopt a k NN classifier built on base split and vote with 100 nearest neighbours.

Original: 6.2 Ablation Study
Revised: 6.2 Ablation Study

Original: [Figure]
Revised: [Figure]

Original: In the ablation study, we try to reveal thecorrectness of our proposed objectives Eqs.
Revised: In the ablation study, we try to reveal thecorrectness of our proposed objectives Eqs.

Original: (2) and (3), and the effectiveness of our proposed posterior estimation model P π .
Revised: (2) and (3), and the effectiveness of our proposed posterior estimation model P π .

Original: We answer the following questions by conducting experiments on ImageNet to demystify the above concerns.
Revised: We answer the following questions by conducting experiments on ImageNet to demystify the above concerns.

Original: We focus on retrieval performance in the ablation study, while we observe similar results on recognition.
Revised: We focus on retrieval performance in the ablation study, while we observe similar results on recognition.

Original: Is hash-model’s performance lower-bounded by Eq.
Revised: Is hash-model’s performance lower-bounded by Eq.

Original: Validating correctness of Eq.
Revised: Validating correctness of Eq.

Original: (1) is important, but it is essentially hard to conduct experiments to confirm it.
Revised: (1) is important, but it is essentially hard to conduct experiments to confirm it.

Original: Nevertheless, we still reveal the correlation between model performance and inter-class distinctiveness / intra-class compactness by tracking mAP w.r.t .
Revised: Nevertheless, we still reveal the correlation between model performance and inter-class distinctiveness / intra-class compactness by tracking mAP w.r.t .

Original: min D inter max D intra during training.
Revised: min D inter max D intra during training.

Original: To calculate D inter and D intra , we first hash all samples from the base split and calculate their centers of them over all classes.
Revised: To calculate D inter and D intra , we first hash all samples from the base split and calculate their centers of them over all classes.

Original: The 99 . 9 percentile of min D inter and max D intra is picked to avoid outliers.
Revised: The 99 . 9 percentile of min D inter and max D intra is picked to avoid outliers.

Original: We conduct tracking on CSQ D with 16 , 32 , 64 bits per epoch to draw
Revised: We conduct tracking on CSQ D with 16 , 32 , 64 bits per epoch to draw

Original: Fig.
Revised: Fig.

Original: As the figure shows, lines go from lower left to upper right with small fluctuations, which indicates the linear relationship between mAP and min D inter max D intra on all bit-lengths.
Revised: As the figure shows, lines go from lower left to upper right with small fluctuations, which indicates the linear relationship between mAP and min D inter max D intra on all bit-lengths.

Original: This may partially confirm our theoretical analysis in Sec. 4.
Revised: This may partially confirm our theoretical analysis in Sec. 4.

Original: Convergence speed and efficiency of P π .
Revised: Convergence speed and efficiency of P π .

Original: To verify the convergence speed and efficiency of our posterior estimation model P π , we test it by substituting with two variants: BCE from [51] and Cauchy loss from [4].
Revised: To verify the convergence speed and efficiency of our posterior estimation model P π , we test it by substituting with two variants: BCE from [51] and Cauchy loss from [4].

Original: mAP is evaluated per epoch for three variants with three bit-lengths 16 , 32 , 64 and the convergence curve is plotted in Fig.
Revised: mAP is evaluated per epoch for three variants with three bit-lengths 16 , 32 , 64 and the convergence curve is plotted in Fig.

Original: From the figure, we could see that ours and BCE’s convergence speed are similar, while Cauchy is slightly slow.
Revised: From the figure, we could see that ours and BCE’s convergence speed are similar, while Cauchy is slightly slow.

Original: Meanwhile, our method has continuously higher performance than other two after ∼ 10 epochs for all bit-lengths, which is potentially due to our method could perform low-bias optimization.
Revised: Meanwhile, our method has continuously higher performance than other two after ∼ 10 epochs for all bit-lengths, which is potentially due to our method could perform low-bias optimization.

Original: Note that when training with Cauchy loss, performance is instead lower when codes are longer.
Revised: Note that when training with Cauchy loss, performance is instead lower when codes are longer.

Original: This may be caused by the inner-product based Cauchy loss could not handle long bits.
Revised: This may be caused by the inner-product based Cauchy loss could not handle long bits.

Original: We also measure averaged training time per epoch of all variants on a single NVIDIA RTX 3090, which is placed in Tab. 1.
Revised: We also measure averaged training time per epoch of all variants on a single NVIDIA RTX 3090, which is placed in Tab. 1.

Original: In this table, our model does not consume significant longer time than others to train.
Revised: In this table, our model does not consume significant longer time than others to train.

Original: The above observations reveal the efficiency of our proposed method.
Revised: The above observations reveal the efficiency of our proposed method.

Original: It could be a drop-in replacement without introducing significant overhead.
Revised: It could be a drop-in replacement without introducing significant overhead.

Original: Moreover, convergence speed and efficiency will not drop when the bit-length becomes long, which reveals the flexibility of the blocked code design.
Revised: Moreover, convergence speed and efficiency will not drop when the bit-length becomes long, which reveals the flexibility of the blocked code design.

Original: Could P π estimate multivariate Bernoulli distribution?
Revised: Could P π estimate multivariate Bernoulli distribution?

Original: We design an extra toy experiments to validate the ability of estimating multivariate Bernoulli distribution by our surrogate model P π .
Revised: We design an extra toy experiments to validate the ability of estimating multivariate Bernoulli distribution by our surrogate model P π .

Original: [Table]
Revised: [Table]

Original: Specifically, 8 bits MVB is generated with randomly 256 joint probabilities.
Revised: Specifically, 8 bits MVB is generated with randomly 256 joint probabilities.

Original: We then take 10 ,samples from it as inputs to train P π .
Revised: We then take 10 ,samples from it as inputs to train P π .

Original: The model will further estimate distribution by feeding another 100 samples and taking the mean of all o s (Eq.
Revised: The model will further estimate distribution by feeding another 100 samples and taking the mean of all o s (Eq.

Original: (4)) as result.
Revised: (4)) as result.

Original: The estimated distribution is evaluated by Kullback–Leibler divergence [23] ( KL ) with real distribution, as well as bar plot, demonstrated in
Revised: The estimated distribution is evaluated by Kullback–Leibler divergence [23] ( KL ) with real distribution, as well as bar plot, demonstrated in

Original: Fig.
Revised: Fig.

Original: As the figure shows, our predicted joint probabilities almost cover real probabilities and KL is low.
Revised: As the figure shows, our predicted joint probabilities almost cover real probabilities and KL is low.

Original: As a comparison, if we estimate real distribution with the product of edge probabilities directly ( w / o correlations between variables), KL will be significantly increased (row 1 in table).
Revised: As a comparison, if we estimate real distribution with the product of edge probabilities directly ( w / o correlations between variables), KL will be significantly increased (row 1 in table).

Original: Such toy experiment reveals that our method is better for estimating MVB s than the naïve one.
Revised: Such toy experiment reveals that our method is better for estimating MVB s than the naïve one.

Original: 6.3 Performance Enhancements when Integrating into State-of-the-Art
Revised: 6.3 Performance Enhancements when Integrating into State-of-the-Art

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: for different methods.
Revised: for different methods.

Original: By integrating our auxiliary objective, we could observe significant performance and min D inter max D intra increase in most cases (from solid dots to translucent dots).
Revised: By integrating our auxiliary objective, we could observe significant performance and min D inter max D intra increase in most cases (from solid dots to translucent dots).

Original: Regression line is also plotted with 95% confidence interval to reveal linear relationship between two metrics.
Revised: Regression line is also plotted with 95% confidence interval to reveal linear relationship between two metrics.

Original: To evaluate performance gain when integrating our proposed method into hash-models, we conduct experiments on three datasets.
Revised: To evaluate performance gain when integrating our proposed method into hash-models, we conduct experiments on three datasets.

Original: Specifically, we first report the original performance of tested models and then re-run with our method incorporated to make a comparison.
Revised: Specifically, we first report the original performance of tested models and then re-run with our method incorporated to make a comparison.

Original: Both 16 , 32 ,bits results are reported to show performance from short codes to long codes.
Revised: Both 16 , 32 ,bits results are reported to show performance from short codes to long codes.

Original: Retrieval Performance.
Revised: Retrieval Performance.

Original: Retrieval performance comparisons under mAP is shown in Tab. 2.
Revised: Retrieval performance comparisons under mAP is shown in Tab. 2.

Original: With our integrated method, all tested hashing methods have performance enhancement.
Revised: With our integrated method, all tested hashing methods have performance enhancement.

Original: We observe an up to 26 .
Revised: We observe an up to 26 .

Original: 5% increase and 5 .
Revised: 5% increase and 5 .

Original: 02% on average, which is a significant improvement.
Revised: 02% on average, which is a significant improvement.

Original: Specifically, performance increase on HashNet,
Revised: Specifically, performance increase on HashNet,

Original: DBDH and DSDH is higher than other methods (first 3 rows), especially on ImageNet dataset.
Revised: DBDH and DSDH is higher than other methods (first 3 rows), especially on ImageNet dataset.

Original: A potential reason is that all of these three methods use pairwise metric learning objectives and inner-product to approximate Hamming distance, which may not handle optimization well when dataset size and class number is large.
Revised: A potential reason is that all of these three methods use pairwise metric learning objectives and inner-product to approximate Hamming distance, which may not handle optimization well when dataset size and class number is large.

Original: Meanwhile, our method works on multi-label datasets where all methods also obtain performance gain, indicating that multi-label data may also benefit from our objective.
Revised: Meanwhile, our method works on multi-label datasets where all methods also obtain performance gain, indicating that multi-label data may also benefit from our objective.

Original: Furthermore, we
Revised: Furthermore, we

Original: [Figure]
Revised: [Figure]

Original: also observe a 3 . 46% average mAP increase on CSQ.
Revised: also observe a 3 . 46% average mAP increase on CSQ.

Original: It adopts a similar objective but a different optimization approach with ours.
Revised: It adopts a similar objective but a different optimization approach with ours.

Original: This increase shows the effectiveness of our proposed posterior estimation approach, which could perform better optimization than theirs
Revised: This increase shows the effectiveness of our proposed posterior estimation approach, which could perform better optimization than theirs

Original: [Table] [Table]
Revised: [Table] [Table]

Original: Recognition Performance.
Revised: Recognition Performance.

Original: Similarly, we report the recognition performance of these methods by measuring classification accuracy on ImageNet with 16 , 32 , 64 bits codes.
Revised: Similarly, we report the recognition performance of these methods by measuring classification accuracy on ImageNet with 16 , 32 , 64 bits codes.

Original: Results are reported in Tab. 3.
Revised: Results are reported in Tab. 3.

Original: Generally, we observe similar performance gains.
Revised: Generally, we observe similar performance gains.

Original: When methods have our integration, their accuracy is significantly increased, up to 20 .
Revised: When methods have our integration, their accuracy is significantly increased, up to 20 .

Original: 5% and 5 .
Revised: 5% and 5 .

Original: 3% on average.
Revised: 3% on average.

Original: Specifically, some of them utilize an auxiliary classification branch to produce predictions, i.e .,
Revised: Specifically, some of them utilize an auxiliary classification branch to produce predictions, i.e .,

Original: GreedyHash and DSDH.
Revised: GreedyHash and DSDH.

Original: While for others, we adopt a k NN classifier to classify samples by voting with the base split.
Revised: While for others, we adopt a k NN classifier to classify samples by voting with the base split.

Original: We obtain increase for both approaches.
Revised: We obtain increase for both approaches.

Original: This indicates that our approach also helps for hash-based recognition in different scenarios, by leveraging inter-class distinctiveness and intra-class compactness.
Revised: This indicates that our approach also helps for hash-based recognition in different scenarios, by leveraging inter-class distinctiveness and intra-class compactness.

Original: From the above comparisons, we confirm the effectiveness of our proposed method.
Revised: From the above comparisons, we confirm the effectiveness of our proposed method.

Original: Overall, our method is validated to be flexible and promising to deploy in the above scenarios with various bits.
Revised: Overall, our method is validated to be flexible and promising to deploy in the above scenarios with various bits.

Original: 6.4 Qualitative Comparisons
Revised: 6.4 Qualitative Comparisons

Original: t-SNE visualization.
Revised: t-SNE visualization.

Original: To further analyze how our objective affects hash codes by adjusting D inter and D intra , we conduct codes visualization by t-SNE [14] on HashNet and DBDH.
Revised: To further analyze how our objective affects hash codes by adjusting D inter and D intra , we conduct codes visualization by t-SNE [14] on HashNet and DBDH.

Original: Specifically, we randomly sample 5 , 000 64 bits codes from CIFAR-10 base split.
Revised: Specifically, we randomly sample 5 , 000 64 bits codes from CIFAR-10 base split.

Original: t-SNE is then performed on these codes as shown in Fig.
Revised: t-SNE is then performed on these codes as shown in Fig.

Original: 5, where points’ color indicates class.
Revised: 5, where points’ color indicates class.

Original: From these figures, we give our humble explanation.
Revised: From these figures, we give our humble explanation.

Original: Firstly, please look at Fig.
Revised: Firstly, please look at Fig.

Original: 5(a), codes extracted from the original HashNet are mixed among different classes.
Revised: 5(a), codes extracted from the original HashNet are mixed among different classes.

Original: While in Fig. 5(c), clusters are loose.
Revised: While in Fig. 5(c), clusters are loose.

Original: These representations result in low min D inter and high max D intra .
Revised: These representations result in low min D inter and high max D intra .

Original: When they are trained along with our method (Figs. 5(b) and 5(d)), we get more separable and distinct clusters compared to the original ones.
Revised: When they are trained along with our method (Figs. 5(b) and 5(d)), we get more separable and distinct clusters compared to the original ones.

Original: Meanwhile, codes in a cluster are more compact than the original methods.
Revised: Meanwhile, codes in a cluster are more compact than the original methods.

Original: Quantitative results of min D inter max D intra placed under figures also reveal this phenomenon.
Revised: Quantitative results of min D inter max D intra placed under figures also reveal this phenomenon.

Original: mAP w.r.t .
Revised: mAP w.r.t .

Original: min D inter max D intra visualization.
Revised: min D inter max D intra visualization.

Original: To further confirm the relationship between hashing performance and min D inter max D intra , as in Sec.
Revised: To further confirm the relationship between hashing performance and min D inter max D intra , as in Sec.

Original: 6.2, we plot mAP w.r.t .
Revised: 6.2, we plot mAP w.r.t .

Original: min D inter max D intra for all tested methods on 64 bits ImageNet base split (Fig. 4).
Revised: min D inter max D intra for all tested methods on 64 bits ImageNet base split (Fig. 4).

Original: As the figure shows, most of the methods obtain higher mAP with larger min D inter max D intra and move from lower-left region to upper-right region (solid dots to translucent dots indicate original methods to integrated methods).
Revised: As the figure shows, most of the methods obtain higher mAP with larger min D inter max D intra and move from lower-left region to upper-right region (solid dots to translucent dots indicate original methods to integrated methods).

Original: Meanwhile, according to the positions of these dots, mAP and min D inter max D intra are supposed to be under linear relationship for different methods, i.e .
Revised: Meanwhile, according to the positions of these dots, mAP and min D inter max D intra are supposed to be under linear relationship for different methods, i.e .

Original: higher min
Revised: higher min

Original: D inter max D intra leads to higher mAP.
Revised: D inter max D intra leads to higher mAP.

Original: Therefore, we give a regression line with 95% confidence interval on the plot to confirm our observations.
Revised: Therefore, we give a regression line with 95% confidence interval on the plot to confirm our observations.

Original: Extended from this, our proposed lower bound could also be a criterion of hash codes’ performance.
Revised: Extended from this, our proposed lower bound could also be a criterion of hash codes’ performance.

Original:  Conclusion
Revised:  Conclusion

Original: In this paper, we conduct a comprehensive study on the characteristics of hash codes.
Revised: In this paper, we conduct a comprehensive study on the characteristics of hash codes.

Original: As a result, we prove that hash codes’ performance is lower-bounded by inter-class distinctiveness and intra-class compactness.
Revised: As a result, we prove that hash codes’ performance is lower-bounded by inter-class distinctiveness and intra-class compactness.

Original: Formulating such a lower bound as an objective, we could further lift it in hash-model training.
Revised: Formulating such a lower bound as an objective, we could further lift it in hash-model training.

Original: Meanwhile, our proposed surrogate model for posterior estimation over hash codes’ fully exploits the above guidance to perform low-bias model optimization and finally produce good codes.
Revised: Meanwhile, our proposed surrogate model for posterior estimation over hash codes’ fully exploits the above guidance to perform low-bias model optimization and finally produce good codes.

Original: Extensive experiments conducted on three benchmark datasets confirm the effectiveness of our proposed method.
Revised: Extensive experiments conducted on three benchmark datasets confirm the effectiveness of our proposed method.

Original: We are able to boost current hash-models’ performance with a flexible integration.
Revised: We are able to boost current hash-models’ performance with a flexible integration.

Original: Limitation and Broader Impacts
Revised: Limitation and Broader Impacts

Original: Hashing and related compact representation learning are able to significantly reduce computational requirements while improving memory efficiency when deploying to real scenarios.
Revised: Hashing and related compact representation learning are able to significantly reduce computational requirements while improving memory efficiency when deploying to real scenarios.

Original: However, the main challenge for these techniques is information loss which results in a performance drop.
Revised: However, the main challenge for these techniques is information loss which results in a performance drop.

Original: To tackle this, our work on on hash codes’ performance gives a lower bound, validated in two specific tasks.
Revised: To tackle this, our work on on hash codes’ performance gives a lower bound, validated in two specific tasks.

Original: However, generalizing such lower bounds to various scenarios, e.g . semi-supervised, unsupervised hash learning, are left for future study.
Revised: However, generalizing such lower bounds to various scenarios, e.g . semi-supervised, unsupervised hash learning, are left for future study.

Original: Meanwhile, our posterior estimation approach is not verified for extremely long bits.
Revised: Meanwhile, our posterior estimation approach is not verified for extremely long bits.

Original: Nevertheless, our work may still provide the potential to inspire researchers to improve not only hash learning, but also broader areas that adopt metric learning.
Revised: Nevertheless, our work may still provide the potential to inspire researchers to improve not only hash learning, but also broader areas that adopt metric learning.

Original: Our study on posterior estimation may also help for precise discrete optimizations.
Revised: Our study on posterior estimation may also help for precise discrete optimizations.

Original: Acknowledgments and Disclosure of Funding
Revised: Acknowledgments and Disclosure of Funding

Original: This work is supported by National Key Research and Development Program of China (No.
Revised: This work is supported by National Key Research and Development Program of China (No.

Original: 2018AAA0102200), the National Natural Science Foundation of China (Grant No. 62122018,
Revised: 2018AAA0102200), the National Natural Science Foundation of China (Grant No. 62122018,

Original: No. 61772116, No. 62020106008, No. 61872064).
Revised: No. 61772116, No. 62020106008, No. 61872064).

Original: Checklist
Revised: Checklist

Original: For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contribu- tions and scope?
Revised: For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contribu- tions and scope?

Original: [Yes] (b) Did you describe the limitations of your work?
Revised: [Yes] (b) Did you describe the limitations of your work?

Original: [Yes] See Sec.
Revised: [Yes] See Sec.

Original: (c) Did you discuss any potential negative societal impacts of your work?
Revised: (c) Did you discuss any potential negative societal impacts of your work?

Original: [No] No explicit negative impacts.
Revised: [No] No explicit negative impacts.

Original: (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?
Revised: (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?

Original: [Yes] 2.
Revised: [Yes] 2.

Original: If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?
Revised: If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?

Original: [Yes] See Sec. 4.
Revised: [Yes] See Sec. 4.

Original: (b) Did you include complete proofs of all theoretical results?
Revised: (b) Did you include complete proofs of all theoretical results?

Original: [Yes] See Sec. 4.
Revised: [Yes] See Sec. 4.

Original: If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?
Revised: If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?

Original: [Yes] See supplemental material.
Revised: [Yes] See supplemental material.

Original: (b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?
Revised: (b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)?

Original: [Yes] See Sec. 6.
Revised: [Yes] See Sec. 6.

Original: (c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?
Revised: (c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)?

Original: [Yes] See Sec. 6.
Revised: [Yes] See Sec. 6.

Original: (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?
Revised: (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?

Original: [Yes] See Sec. 6. 4.
Revised: [Yes] See Sec. 6. 4.

Original: If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?
Revised: If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?

Original: [Yes] See Sec. 6.
Revised: [Yes] See Sec. 6.

Original: (b) Did you mention the license of the assets?
Revised: (b) Did you mention the license of the assets?

Original: [Yes] See Sec. 6.
Revised: [Yes] See Sec. 6.

Original: (c) Did you include any new assets either in the supplemental material or as a URL?
Revised: (c) Did you include any new assets either in the supplemental material or as a URL?

Original: [Yes] Codes appear in supplementary materials.
Revised: [Yes] Codes appear in supplementary materials.

Original: (d) Did you discuss whether and how consent was obtained from people whose data you’re us- ing/curating?
Revised: (d) Did you discuss whether and how consent was obtained from people whose data you’re us- ing/curating?

Original: [N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable informa- tion or offensive content?
Revised: [N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable informa- tion or offensive content?

Original: [N/A] 5.
Revised: [N/A] 5.

Original: If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?
Revised: If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?

Original: [N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?
Revised: [N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?

Original: [N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?
Revised: [N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?

Original: [N/A]
Revised: [N/A]