Original: A L APLACE - INSPIRED D ISTRIBUTION ON SO(3) FOR P ROBABILISTIC R OTATION E STIMATION
Revised: A L APLACE - INSPIRED D ISTRIBUTION ON SO(3) FOR P ROBABILISTIC R OTATION E STIMATION

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: Estimating the 3DoF rotation from a single RGB image is an important yet challenging problem.
Revised: Estimating the 3DoF rotation from a single RGB image is an important yet challenging problem.

Original: Probabilistic rotation regression has raised more and more attention with the benefit of expressing uncertainty information along with the prediction.
Revised: Probabilistic rotation regression has raised more and more attention with the benefit of expressing uncertainty information along with the prediction.

Original: Though modeling noise using Gaussian resembling Bingham distribution and matrix Fisher distribution is natural, they are shown to be sensitive to outliers for the nature of quadratic punishment to deviations
Revised: Though modeling noise using Gaussian resembling Bingham distribution and matrix Fisher distribution is natural, they are shown to be sensitive to outliers for the nature of quadratic punishment to deviations

Original: In this paper
Revised: In this paper

Original: , we draw inspiration from multivariate Laplace distribution and propose a novel Rotation
Revised: , we draw inspiration from multivariate Laplace distribution and propose a novel Rotation

Original: Laplace distribution on
Revised: Laplace distribution on

Original: SO
Revised: SO

Original: Rotation
Revised: Rotation

Original: Laplace distribution is robust to the dis
Revised: Laplace distribution is robust to the dis

Original: - turbance of outliers and enforces much gradient to the low
Revised: - turbance of outliers and enforces much gradient to the low

Original: -error region, resulting in a better convergence.
Revised: -error region, resulting in a better convergence.

Original: Our extensive experiments show that our proposed distribution achieves state-of-the-art performance for rotation regression tasks over both probabilistic and non probabilistic baselines
Revised: Our extensive experiments show that our proposed distribution achieves state-of-the-art performance for rotation regression tasks over both probabilistic and non probabilistic baselines

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: Incorporating neural networks to perform rotation regression is of great importance in the field of computer vision, computer graphics and robotics (Wang et al., 2019b;
Revised: Incorporating neural networks to perform rotation regression is of great importance in the field of computer vision, computer graphics and robotics (Wang et al., 2019b;

Original: Yin et al., 2022; Dong et al., 2021; Breyer et al., 2021).
Revised: Yin et al., 2022; Dong et al., 2021; Breyer et al., 2021).

Original: To close the gap between the SO(3) manifold and the Euclidean space where neural network outputs exist, one popular line of research discovers learning-friendly rotation representations including 6D continuous representation (Zhou et al., 2019), 9D matrix representation with SVD orthogonalization (Levinson et al., 2020), etc.
Revised: To close the gap between the SO(3) manifold and the Euclidean space where neural network outputs exist, one popular line of research discovers learning-friendly rotation representations including 6D continuous representation (Zhou et al., 2019), 9D matrix representation with SVD orthogonalization (Levinson et al., 2020), etc.

Original: Recently, Chen et al.
Revised: Recently, Chen et al.

Original: (2022) focuses on the gradient backpropagating process and replaces the vanilla auto differentiation with a SO(3) manifold-aware gradient layer, which sets the new state-of-the-art in rotation regression tasks.
Revised: (2022) focuses on the gradient backpropagating process and replaces the vanilla auto differentiation with a SO(3) manifold-aware gradient layer, which sets the new state-of-the-art in rotation regression tasks.

Original: Reasoning about the uncertainty information along with the predicted rotation is also attracting more and more attention, which enables many applications in aerospace (Crassidis & Markley, 2003), autonomous driving (McAllister et al., 2017) and localization (Fang et al., 2020).
Revised: Reasoning about the uncertainty information along with the predicted rotation is also attracting more and more attention, which enables many applications in aerospace (Crassidis & Markley, 2003), autonomous driving (McAllister et al., 2017) and localization (Fang et al., 2020).

Original: On this front, recent efforts have been developed to model the uncertainty of rotation regression via probabilistic modeling of rotation space.
Revised: On this front, recent efforts have been developed to model the uncertainty of rotation regression via probabilistic modeling of rotation space.

Original: The most commonly used distributions are Bingham distribution (Bingham, 1974) on S 3 for unit quaternions and matrix Fisher distribution (Khatri & Mardia, 1977) on SO(3) for rotation matrices.
Revised: The most commonly used distributions are Bingham distribution (Bingham, 1974) on S 3 for unit quaternions and matrix Fisher distribution (Khatri & Mardia, 1977) on SO(3) for rotation matrices.

Original: These two distributions are equivalent to each other (Prentice, 1986) and resemble the Gaussian distribution in Euclidean Space (Bingham, 1974; Khatri & Mardia, 1977).
Revised: These two distributions are equivalent to each other (Prentice, 1986) and resemble the Gaussian distribution in Euclidean Space (Bingham, 1974; Khatri & Mardia, 1977).

Original: While modeling noise using Gaussian-like distributions is well-motivated by the Central Limit Theorem, Gaussian distribution is well-known to be sensitive to outliers in the probabilistic regression models (Murphy, 2012).
Revised: While modeling noise using Gaussian-like distributions is well-motivated by the Central Limit Theorem, Gaussian distribution is well-known to be sensitive to outliers in the probabilistic regression models (Murphy, 2012).

Original: This is because Gaussian distribution penalizes deviations quadratically, so predictions with larger errors weigh much more heavily with the learning than low-error ones and thus potentially result in suboptimal convergence when a certain amount of outliers exhibit.
Revised: This is because Gaussian distribution penalizes deviations quadratically, so predictions with larger errors weigh much more heavily with the learning than low-error ones and thus potentially result in suboptimal convergence when a certain amount of outliers exhibit.

Original: Unfortunately, in certain rotation regression tasks, we fairly often come across large prediction errors, e.g. 180 ◦ error, due to either the (near) symmetry nature of the objects or severe occlusions (Murphy et al., 2021).
Revised: Unfortunately, in certain rotation regression tasks, we fairly often come across large prediction errors, e.g. 180 ◦ error, due to either the (near) symmetry nature of the objects or severe occlusions (Murphy et al., 2021).

Original: In Fig.
Revised: In Fig.

Original: 1(left)
Revised: 1(left)

Original: , using training on single image rotation regression as an example, we show the statistics of predictions on training data after achieving convergence, assuming matrix Fisher distribution (as done in Mohlin et al.
Revised: , using training on single image rotation regression as an example, we show the statistics of predictions on training data after achieving convergence, assuming matrix Fisher distribution (as done in Mohlin et al.

Original: The blue histogram shows the population with different prediction errors and the red dots are the impacts of these predictions on learning, evaluated by computing the sum of their gradient magnitudes ∥
Revised: The blue histogram shows the population with different prediction errors and the red dots are the impacts of these predictions on learning, evaluated by computing the sum of their gradient magnitudes ∥

Original: ∂ L /∂ ( distribution param. )
Revised: ∂ L /∂ ( distribution param. )

Original: ∥ within each bin and then normalizing them across bins.
Revised: ∥ within each bin and then normalizing them across bins.

Original: It is clear that the 180 ◦ outliers dominate the gradient as well as the network training though their population is tiny, while the vast majority of
Revised: It is clear that the 180 ◦ outliers dominate the gradient as well as the network training though their population is tiny, while the vast majority of

Original: [Figure]
Revised: [Figure]

Original: points with low error predictions are deprioritized.
Revised: points with low error predictions are deprioritized.

Original: Arguably, at convergence, the gradient should focus more on refining the low errors rather than fixing the inevitable large errors ( e.g. arose from symmetry).
Revised: Arguably, at convergence, the gradient should focus more on refining the low errors rather than fixing the inevitable large errors ( e.g. arose from symmetry).

Original: This motivates us to find a better probabilistic model for rotation.
Revised: This motivates us to find a better probabilistic model for rotation.

Original: As pointed out by Murphy (2012), Laplace distribution, with heavy tails, is a better option for robust probabilistic modeling.
Revised: As pointed out by Murphy (2012), Laplace distribution, with heavy tails, is a better option for robust probabilistic modeling.

Original: Laplace distribution drops sharply around its mode and thus allocates most of its probability density to a small region around the mode; meanwhile, it also tolerates and assigns higher likelihoods to the outliers, compared to Gaussian distribution.
Revised: Laplace distribution drops sharply around its mode and thus allocates most of its probability density to a small region around the mode; meanwhile, it also tolerates and assigns higher likelihoods to the outliers, compared to Gaussian distribution.

Original: Consequently, it encourages predictions near its mode to be even closer, thus fitting sparse data well, most of whose data points are close to their mean with the exception of several outliers(Mitianoudis, 2012), which makes
Revised: Consequently, it encourages predictions near its mode to be even closer, thus fitting sparse data well, most of whose data points are close to their mean with the exception of several outliers(Mitianoudis, 2012), which makes

Original: Laplace distribution to be favored in the context of deep learning(Goodfellow et al., 2016).
Revised: Laplace distribution to be favored in the context of deep learning(Goodfellow et al., 2016).

Original: In this work, we propose a novel Laplace-inspired distribution on SO(3) for rotation matrices, namely Rotation Laplace distribution, for probabilistic rotation regression.
Revised: In this work, we propose a novel Laplace-inspired distribution on SO(3) for rotation matrices, namely Rotation Laplace distribution, for probabilistic rotation regression.

Original: We devise Rotation
Revised: We devise Rotation

Original: Laplace distribution to be an approximation of multivariate Laplace distribution in the tangent space of its mode.
Revised: Laplace distribution to be an approximation of multivariate Laplace distribution in the tangent space of its mode.

Original: As shown in the visualization in Fig.
Revised: As shown in the visualization in Fig.

Original: 1(right), our Rotation Laplace distribution is robust to the disturbance of outliers, with most of its gradient contributed by the low-error region, and thus leads to a better convergence along with significantly higher accuracy.
Revised: 1(right), our Rotation Laplace distribution is robust to the disturbance of outliers, with most of its gradient contributed by the low-error region, and thus leads to a better convergence along with significantly higher accuracy.

Original: Moreover, our Rotation
Revised: Moreover, our Rotation

Original: Laplace distribution is simply parameterized by an unconstrained 3 × 3 matrix and thus accommodates the Euclidean output of neural networks with ease.
Revised: Laplace distribution is simply parameterized by an unconstrained 3 × 3 matrix and thus accommodates the Euclidean output of neural networks with ease.

Original: This network-friendly distribution requires neither complex functions to fulfill the constraints of parameterization nor any normalization process from Euclidean to rotation manifold which has been shown harmful for learning (Chen et al., 2022).
Revised: This network-friendly distribution requires neither complex functions to fulfill the constraints of parameterization nor any normalization process from Euclidean to rotation manifold which has been shown harmful for learning (Chen et al., 2022).

Original: For completeness of the derivations, we also propose the Laplace-inspired distribution on S 3 for quaternions.
Revised: For completeness of the derivations, we also propose the Laplace-inspired distribution on S 3 for quaternions.

Original: We show that Rotation Laplace distribution is equivalent to Quaternion Laplace distribution, similar to the equivalence of matrix Fisher distribution and Bingham distribution.
Revised: We show that Rotation Laplace distribution is equivalent to Quaternion Laplace distribution, similar to the equivalence of matrix Fisher distribution and Bingham distribution.

Original: We extensively compare our Rotation Laplace distributions to methods that parameterize distributions on SO(3) for pose estimation, and also non-probabilistic approaches including multiple rotation representations and recent SO(3) -aware gradient layer (Chen et al., 2022).
Revised: We extensively compare our Rotation Laplace distributions to methods that parameterize distributions on SO(3) for pose estimation, and also non-probabilistic approaches including multiple rotation representations and recent SO(3) -aware gradient layer (Chen et al., 2022).

Original: On common benchmark datasets of rotation estimation from RGB images, we achieve a significant and consistent performance improvement over all baselines.
Revised: On common benchmark datasets of rotation estimation from RGB images, we achieve a significant and consistent performance improvement over all baselines.

Original:  R ELATED W ORK
Revised:  R ELATED W ORK

Original: Probabilistic regression Nix & Weigend (1994) first proposes to model the output of the neural network as a Gaussian distribution and learn the Gaussian parameters by the negative log-likelihood loss function, through which one obtains not only the target but also a measure of prediction uncertainty.
Revised: Probabilistic regression Nix & Weigend (1994) first proposes to model the output of the neural network as a Gaussian distribution and learn the Gaussian parameters by the negative log-likelihood loss function, through which one obtains not only the target but also a measure of prediction uncertainty.

Original: More recently, Kendall & Gal (2017) offers more understanding and analysis of the underlying uncertainties.
Revised: More recently, Kendall & Gal (2017) offers more understanding and analysis of the underlying uncertainties.

Original: Lakshminarayanan et al.
Revised: Lakshminarayanan et al.

Original: (2017) further improves the performance of uncertainty estimation by network ensembling and adversarial training.
Revised: (2017) further improves the performance of uncertainty estimation by network ensembling and adversarial training.

Original: Makansi et al.
Revised: Makansi et al.

Original: (2019) stabilizes the training with the winner-takes-all and iterative grouping strategies.
Revised: (2019) stabilizes the training with the winner-takes-all and iterative grouping strategies.

Original: Probabilistic regression for uncertainty prediction has been widely used in various applications, including optical flow estimation(Ilg et al., 2018),
Revised: Probabilistic regression for uncertainty prediction has been widely used in various applications, including optical flow estimation(Ilg et al., 2018),

Original: depth estimation (Poggi et al., 2020), weather forecasting (Wang et al., 2019a), etc.
Revised: depth estimation (Poggi et al., 2020), weather forecasting (Wang et al., 2019a), etc.

Original: Among the literature of decades, the majority of probabilistic regression works model the network output by a Gaussian-like distribution, while Laplace distribution is less discovered.
Revised: Among the literature of decades, the majority of probabilistic regression works model the network output by a Gaussian-like distribution, while Laplace distribution is less discovered.

Original: Li et al.
Revised: Li et al.

Original: (2021) empirically finds that assuming a Laplace distribution in the process of maximum likelihood estimation yields better performance than a Gaussian distribution, in the field of 3D human pose estimation.
Revised: (2021) empirically finds that assuming a Laplace distribution in the process of maximum likelihood estimation yields better performance than a Gaussian distribution, in the field of 3D human pose estimation.

Original: Recent work (Nair et al., 2022) makes use of Laplace distribution to improve the robustness of maximum likelihood-based uncertainty estimation.
Revised: Recent work (Nair et al., 2022) makes use of Laplace distribution to improve the robustness of maximum likelihood-based uncertainty estimation.

Original: Due to the heavy-tailed property of Laplace distribution, the outlier data produces comparatively less loss and have an insubstantial impact on training.
Revised: Due to the heavy-tailed property of Laplace distribution, the outlier data produces comparatively less loss and have an insubstantial impact on training.

Original: Other than in Euclidean space, Mitianoudis (2012) develops Generalized
Revised: Other than in Euclidean space, Mitianoudis (2012) develops Generalized

Original: Directional Laplacian distribution in S d for the application of audio separation.
Revised: Directional Laplacian distribution in S d for the application of audio separation.

Original: Probabilistic rotation regression Several works focus on utilizing probability distributions on the rotation manifold for rotation uncertainty estimation.
Revised: Probabilistic rotation regression Several works focus on utilizing probability distributions on the rotation manifold for rotation uncertainty estimation.

Original: Prokudin et al.
Revised: Prokudin et al.

Original: (2018) uses the mixture of von Mises distributions (Mardia et al., 2000) over Euler angles using Biternion networks.
Revised: (2018) uses the mixture of von Mises distributions (Mardia et al., 2000) over Euler angles using Biternion networks.

Original: In
Revised: In

Original: Gilitschenski et al.
Revised: Gilitschenski et al.

Original: and
Revised: and

Original: Deng et al.
Revised: Deng et al.

Original: (2022), Bingham distribution over unit quaternion is used to jointly estimate a probability distribution over all axes.
Revised: (2022), Bingham distribution over unit quaternion is used to jointly estimate a probability distribution over all axes.

Original: Mohlin et al.
Revised: Mohlin et al.

Original: (2020) leverages matrix Fisher distribution (Khatri & Mardia, 1977) on SO(3) over rotation matrices for deep rotation regression.
Revised: (2020) leverages matrix Fisher distribution (Khatri & Mardia, 1977) on SO(3) over rotation matrices for deep rotation regression.

Original: Though both bear similar properties with Gaussian distribution in Euclidean space, matrix Fisher distribution benefits from the continuous rotation representation and unconstrained distribution parameters, which yields better performance (Murphy et al., 2021).
Revised: Though both bear similar properties with Gaussian distribution in Euclidean space, matrix Fisher distribution benefits from the continuous rotation representation and unconstrained distribution parameters, which yields better performance (Murphy et al., 2021).

Original: Recently, Murphy et al.
Revised: Recently, Murphy et al.

Original: (2021) introduces a non-parametric implicit pdf over SO(3) , with the distribution properties modeled by the neural network parameters.
Revised: (2021) introduces a non-parametric implicit pdf over SO(3) , with the distribution properties modeled by the neural network parameters.

Original: Implicit-pdf especially does good for modeling rotations of symmetric objects.
Revised: Implicit-pdf especially does good for modeling rotations of symmetric objects.

Original: Non-probabilistic rotation regression The choice of rotation representation is one of the core issues concerning rotation regression.
Revised: Non-probabilistic rotation regression The choice of rotation representation is one of the core issues concerning rotation regression.

Original: The commonly used representations include Euler angles (Kundu et al., 2018; Tulsiani & Malik, 2015), unit quaternion (Kendall & Cipolla, 2017; Kendall et al., 2015; Xiang et al., 2017) and axis-angle (Do et al., 2018; Gao et al., 2018; Ummenhofer et al., 2017), etc .
Revised: The commonly used representations include Euler angles (Kundu et al., 2018; Tulsiani & Malik, 2015), unit quaternion (Kendall & Cipolla, 2017; Kendall et al., 2015; Xiang et al., 2017) and axis-angle (Do et al., 2018; Gao et al., 2018; Ummenhofer et al., 2017), etc .

Original: However, Euler angles may suffer from gimbal lock, and unit quaternions doubly cover the group of SO(3) , which leads to two disconnected local minima.
Revised: However, Euler angles may suffer from gimbal lock, and unit quaternions doubly cover the group of SO(3) , which leads to two disconnected local minima.

Original: Moreover, Zhou et al.
Revised: Moreover, Zhou et al.

Original: (2019) points out that all representations in the real Euclidean spaces of four or fewer dimensions are discontinuous and are not friendly for deep learning.
Revised: (2019) points out that all representations in the real Euclidean spaces of four or fewer dimensions are discontinuous and are not friendly for deep learning.

Original: To this end, the continuous 6D representation with Gram-Schmidt orthogonalization (Zhou et al., 2019) and 9D representation with SVD orthogonalization (Levinson et al., 2020) have been proposed, respectively.
Revised: To this end, the continuous 6D representation with Gram-Schmidt orthogonalization (Zhou et al., 2019) and 9D representation with SVD orthogonalization (Levinson et al., 2020) have been proposed, respectively.

Original: More recently, Chen et al.
Revised: More recently, Chen et al.

Original: (2022) investigates the gradient backpropagation in the backward pass and proposes a SO(3) manifold-aware gradient layer.
Revised: (2022) investigates the gradient backpropagation in the backward pass and proposes a SO(3) manifold-aware gradient layer.

Original:  R EVISIT MATRIX F ISHER DISTRIBUTION 3. M ATRIX F ISHER D ISTRIBUTION
Revised:  R EVISIT MATRIX F ISHER DISTRIBUTION 3. M ATRIX F ISHER D ISTRIBUTION

Original: Matrix Fisher distribution (or von Mises-Fisher matrix distribution) (Khatri & Mardia, 1977) is one of the widely used distributions for probabilistic modeling of rotation matrices.
Revised: Matrix Fisher distribution (or von Mises-Fisher matrix distribution) (Khatri & Mardia, 1977) is one of the widely used distributions for probabilistic modeling of rotation matrices.

Original: Definition 1.
Revised: Definition 1.

Original: Matrix Fisher distribution .
Revised: Matrix Fisher distribution .

Original: The random variable R ∈ SO(3) follows matrix Fisher distribution with parameter A , if its probability density function is defined as
Revised: The random variable R ∈ SO(3) follows matrix Fisher distribution with parameter A , if its probability density function is defined as

Original: [Equation]
Revised: [Equation]

Original: where A ∈ R 3 × 3 is an unconstrained matrix, and F ( A ) ∈ R is the normalization factor.
Revised: where A ∈ R 3 × 3 is an unconstrained matrix, and F ( A ) ∈ R is the normalization factor.

Original: Without further clarification, we denote F as the normalization factor of the corresponding distribution in the remaining of this paper.
Revised: Without further clarification, we denote F as the normalization factor of the corresponding distribution in the remaining of this paper.

Original: We also denote matrix Fisher distribution as R ∼ MF ( A ) .
Revised: We also denote matrix Fisher distribution as R ∼ MF ( A ) .

Original: Suppose the singular value decomposition of matrix A is given by A = U ′ S
Revised: Suppose the singular value decomposition of matrix A is given by A = U ′ S

Original: ( V ′ )
Revised: ( V ′ )

Original: T , proper SVD is defined as A = USV T where
Revised: T , proper SVD is defined as A = USV T where

Original: [Equation]
Revised: [Equation]

Original: The definition of U and V ensures that det( U ) =
Revised: The definition of U and V ensures that det( U ) =

Original: det( V ) =
Revised: det( V ) =

Original: 1 and U , V ∈ SO(3) .
Revised: 1 and U , V ∈ SO(3) .

Original: 3. R ELATIONSHIP BETWEEN M ATRIX F ISHER D ISTRIBUTION IN SO(3) AND G AUSSIAN D ISTRIBUTION IN R
Revised: 3. R ELATIONSHIP BETWEEN M ATRIX F ISHER D ISTRIBUTION IN SO(3) AND G AUSSIAN D ISTRIBUTION IN R

Original: It is shown that matrix Fisher distribution is highly relevant with zero-mean Gaussian distribution near its mode (Lee, 2018a;b).
Revised: It is shown that matrix Fisher distribution is highly relevant with zero-mean Gaussian distribution near its mode (Lee, 2018a;b).

Original: Denote R 0 as the mode of matrix Fisher distribution, and define (cid:101)
Revised: Denote R 0 as the mode of matrix Fisher distribution, and define (cid:101)

Original: R = R T 0 R , the relationship is shown as follows.
Revised: R = R T 0 R , the relationship is shown as follows.

Original: Please refer to supplementary for the proof.
Revised: Please refer to supplementary for the proof.

Original: Proposition 1.
Revised: Proposition 1.

Original: Let Φ = log (cid:101) R ∈ so (3) and ϕ =
Revised: Let Φ = log (cid:101) R ∈ so (3) and ϕ =

Original: Φ ∨ ∈ R 3 .
Revised: Φ ∨ ∈ R 3 .

Original: For rotation matrix R ∈ SO(3) following matrix Fisher distribution , when ∥ R − R 0 ∥ → 0 , ϕ follows zero-mean multivariate
Revised: For rotation matrix R ∈ SO(3) following matrix Fisher distribution , when ∥ R − R 0 ∥ → 0 , ϕ follows zero-mean multivariate

Original: Gaussian distribution .
Revised: Gaussian distribution .

Original:  P ROBABILISTIC R OTATION E STIMATION WITH R OTATION L APLACE D ISTRIBUTION 4. R OTATION L APLACE D ISTRIBUTION
Revised:  P ROBABILISTIC R OTATION E STIMATION WITH R OTATION L APLACE D ISTRIBUTION 4. R OTATION L APLACE D ISTRIBUTION

Original: We get inspiration from multivariate Laplace distribution (Eltoft et al., 2006; Kozubowski et al., 2013), defined as follows.
Revised: We get inspiration from multivariate Laplace distribution (Eltoft et al., 2006; Kozubowski et al., 2013), defined as follows.

Original: Definition 2.
Revised: Definition 2.

Original: Multivariate Laplace distribution.
Revised: Multivariate Laplace distribution.

Original: If means µ = 0 , the d-dimensional multivariate Laplace distribution with covariance matrix Σ is defined as
Revised: If means µ = 0 , the d-dimensional multivariate Laplace distribution with covariance matrix Σ is defined as

Original: [Equation]
Revised: [Equation]

Original: where v = (2 − d ) / 2 and K v is modified Bessel function of the second kind.
Revised: where v = (2 − d ) / 2 and K v is modified Bessel function of the second kind.

Original: We consider three dimensional Laplace distribution of x ∈ R 3 (i.e. d = 3 and v = − 12 ).
Revised: We consider three dimensional Laplace distribution of x ∈ R 3 (i.e. d = 3 and v = − 12 ).

Original: Given the property K − 12 ( ξ ) ∝ ξ − 12 exp( − ξ ) , three dimensional Laplace distribution is defined as
Revised: Given the property K − 12 ( ξ ) ∝ ξ − 12 exp( − ξ ) , three dimensional Laplace distribution is defined as

Original: [Equation]
Revised: [Equation]

Original: In this section, we first give the definition of our proposed Rotation Laplace distribution and then shows its relationship with multivariate Laplace distribution.
Revised: In this section, we first give the definition of our proposed Rotation Laplace distribution and then shows its relationship with multivariate Laplace distribution.

Original: Definition 3.
Revised: Definition 3.

Original: Rotation Laplace distribution.
Revised: Rotation Laplace distribution.

Original: The random variable R ∈ SO(3) follows Rotation
Revised: The random variable R ∈ SO(3) follows Rotation

Original: Laplace distribution with parameter A , if its probability density function is defined as
Revised: Laplace distribution with parameter A , if its probability density function is defined as

Original: [Equation]
Revised: [Equation]

Original: where A ∈ R 3 × 3 is an unconstrained matrix, and S is the diagonal matrix composed of the proper singular values of matrix A , i.e., A = USV T .
Revised: where A ∈ R 3 × 3 is an unconstrained matrix, and S is the diagonal matrix composed of the proper singular values of matrix A , i.e., A = USV T .

Original: We also denote Rotation Laplace distribution as
Revised: We also denote Rotation Laplace distribution as

Original: R ∼ RL ( A ) .
Revised: R ∼ RL ( A ) .

Original: Denote R 0 as the mode of Rotation Laplace distribution and define (cid:101) R = R T 0 R , the relationship between Rotation Laplace distribution and multivariate Laplace distribution is shown as follows.
Revised: Denote R 0 as the mode of Rotation Laplace distribution and define (cid:101) R = R T 0 R , the relationship between Rotation Laplace distribution and multivariate Laplace distribution is shown as follows.

Original: Proposition 2.
Revised: Proposition 2.

Original: Let Φ = log (cid:101) R ∈ so (3) and ϕ =
Revised: Let Φ = log (cid:101) R ∈ so (3) and ϕ =

Original: Φ ∨ ∈ R 3 .
Revised: Φ ∨ ∈ R 3 .

Original: For rotation matrix R ∈ SO(3) following Rotation Laplace distribution , when ∥ R − R 0 ∥ → 0 , ϕ follows zero-mean multivariate
Revised: For rotation matrix R ∈ SO(3) following Rotation Laplace distribution , when ∥ R − R 0 ∥ → 0 , ϕ follows zero-mean multivariate

Original: Laplace distribution .
Revised: Laplace distribution .

Original: Proof.
Revised: Proof.

Original: Apply proper SVD to matrix A as A = USV T .
Revised: Apply proper SVD to matrix A as A = USV T .

Original: For R ∼ RL ( A ) , we have
Revised: For R ∼ RL ( A ) , we have

Original: [Equation]
Revised: [Equation]

Original: With ϕ = (log (cid:101) R ) ∨ ∈ R 3 , (cid:101) R can be parameterized as
Revised: With ϕ = (log (cid:101) R ) ∨ ∈ R 3 , (cid:101) R can be parameterized as

Original: [Equation]
Revised: [Equation]

Original: We follow the common practice (Mohlin et al., 2020; Lee, 2018a) that the Haar measure d R is scaled such that (cid:82) SO (3) d R = 1 and thus the Haar measure is given by
Revised: We follow the common practice (Mohlin et al., 2020; Lee, 2018a) that the Haar measure d R is scaled such that (cid:82) SO (3) d R = 1 and thus the Haar measure is given by

Original: [Equation]
Revised: [Equation]

Original: Also, (cid:101) R expanded at ϕ = 0 is computed as (cid:101) R =
Revised: Also, (cid:101) R expanded at ϕ = 0 is computed as (cid:101) R =

Original: I + ˆ ϕ + 12 ˆ ϕ 

Revised: I + ˆ ϕ + 12 ˆ ϕ

Original: + O ( ∥ ϕ ∥ 3 ) , we have
Revised: + O ( ∥ ϕ ∥ 3 ) , we have

Original: [Equation]
Revised: [Equation]

Original: where ( µ 1 , µ 2 , µ 3 ) T = V T ϕ , and
Revised: where ( µ 1 , µ 2 , µ 3 ) T = V T ϕ , and

Original: [Equation]
Revised: [Equation]

Original: =
Revised: =

Original: [Equation]
Revised: [Equation]

Original: Considering Eq.
Revised: Considering Eq.

Original: 3, 4 and 6, we have
Revised: 3, 4 and 6, we have

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: When ∥ R − R 0 ∥ → 0 , we have ∥ (cid:101) R − I ∥ → 0 and ϕ → 0 , so Eq.
Revised: When ∥ R − R 0 ∥ → 0 , we have ∥ (cid:101) R − I ∥ → 0 and ϕ → 0 , so Eq.

Original: 7 follows the multivariate Laplace distribution with the covariance matrix as Σ , where Σ = 4 V diag( 1 s 2 + s 3 , 1 s 1 + s 3 , 1 s 1 + s 2 ) V T .
Revised: 7 follows the multivariate Laplace distribution with the covariance matrix as Σ , where Σ = 4 V diag( 1 s 2 + s 3 , 1 s 1 + s 3 , 1 s 1 + s 2 ) V T .

Original: Rotation Laplace distribution bears similar properties with matrix Fisher distribution.
Revised: Rotation Laplace distribution bears similar properties with matrix Fisher distribution.

Original: Its mode is computed as UV T .
Revised: Its mode is computed as UV T .

Original: The columns of U and the proper singular values S describe the orientation and the strength of dispersions, respectively.
Revised: The columns of U and the proper singular values S describe the orientation and the strength of dispersions, respectively.

Original: 4. N EGATIVE L OG - LIKELIHOOD L OSS
Revised: 4. N EGATIVE L OG - LIKELIHOOD L OSS

Original: Given a collection of observations X
Revised: Given a collection of observations X

Original: = { x i } and the associated ground truth rotations R
Revised: = { x i } and the associated ground truth rotations R

Original: =
Revised: =

Original: { R i } , we aim at training the network to best estimate the parameter A of Rotation Laplace distribution.
Revised: { R i } , we aim at training the network to best estimate the parameter A of Rotation Laplace distribution.

Original: This is achieved by maximizing a likelihood function so that, under our probabilistic model, the observed data is most probable, which is known as maximum likelihood estimation (MLE).
Revised: This is achieved by maximizing a likelihood function so that, under our probabilistic model, the observed data is most probable, which is known as maximum likelihood estimation (MLE).

Original: We use the negative log-likelihood of R x as the loss function:
Revised: We use the negative log-likelihood of R x as the loss function:

Original: [Equation]
Revised: [Equation]

Original: 4. D ISCRETE A PPROXIMATION OF THE N ORMALIZATION F ACTOR
Revised: 4. D ISCRETE A PPROXIMATION OF THE N ORMALIZATION F ACTOR

Original: Efficiently and accurately estimating the normalization factor for distributions over SO(3) is nontrivial.
Revised: Efficiently and accurately estimating the normalization factor for distributions over SO(3) is nontrivial.

Original: Inspired by Murphy et al.
Revised: Inspired by Murphy et al.

Original: (2021), we approximate the normalization factor of Rotation
Revised: (2021), we approximate the normalization factor of Rotation

Original: Laplace distribution through equivolumetric discretization over SO(3) manifold.
Revised: Laplace distribution through equivolumetric discretization over SO(3) manifold.

Original: We employ the discretization method introduced in Yershova et al.
Revised: We employ the discretization method introduced in Yershova et al.

Original: (2010), which starts with the equal area grids on the 2-sphere (Gorski et al., 2005) and covers SO(3) by threading a great circle through each point on the surface of a 2-sphere with Hopf fibration.
Revised: (2010), which starts with the equal area grids on the 2-sphere (Gorski et al., 2005) and covers SO(3) by threading a great circle through each point on the surface of a 2-sphere with Hopf fibration.

Original: Concretely, we discretize SO(3) space into a finite set of equivolumetric grids G
Revised: Concretely, we discretize SO(3) space into a finite set of equivolumetric grids G

Original: =
Revised: =

Original: { R | R ∈ SO(3) } , the normalization factor of Laplace Rotation distribution is computed as
Revised: { R | R ∈ SO(3) } , the normalization factor of Laplace Rotation distribution is computed as

Original: [Equation]
Revised: [Equation]

Original: where ∆ R i =
Revised: where ∆ R i =

Original: [Equation]
Revised: [Equation]

Original: SO
Revised: SO

Original: [Equation]
Revised: [Equation]

Original: |
Revised: |

Original: [Equation]
Revised: [Equation]

Original: | =
Revised: | =

Original: [Equation]
Revised: [Equation]

Original: Similar to matrix Fisher distribution, the normalization factor of Rotation Laplace distribution is only determined by the proper singular values S of the parameter A , i.e., F ( A ) is merely a function of three parameters.
Revised: Similar to matrix Fisher distribution, the normalization factor of Rotation Laplace distribution is only determined by the proper singular values S of the parameter A , i.e., F ( A ) is merely a function of three parameters.

Original: For computational efficiency, we further build a lookup table w.r.t.
Revised: For computational efficiency, we further build a lookup table w.r.t.

Original: the proper singular values for both the forward and backward pass, where each element in the table is the corresponding factor and gradient computed through discretization.
Revised: the proper singular values for both the forward and backward pass, where each element in the table is the corresponding factor and gradient computed through discretization.

Original: We then apply trilinear interpolation to obtain the factor and gradient for the query singular values (Gilitschenski et al., 2019; Deng et al., 2022).
Revised: We then apply trilinear interpolation to obtain the factor and gradient for the query singular values (Gilitschenski et al., 2019; Deng et al., 2022).

Original: The use of lookup tables avoids the online calculation and makes the process fast ( ∼ 1ms for forward and backward, respectively).
Revised: The use of lookup tables avoids the online calculation and makes the process fast ( ∼ 1ms for forward and backward, respectively).

Original: For computing each element in the table, we discretize SO(3) space into about 300k equivolumetric grids.
Revised: For computing each element in the table, we discretize SO(3) space into about 300k equivolumetric grids.

Original: 4. Q UATERNION L APLACE D ISTRIBUTION
Revised: 4. Q UATERNION L APLACE D ISTRIBUTION

Original: In this section, we introduce our extension of Laplace-inspired distribution for quaternions, namely,
Revised: In this section, we introduce our extension of Laplace-inspired distribution for quaternions, namely,

Original: Quaternion Laplace distribution.
Revised: Quaternion Laplace distribution.

Original: Definition 4.
Revised: Definition 4.

Original: Quaternion Laplace distribution.
Revised: Quaternion Laplace distribution.

Original: The random variable q ∈ S 3 follows Quaternion
Revised: The random variable q ∈ S 3 follows Quaternion

Original: Laplace distribution with parameter M and Z , if its probability density function is defined as
Revised: Laplace distribution with parameter M and Z , if its probability density function is defined as

Original: [Equation]
Revised: [Equation]

Original: where M ∈ O (4) is a 4 × 4 orthogonal matrix, and Z = diag(0 , z 1 , z 2 , z 3 ) is a 4 × 4 diagonal matrix with 0 ≥ z 1 ≥ z 2 ≥ z 3 .
Revised: where M ∈ O (4) is a 4 × 4 orthogonal matrix, and Z = diag(0 , z 1 , z 2 , z 3 ) is a 4 × 4 diagonal matrix with 0 ≥ z 1 ≥ z 2 ≥ z 3 .

Original: We also denote Quaternion Laplace distribution as q ∼ QL ( M , Z ) .
Revised: We also denote Quaternion Laplace distribution as q ∼ QL ( M , Z ) .

Original: Proposition 3.
Revised: Proposition 3.

Original: Denote q 0 as the mode of Quaternion Laplace distribution.
Revised: Denote q 0 as the mode of Quaternion Laplace distribution.

Original: Let π be the tangent space of S 3 at q 0 , and π ( x ) ∈ R 4 be the projection of x ∈ R 4 on π .
Revised: Let π be the tangent space of S 3 at q 0 , and π ( x ) ∈ R 4 be the projection of x ∈ R 4 on π .

Original: For quaternion q ∈
Revised: For quaternion q ∈

Original: Sfollowing Bingham distribution / Quaternion Laplace distribution , when q → q 0 , π ( q ) follows zero-mean multivariate Gaussian distribution / zero-mean multivariate Laplace distribution .
Revised: Sfollowing Bingham distribution / Quaternion Laplace distribution , when q → q 0 , π ( q ) follows zero-mean multivariate Gaussian distribution / zero-mean multivariate Laplace distribution .

Original: Both Bingham distribution and Quaternion Laplace distribution exhibit antipodal symmetry on S 3 , i.e., p ( q ) =
Revised: Both Bingham distribution and Quaternion Laplace distribution exhibit antipodal symmetry on S 3 , i.e., p ( q ) =

Original: p ( − q ) , which captures the nature that the quaternions q and − q represent the same rotation on SO(3) .
Revised: p ( − q ) , which captures the nature that the quaternions q and − q represent the same rotation on SO(3) .

Original: Proposition 4.
Revised: Proposition 4.

Original: Denote γ as the standard transformation from unit quaternions to corresponding rotation matrices.
Revised: Denote γ as the standard transformation from unit quaternions to corresponding rotation matrices.

Original: For rotation matrix R ∈ SO(3) following Rotation Laplace distribution , q = γ − 1 ( R ) ∈ S 3 follows Quaternion Laplace distribution .
Revised: For rotation matrix R ∈ SO(3) following Rotation Laplace distribution , q = γ − 1 ( R ) ∈ S 3 follows Quaternion Laplace distribution .

Original: Prop. 4 shows that our proposed Rotation Laplace distribution is equivalent to Quaternion Laplace distribution, similar to the equivalence of matrix Fisher distribution and Bingham distribution (Prentice, 1986), demonstrating the consistency of our derivations.
Revised: Prop. 4 shows that our proposed Rotation Laplace distribution is equivalent to Quaternion Laplace distribution, similar to the equivalence of matrix Fisher distribution and Bingham distribution (Prentice, 1986), demonstrating the consistency of our derivations.

Original: Please see supplementary for the proofs to the above propositions.
Revised: Please see supplementary for the proofs to the above propositions.

Original: The normalization factor of Quaternion Laplace distribution is also approximated by dense dis- cretization, and a pre-computed lookup table is used to avoid online computations.
Revised: The normalization factor of Quaternion Laplace distribution is also approximated by dense dis- cretization, and a pre-computed lookup table is used to avoid online computations.

Original: [Equation]
Revised: [Equation]

Original: where G q = (cid:8) q | q ∈ S 3 (cid:9) denotes the set of equivolumetric grids and ∆ q i = (cid:72) S 3 d q |G q |
Revised: where G q = (cid:8) q | q ∈ S 3 (cid:9) denotes the set of equivolumetric grids and ∆ q i = (cid:72) S 3 d q |G q |

Original: = 2 π 2 |G q | .
Revised: = 2 π 2 |G q | .

Original:  E XPERIMENT
Revised:  E XPERIMENT

Original: Following the previous state-of-the-arts (Murphy et al., 2021; Mohlin et al., 2020), we evaluate our method on the task of object rotation estimation from single RGB images, where object rotation is the relative rotation between the input object and the object in the canonical pose.
Revised: Following the previous state-of-the-arts (Murphy et al., 2021; Mohlin et al., 2020), we evaluate our method on the task of object rotation estimation from single RGB images, where object rotation is the relative rotation between the input object and the object in the canonical pose.

Original: Concerning this task, we find two kinds of independent research tracks with slightly different evaluation settings.
Revised: Concerning this task, we find two kinds of independent research tracks with slightly different evaluation settings.

Original: One line of research focuses on probabilistic rotation regression with different parametric or nonparametric distributions on SO(3)
Revised: One line of research focuses on probabilistic rotation regression with different parametric or nonparametric distributions on SO(3)

Original: (Prokudin et al., 2018;
Revised: (Prokudin et al., 2018;

Original: Gilitschenski et al., 2019; Deng et al., 2022; Mohlin et al., 2020; Murphy et al., 2021), and the other non-probabilistic track proposes multiple rotation representations (Zhou et al., 2019; Levinson et al., 2020; Peretroukhin et al., 2020) or improves the gradient of backpropagation (Chen et al., 2022).
Revised: Gilitschenski et al., 2019; Deng et al., 2022; Mohlin et al., 2020; Murphy et al., 2021), and the other non-probabilistic track proposes multiple rotation representations (Zhou et al., 2019; Levinson et al., 2020; Peretroukhin et al., 2020) or improves the gradient of backpropagation (Chen et al., 2022).

Original: To fully demonstrate the capacity of our Rotation Laplace distribution, we leave the baselines in their original optimal states and adapt our method to follow the common experimental settings in each track, respectively.
Revised: To fully demonstrate the capacity of our Rotation Laplace distribution, we leave the baselines in their original optimal states and adapt our method to follow the common experimental settings in each track, respectively.

Original: 5. D ATASETS & E VALUATION M ETRICS
Revised: 5. D ATASETS & E VALUATION M ETRICS

Original: Datasets ModelNet10-SO3 (Liao et al., 2019) is a commonly used synthetic dataset for single image rotation estimation containing 10 object classes.
Revised: Datasets ModelNet10-SO3 (Liao et al., 2019) is a commonly used synthetic dataset for single image rotation estimation containing 10 object classes.

Original: It is synthesized by rendering the CAD models of ModelNet-10 dataset (Wu et al., 2015) that are rotated by uniformly sampled rotations in SO(3) .
Revised: It is synthesized by rendering the CAD models of ModelNet-10 dataset (Wu et al., 2015) that are rotated by uniformly sampled rotations in SO(3) .

Original: Pascal3D+ (Xiang et al., 2014) is a popular benchmark on real-world images for pose estimation.
Revised: Pascal3D+ (Xiang et al., 2014) is a popular benchmark on real-world images for pose estimation.

Original: It covers 12 common daily object categories.
Revised: It covers 12 common daily object categories.

Original: The images in Pascal3D+ dataset are sourced from Pascal VOC and ImageNet datasets, and are split into ImageNet train, ImageNet val,
Revised: The images in Pascal3D+ dataset are sourced from Pascal VOC and ImageNet datasets, and are split into ImageNet train, ImageNet val,

Original: PascalVOC train, and PascalVOC val sets.
Revised: PascalVOC train, and PascalVOC val sets.

Original: [Table]
Revised: [Table]

Original: [Table]
Revised: [Table]

Original: Evaluation metrics We evaluate our experiments with the geodesic distance of the network prediction and the ground truth.
Revised: Evaluation metrics We evaluate our experiments with the geodesic distance of the network prediction and the ground truth.

Original: This metric returns the angular error and we measure it in degrees.
Revised: This metric returns the angular error and we measure it in degrees.

Original: In addition, we report the prediction accuracy within the given error threshold.
Revised: In addition, we report the prediction accuracy within the given error threshold.

Original: 5. C OMPARISONS WITH P ROBABILISTIC M ETHODS 5.2. E VALUATION S ETUP
Revised: 5. C OMPARISONS WITH P ROBABILISTIC M ETHODS 5.2. E VALUATION S ETUP

Original: Settings In this section, we follow the experiment settings of the latest work (Murphy et al., 2021) and quote its reported numbers for baselines.
Revised: Settings In this section, we follow the experiment settings of the latest work (Murphy et al., 2021) and quote its reported numbers for baselines.

Original: Specifically, we train one single model for all categories of each dataset.
Revised: Specifically, we train one single model for all categories of each dataset.

Original: For Pascal3D+ dataset, we follow Murphy et al.
Revised: For Pascal3D+ dataset, we follow Murphy et al.

Original: (2021) to use (the more challenging) PascalVOC val as test set.
Revised: (2021) to use (the more challenging) PascalVOC val as test set.

Original: Note that Murphy et al.
Revised: Note that Murphy et al.

Original: (2021) only measure the coarsescale accuracy (e.g., Acc@30 ◦ ) which may not adequately satisfy the downstream tasks (Wang et al., 2019b; Fang et al., 2020).
Revised: (2021) only measure the coarsescale accuracy (e.g., Acc@30 ◦ ) which may not adequately satisfy the downstream tasks (Wang et al., 2019b; Fang et al., 2020).

Original: To facilitate finer-scale comparisons (e.g., Acc@5 ◦ ), we further re-run several recent baselines and report the reproduced results in parentheses ( · ).
Revised: To facilitate finer-scale comparisons (e.g., Acc@5 ◦ ), we further re-run several recent baselines and report the reproduced results in parentheses ( · ).

Original: Baselines We compare our method to recent works which utilize probabilistic distributions on
Revised: Baselines We compare our method to recent works which utilize probabilistic distributions on

Original: SO(3) for the purpose of pose estimation.
Revised: SO(3) for the purpose of pose estimation.

Original: In concrete, the baselines are with mixture of von Mises distributions Prokudin et al.
Revised: In concrete, the baselines are with mixture of von Mises distributions Prokudin et al.

Original: (2018) , Bingham distribution Gilitschenski et al.
Revised: (2018) , Bingham distribution Gilitschenski et al.

Original: ; Deng et al.
Revised: ; Deng et al.

Original: (2022) , matrix Fisher distribution Mohlin et al.
Revised: (2022) , matrix Fisher distribution Mohlin et al.

Original: (2020) and Implicit-PDF Murphy et al.
Revised: (2020) and Implicit-PDF Murphy et al.

Original: We also compare to the spherical regression work of Liao et al.
Revised: We also compare to the spherical regression work of Liao et al.

Original: as Murphy et al.
Revised: as Murphy et al.

Original: (2021) does.
Revised: (2021) does.

Original: 5.2. R ESULTS
Revised: 5.2. R ESULTS

Original: Table 1 shows the quantitative comparisons of our method and baselines on ModelNet10-SO dataset.
Revised: Table 1 shows the quantitative comparisons of our method and baselines on ModelNet10-SO dataset.

Original: From the multiple evaluation metrics, we can see that maximum likelihood estimation with the assumption of Rotation Laplace distribution significantly outperforms the other distributions for rotation, including matrix Fisher distribution (Mohlin et al., 2020), Bingham distribution (Do et al., 2018) and von-Mises distribution (Prokudin et al., 2018).
Revised: From the multiple evaluation metrics, we can see that maximum likelihood estimation with the assumption of Rotation Laplace distribution significantly outperforms the other distributions for rotation, including matrix Fisher distribution (Mohlin et al., 2020), Bingham distribution (Do et al., 2018) and von-Mises distribution (Prokudin et al., 2018).

Original: Our method also gets superior performance than the non-parametric implicit-PDF (Murphy et al., 2021).
Revised: Our method also gets superior performance than the non-parametric implicit-PDF (Murphy et al., 2021).

Original: Especially, our method improves the fine-scale Acc@3 ◦ and Acc@5 ◦ accuracy by a large margin, showing its capacity to precisely model the target distribution.
Revised: Especially, our method improves the fine-scale Acc@3 ◦ and Acc@5 ◦ accuracy by a large margin, showing its capacity to precisely model the target distribution.

Original: The experiments on Pascal3D+ dataset are shown in Table 2, where our Rotation Laplace distribution outperforms all the baselines.
Revised: The experiments on Pascal3D+ dataset are shown in Table 2, where our Rotation Laplace distribution outperforms all the baselines.

Original: While our method gets reasonably good performance on the median
Revised: While our method gets reasonably good performance on the median

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

Original: error and coarser-scale accuracy, we do not find a similar impressive improvement on fine-scale metrics as in ModelNet10-SO3 dataset.
Revised: error and coarser-scale accuracy, we do not find a similar impressive improvement on fine-scale metrics as in ModelNet10-SO3 dataset.

Original: We suspect it is because the imperfect human annotations of real-world images may lead to comparatively noisy ground truths, increasing the difficulty for networks to get rather close predictions with GT labels.
Revised: We suspect it is because the imperfect human annotations of real-world images may lead to comparatively noisy ground truths, increasing the difficulty for networks to get rather close predictions with GT labels.

Original: Nevertheless, our method still manages to obtain superior performance, which illustrates the robustness of our Rotation Laplace distribution
Revised: Nevertheless, our method still manages to obtain superior performance, which illustrates the robustness of our Rotation Laplace distribution

Original: . 5. C OMPARISONS WITH N ON - PROBABILISTIC M ETHODS 5.3. E VALUATION S ETUP
Revised: . 5. C OMPARISONS WITH N ON - PROBABILISTIC M ETHODS 5.3. E VALUATION S ETUP

Original: Settings For comparisons with non-probabilistic methods, we follow the latest work of Chen et al.
Revised: Settings For comparisons with non-probabilistic methods, we follow the latest work of Chen et al.

Original: (2022) to learn a network for each category.
Revised: (2022) to learn a network for each category.

Original: For Pascal3D+ dataset, we follow Chen et al.
Revised: For Pascal3D+ dataset, we follow Chen et al.

Original: (2022) to use ImageNet val as our test set.
Revised: (2022) to use ImageNet val as our test set.

Original: We use the same evaluation metrics as in Chen et al.
Revised: We use the same evaluation metrics as in Chen et al.

Original: and quote its reported numbers for baselines.
Revised: and quote its reported numbers for baselines.

Original: Baselines We compare to multiple baselines that leverage different rotation representations to directly regress the prediction given input images, including 6D (Zhou et al., 2019), 9D / 9D-Inf (Levinson et al., 2020) and 10D (Peretroukhin et al., 2020).
Revised: Baselines We compare to multiple baselines that leverage different rotation representations to directly regress the prediction given input images, including 6D (Zhou et al., 2019), 9D / 9D-Inf (Levinson et al., 2020) and 10D (Peretroukhin et al., 2020).

Original: We also include regularized projective manifold gradient ( RPMG ) series of methods (Chen et al., 2022).
Revised: We also include regularized projective manifold gradient ( RPMG ) series of methods (Chen et al., 2022).

Original: 5.3. R ESULTS
Revised: 5.3. R ESULTS

Original: We report the numerical results of our method and on-probabilistic baselines on ModelNet10-SO dataset in Table 3.
Revised: We report the numerical results of our method and on-probabilistic baselines on ModelNet10-SO dataset in Table 3.

Original: Our method obtains a clear superior performance to the best competitor under all the metrics among all the categories.
Revised: Our method obtains a clear superior performance to the best competitor under all the metrics among all the categories.

Original: Note that we train a model for each category (so do all the baselines), thus our performance in Table 3 is better than Table 1 where one model is trained for the whole dataset.
Revised: Note that we train a model for each category (so do all the baselines), thus our performance in Table 3 is better than Table 1 where one model is trained for the whole dataset.

Original: The results on Pascal3D+ dataset are shown in Table 4 where our method with
Revised: The results on Pascal3D+ dataset are shown in Table 4 where our method with

Original: Rotation Laplace distribution achieves state-of-the-art performance.
Revised: Rotation Laplace distribution achieves state-of-the-art performance.

Original: [Figure]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: 5. Q UALITATIVE R ESULTS
Revised: 5. Q UALITATIVE R ESULTS

Original: We visualize the predicted distributions in Figure 2 with the visualization method of Mohlin et al.
Revised: We visualize the predicted distributions in Figure 2 with the visualization method in Mohlin et al.

Original: As shown in the figure, the predicted distributions can exhibit high uncertainty when the object has rotational symmetry, leading to near 180 ◦ errors (a-c)
Revised: As shown in the figure, the predicted distributions can exhibit high uncertainty when the object has rotational symmetry, leading to near 180 ◦ errors (a-c)

Original: [Table]
Revised: [Table]

Original: or the input image is with low resolution (d).
Revised: or the input image is with low resolution (d).

Original: Subfigure (e-f) show cases with high certainty and reasonably low errors.
Revised: Subfigure (e-f) show cases with high certainty and reasonably low errors.

Original: Please refer to the supplementary for more visual results.
Revised: Please refer to the supplementary for more visual results.

Original: 5. I MPLEMENTATION D ETAILS
Revised: 5. I MPLEMENTATION D ETAILS

Original: For fair comparisons, we follow the implementation designs of Mohlin et al.
Revised: For fair comparisons, we follow the implementation designs of Mohlin et al.

Original: and merely change the distribution from matrix Fisher distribution to our Rotation Laplace distribution.
Revised: and merely change the distribution from matrix Fisher distribution to our Rotation Laplace distribution.

Original: For numerical stability, we clip tr( S − A T R ) by max(1e − 8 , tr( S − A T R )) for Eq.2.
Revised: For numerical stability, we clip tr( S − A T R ) by max(1e − 8 , tr( S − A T R )) for Eq.2.

Original: Please refer to supplementary for more details.
Revised: Please refer to supplementary for more details.

Original: 5. C OMPARISONS OF R OTATION L APLACE D ISTRIBUTION AND Q UATERNION L APLACE D ISTRIBUTION
Revised: 5. C OMPARISONS OF R OTATION L APLACE D ISTRIBUTION AND Q UATERNION L APLACE D ISTRIBUTION

Original: For the completeness of experiments, we also compare our proposed Quaternion Laplace distribution and Bingham distribution and report the performance in Table 5.
Revised: For the completeness of experiments, we also compare our proposed Quaternion Laplace distribution and Bingham distribution and report the performance in Table 5.

Original: As shown in the table, Quaternion
Revised: As shown in the table, Quaternion

Original: Laplace distribution consistently achieves superior performance than its competitor, which validates the effectiveness of our Laplace-inspired derivations.
Revised: Laplace distribution consistently achieves superior performance than its competitor, which validates the effectiveness of our Laplace-inspired derivations.

Original: However, its rotation error is in general larger than Rotation Laplace distribution, since its rotation representation, quaternion, is not a continuous representation, as pointed in Zhou et al.
Revised: However, its rotation error is in general larger than Rotation Laplace distribution, since its rotation representation, quaternion, is not a continuous representation, as pointed in Zhou et al.

Original: (2019), thus leading to inferior performance.
Revised: (2019), thus leading to inferior performance.

Original:  C ONCLUSION
Revised:  C ONCLUSION

Original: In this paper, we draw inspiration from multivariant Laplace distribution and derive two novel distributions for probabilistic rotation regression, namely, Rotation Laplace distribution for rotation matrices on SO(3) and Quaternion Laplace distribution for quaternions on S 3 .
Revised: In this paper, we draw inspiration from multivariant Laplace distribution and derive two novel distributions for probabilistic rotation regression, namely, Rotation Laplace distribution for rotation matrices on SO(3) and Quaternion Laplace distribution for quaternions on S 3 .

Original: Extensive comparisons with both probabilistic and non-probabilistic baselines on ModelNet10-SO3 and Pascal3D+ datasets demonstrate the effectiveness and advantages of our proposed distributions.
Revised: Extensive comparisons with both probabilistic and non-probabilistic baselines on ModelNet10-SO3 and Pascal3D+ datasets demonstrate the effectiveness and advantages of our proposed distributions.

Original: A N OTATIONS AND D EFINITIONS A. N OTATIONS FOR L IE A LGEBRA AND E XPONENTIAL & L OGARITHM M AP
Revised: A N OTATIONS AND D EFINITIONS A. N OTATIONS FOR L IE A LGEBRA AND E XPONENTIAL & L OGARITHM M AP

Original: This paper follows the common notations for Lie algebra and exponential & logarithm map (Lee, 2018a;
Revised: This paper follows the common notations for Lie algebra and exponential & logarithm map (Lee, 2018a;

Original: Teed & Deng, 2021; Sola et al., 2018).
Revised: Teed & Deng, 2021; Sola et al., 2018).

Original: The three-dimensional special orthogonal group SO(3) is defined as
Revised: The three-dimensional special orthogonal group SO(3) is defined as

Original: [Equation]
Revised: [Equation]

Original: The Lie algebra of SO(3) , denoted by so (3) , is the tangent space of SO(3) at I , given by
Revised: The Lie algebra of SO(3) , denoted by so (3) , is the tangent space of SO(3) at I , given by

Original: [Equation]
Revised: [Equation]

Original: so (3) is identified with ( R 3 , × ) by the hat ∧ map and the vee ∨ map defined as
Revised: so (3) is identified with ( R 3 , × ) by the hat ∧ map and the vee ∨ map defined as

Original: [Equation]
Revised: [Equation]

Original: The exponential map, taking skew symmetric matrices to rotation matrices is given by
Revised: The exponential map, taking skew symmetric matrices to rotation matrices is given by

Original: [Equation]
Revised: [Equation]

Original: where θ = ∥ ϕ ∥ .
Revised: where θ = ∥ ϕ ∥ .

Original: The exponential map can be inverted by the logarithm map, going from SO(3) to so (3) as log( R
Revised: The exponential map can be inverted by the logarithm map, going from SO(3) to so (3) as log( R

Original: [Equation]
Revised: [Equation]

Original: ) , where θ = arccos tr( R ) − 1.
Revised: ) , where θ = arccos tr( R ) − 1.

Original: A. H AAR M EASURE
Revised: A. H AAR M EASURE

Original: To evaluate the normalization factors and therefore the probability density functions, the measure d R on SO(3) needs to be defined.
Revised: To evaluate the normalization factors and therefore the probability density functions, the measure d R on SO(3) needs to be defined.

Original: For the Lie group SO(3) , the commonly used bi-invariant measure is referred to as Haar measure (Haar, 1933; James, 1999).
Revised: For the Lie group SO(3) , the commonly used bi-invariant measure is referred to as Haar measure (Haar, 1933; James, 1999).

Original: Haar measure is unique up to scalar multiples (Chirikjian, 2000) and we follow the common practice (Mohlin et al., 2020; Lee, 2018a) that the Haar measure d R is scaled such that (cid:82) SO(3)
Revised: Haar measure is unique up to scalar multiples (Chirikjian, 2000) and we follow the common practice (Mohlin et al., 2020; Lee, 2018a) that the Haar measure d R is scaled such that (cid:82) SO(3)

Original: d R = 1 .
Revised: d R = 1 .

Original: B M ORE A NALYSIS ON G RADIENT W . R . T . O UTLIERS
Revised: B M ORE A NALYSIS ON G RADIENT W . R . T . O UTLIERS

Original: In the task of rotation regression, predictions with really large errors (e.g., 180 ◦ error) are fairly observed due to rotational ambiguity or lack of discriminate visual features.
Revised: In the task of rotation regression, predictions with really large errors (e.g., 180 ◦ error) are fairly observed due to rotational ambiguity or lack of discriminate visual features.

Original: Properly handling these outliers during training is one of the keys to success in probabilistic modeling of rotations.
Revised: Properly handling these outliers during training is one of the keys to success in probabilistic modeling of rotations.

Original: In Figure 3, for matrix Fisher distribution and Rotation Laplace distribution, we visualize the gradient magnitudes ∥
Revised: In Figure 3, for matrix Fisher distribution and Rotation Laplace distribution, we visualize the gradient magnitudes ∥

Original: ∂ L /∂ (distribution param.)
Revised: ∂ L /∂ (distribution param.)

Original: ∥ w.r.t.
Revised: ∥ w.r.t.

Original: the prediction errors on ModelNet10-SO dataset after convergence, where each point is a data point in the test set.
Revised: the prediction errors on ModelNet10-SO dataset after convergence, where each point is a data point in the test set.

Original: As shown in the figure, for matrix Fisher distribution, predictions with larger errors clearly yield larger gradient magnitudes, and those with near 180 ◦ errors (the outliers) have the biggest impact.
Revised: As shown in the figure, for matrix Fisher distribution, predictions with larger errors clearly yield larger gradient magnitudes, and those with near 180 ◦ errors (the outliers) have the biggest impact.

Original: Given that outliers may be inevitable and hard to be fixed, they may severely disturb the training process and the sensitivity to outliers can result in a poor fit (Murphy, 2012; Nair et al., 2022).
Revised: Given that outliers may be inevitable and hard to be fixed, they may severely disturb the training process and the sensitivity to outliers can result in a poor fit (Murphy, 2012; Nair et al., 2022).

Original: In contrast, for our Rotation
Revised: In contrast, for our Rotation

Original: Laplace distribution, the gradient magnitudes are not affected by the prediction errors much, leading to a stable learning process.
Revised: Laplace distribution, the gradient magnitudes are not affected by the prediction errors much, leading to a stable learning process.

Original: Consistent results can also be seen in Figure 1 of the main paper, where the red dots illustrate the sum of the gradient magnitude over the population within an interval of prediction errors.
Revised: Consistent results can also be seen in Figure 1 of the main paper, where the red dots illustrate the sum of the gradient magnitude over the population within an interval of prediction errors.

Original: We argue that, at convergence, the gradient should focus more on the large population with low errors rather than fixing the unavoidable large errors.
Revised: We argue that, at convergence, the gradient should focus more on the large population with low errors rather than fixing the unavoidable large errors.

Original: C E XPERIMENTS ON M ODEL N ET 10-SO3 D ATASET WITH O UTLIER I NJECTIONS
Revised: C E XPERIMENTS ON M ODEL N ET 10-SO3 D ATASET WITH O UTLIER I NJECTIONS

Original: To further demonstrate the robustness of our distribution, we manually inject outliers to the perfectly labeled synthetic dataset and compare Rotation Laplace distribution with matrix Fisher distribution.
Revised: To further demonstrate the robustness of our distribution, we manually inject outliers to the perfectly labeled synthetic dataset and compare Rotation Laplace distribution with matrix Fisher distribution.

Original: Specifically, we randomly choose 1%, 5%, 10% and 30% images from the training set of
Revised: Specifically, we randomly choose 1%, 5%, 10% and 30% images from the training set of

Original: ModelNet10-SO3 dataset respectively, and apply a random rotation in SO(3) to the given ground truth.
Revised: ModelNet10-SO3 dataset respectively, and apply a random rotation in SO(3) to the given ground truth.

Original: Thus, the chosen images become outliers in the dataset due to the perturbed annotations.
Revised: Thus, the chosen images become outliers in the dataset due to the perturbed annotations.

Original: We fix the processed dataset for different methods.
Revised: We fix the processed dataset for different methods.

Original: The results on the perturbed dataset are shown in Table 6 and Figure 4, where our method consistently outperforms matrix Fisher distribution under different levels of perturbations.
Revised: The results on the perturbed dataset are shown in Table 6 and Figure 4, where our method consistently outperforms matrix Fisher distribution under different levels of perturbations.

Original: More importantly, as shown in Figure 4, our method clearly better tolerates the outliers, resulting in less performance degradation and remains a reasonable performance even under intense perturbations.
Revised: More importantly, as shown in Figure 4, our method clearly better tolerates the outliers, resulting in less performance degradation and remains a reasonable performance even under intense perturbations.

Original: For example, Acc@30 ◦ of matrix Fisher distribution greatly drops from 0.751 to 0.467 with 30% outliers, while that of our method merely goes down from 0.770 to 0.700, which shows the superior robustness of our method.
Revised: For example, Acc@30 ◦ of matrix Fisher distribution greatly drops from 0.751 to 0.467 with 30% outliers, while that of our method merely goes down from 0.770 to 0.700, which shows the superior robustness of our method.

Original: [Table]
Revised: [Table]

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

Original: D U NCERTAINTY QUANTIFICATION MEASURED BY DISTRIBUTION ENTROPY
Revised: D U NCERTAINTY QUANTIFICATION MEASURED BY DISTRIBUTION ENTROPY

Original: Probabilistic modeling of rotation naturally models the uncertainty information of rotation regression.
Revised: Probabilistic modeling of rotation naturally models the uncertainty information of rotation regression.

Original: Yin et al.
Revised: Yin et al.

Original: (2022) proposes to use the entropy of the distribution as an uncertainty measure.
Revised: (2022) proposes to use the entropy of the distribution as an uncertainty measure.

Original: We adopt it as the uncertainty indicator of Rotation Laplace distribution and plot the relationship between the error of the prediction and the corresponding distribution entropy on the testset of
Revised: We adopt it as the uncertainty indicator of Rotation Laplace distribution and plot the relationship between the error of the prediction and the corresponding distribution entropy on the testset of

Original: ModelNet10-SO3 and Pascal3D+ datasets in Figure 5.
Revised: ModelNet10-SO3 and Pascal3D+ datasets in Figure 5.

Original: As shown in the figure, predictions with lower entropies (i.e., lower uncertainty) clearly achieve higher accuracy than predictions with large entropies, demonstrating the ability of uncertainty estimation of our Rotation Laplace distribution.
Revised: As shown in the figure, predictions with lower entropies (i.e., lower uncertainty) clearly achieve higher accuracy than predictions with large entropies, demonstrating the ability of uncertainty estimation of our Rotation Laplace distribution.

Original: We compute the entropy via discretization, where SO(3) space is quantized into a finite set of equivolumetric girds G =
Revised: We compute the entropy via discretization, where SO(3) space is quantized into a finite set of equivolumetric girds G =

Original: { R | R ∈ SO(3) } , and
Revised: { R | R ∈ SO(3) } , and

Original: [Equation]
Revised: [Equation]

Original: We use about 0.3M grids to discretize SO(3) space.
Revised: We use about 0.3M grids to discretize SO(3) space.

Original: E A DDITIONAL R ESULTS E. A DDITIONAL N UMERICAL R ESULTS
Revised: E A DDITIONAL R ESULTS E. A DDITIONAL N UMERICAL R ESULTS

Original: Table 7 and 8 extend the results on ModelNet10-SO3 dataset and Pascal3D+ dataset in the main paper and show the per-category results.
Revised: Table 7 and 8 extend the results on ModelNet10-SO3 dataset and Pascal3D+ dataset in the main paper and show the per-category results.

Original: Our prediction with Rotation Laplace distribution is at or near state-of-the-art on many categories.
Revised: Our prediction with Rotation Laplace distribution is at or near state-of-the-art on many categories.

Original: The numbers for baselines are quoted from Murphy et al.
Revised: The numbers for baselines are quoted from Murphy et al.

Original: E. A DDITIONAL V ISUAL R ESULTS
Revised: E. A DDITIONAL V ISUAL R ESULTS

Original: We show additional visual results on ModelNet10-SO3 dataset in Figure 6 and on Pascal3D+ datset in Figure 7.
Revised: We show additional visual results on ModelNet10-SO3 dataset in Figure 6 and on Pascal3D+ dataset in Figure 7.

Revised: As shown in the figures, our distribution provides rich information about the rotation estimations.

Revised: To visualize the predicted distributions, we adopt two popular visualization methods used in Mohlin et al.

Revised: (2020) and Murphy et al.

Revised: The visualization in Mohlin et al.

Revised: (2020) is achieved by summing the three marginal distributions over the standard basis of R 3 and displaying them on the

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

Revised: sphere with color coding.

Revised: Murphy et al.

Revised: (2021) introduces a new visualization method based on discretization over SO(3) .

Revised: It projects a great circle of points on SO(3) to each point on the 2-sphere, and then uses the color wheel to indicate the location on the great circle.

Revised: The probability density is shown by the size of the points on the plot.

Revised: See the corresponding papers for more details.

Original: F D ERIVATIONS
Revised: F D ERIVATIONS

Original: Proposition 1 in the main paper.
Revised: Proposition 1 in the main paper.

Original: Let Φ = log (cid:101) R ∈ so (3) and ϕ =
Revised: Let Φ = log (cid:101) R ∈ so (3) and ϕ =

Original: Φ ∨ ∈ R 3 .
Revised: Φ ∨ ∈ R 3 .

Original: For rotation matrix
Revised: For rotation matrix

Original: R ∈ SO(3) following matrix Fisher distribution , when ∥ R − R 0 ∥ → 0 , ϕ follows zero-mean multivariate Gaussian distribution .
Revised: R ∈ SO(3) following matrix Fisher distribution , when ∥ R − R 0 ∥ → 0 , ϕ follows zero-mean multivariate Gaussian distribution .

Original: Proof.
Revised: Proof.

Original: For R ∼ MF ( A ) , we have
Revised: For R ∼ MF ( A ) , we have

Original: [Equation]
Revised: [Equation]

Original: Considering Eq.
Revised: Considering Eq.

Original: 5 in the main paper, we have
Revised: 5 in the main paper, we have

Original: [Equation]
Revised: [Equation]

Revised: [Figure]

Original: Thusp
Revised: Thus

Original: [Equation]
Revised: [Equation]

Original: When ∥ R − R 0 ∥ → 0 , we have ∥ (cid:101) R − I ∥ → 0 and ϕ → 0 , so Eq.
Revised: When ∥ R − R 0 ∥ → 0 , we have ∥ (cid:101) R − I ∥ → 0 and ϕ → 0 , so Eq.

Original: 11 follows the multivariate Gaussian distribution with the covariance matrix as Σ , where Σ = V diag( 1 s 2 + s 3 , [Equation] [Figure] [Figure]
Revised: 11 follows the multivariate Gaussian distribution with the covariance matrix as Σ , where Σ = V diag( 1 s 2 + s 3 , 1 s 1 + s 3 , 1 s 1 + s 2 ) V T .

Original: Proposition 3 in the main paper.
Revised: Proposition 3 in the main paper.

Original: Denote q 0 as the mode of Quaternion Laplace distribution.
Revised: Denote q 0 as the mode of Quaternion Laplace distribution.

Original: Let π be the tangent space of S 3 at q 0 , and π ( x ) ∈ R 4 be the projection of x ∈ R 4 on π .
Revised: Let π be the tangent space of S 3 at q 0 , and π ( x ) ∈ R 4 be the projection of x ∈ R 4 on π .

Original: For quaternion q ∈ S 3 following Bingham distribution / Quaternion Laplace distribution , when q → q 0 , π ( q ) follows zero-mean multivariate Gaussian distribution / zero-mean multivariate Laplace distribution .
Revised: For quaternion q ∈ S 3 following Bingham distribution / Quaternion Laplace distribution , when q → q 0 , π ( q ) follows zero-mean multivariate Gaussian distribution / zero-mean multivariate Laplace distribution .

Original: Proof.
Revised: Proof.

Original: Denote q I = (1 , 0 , 0 , 0) T as the identity quaternion.
Revised: Denote q I = (1 , 0 , 0 , 0) T as the identity quaternion.

Original: Define M as an orthogonal matrix such that M T q 0 =
Revised: Define M as an orthogonal matrix such that M T q 0 =

Original: q I .
Revised: q I .

Original: Given π ( q ) =
Revised: Given π ( q ) =

Original: q − ( q · q 0 ) q 0 , we have
Revised: q − ( q · q 0 ) q 0 , we have

Original: [Equation]
Revised: [Equation]

Original: where M T q = ( w, x, y, z ) T .
Revised: where M T q = ( w, x, y, z ) T .

Original: Let ( e 0 , e 1 , e 2 , e 3 ) be the column vectors of I 4 × 4 , we have
Revised: Let ( e 0 , e 1 , e 2 , e 3 ) be the column vectors of I 4 × 4 , we have

Original: [Equation]
Revised: [Equation]

Original: 13) for i = 1 , 2 , 3 .
Revised: for i = 1 , 2 , 3 .

Original: Therefore, Me i ( i = 1 , 2 , 3) form an orthogonal basis of π .
Revised: Therefore, Me i ( i = 1 , 2 , 3) form an orthogonal basis of π .

Original: Given M T q = w e 0 + x e 1 + y e 

Revised: Given M T q = w e 0 + x e 1 + y e

Original: + z e 3 , we have
Revised: + z e 3 , we have

Original: [Equation]
Revised: [Equation]

Original: Therefore, η = ( x, y, z ) is the coordinate of π ( q ) in π under the basis of Me i .
Revised: Therefore, η = ( x, y, z ) is the coordinate of π ( q ) in π under the basis of Me i .

Revised: [Figure]

Original: The Jacobian of the transformation q → η is given by
Revised: The Jacobian of the transformation q → η is given by

Original: [Equation]
Revised: [Equation]

Original: Therefore, the scaling factor from η to q is given by
Revised: Therefore, the scaling factor from η to q is given by

Original: [Equation]
Revised: [Equation]

Original: Thus
Revised: Thus

Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: where we define (cid:101) Z = diag( z 1 , z 2 , z 3 ) .
Revised: where we define (cid:101) Z = diag( z 1 , z 2 , z 3 ) .

Original: For Bingham distribution, we have
Revised: For Bingham distribution, we have

Original: [Equation]
Revised: [Equation]

Original: which follows the multivariate Gaussian distribution with the covariance matrix as Σ , where Σ = − diag( 1 z 1 , 1 z 2 , 1 z 3 )
Revised: which follows the multivariate Gaussian distribution with the covariance matrix as Σ , where Σ = − diag( 1 z 1 , 1 z 2 , 1 z 3 )

Original: For Quaternion Laplace distribution, we have
Revised: For Quaternion Laplace distribution, we have

Original: [Equation]
Revised: [Equation]

Original: which follows the multivariate Laplace distribution with the covariance matrix as Σ , where Σ = − 2 diag( 1 z 1 , 1 z 2 , 1 z 3 ) .
Revised: which follows the multivariate Laplace distribution with the covariance matrix as Σ , where Σ = − 2 diag( 1 z 1 , 1 z 2 , 1 z 3 ) .

Original: Proposition 4 in the main paper.
Revised: Proposition 4 in the main paper.

Original: Denote γ as the standard transformation from unit quaternions to corresponding rotation matrices.
Revised: Denote γ as the standard transformation from unit quaternions to corresponding rotation matrices.

Original: For rotation matrix R ∈ SO(3) following Rotation Laplace distribution , q = γ − 1 ( R ) ∈ S 3 follows Quaternion Laplace distribution .
Revised: For rotation matrix R ∈ SO(3) following Rotation Laplace distribution , q = γ − 1 ( R ) ∈ S 3 follows Quaternion Laplace distribution .

Original: Proof.
Revised: Proof.

Original: For a quaternion q =
Revised: For a quaternion q =

Original: [ q 0 , q 1 , q 2 , q 3 ] , we use the standard transform function γ to compute its corresponding rotation matrix:
Revised: [ q 0 , q 1 , q 2 , q 3 ] , we use the standard transform function γ to compute its corresponding rotation matrix:

Original: [Equation]
Revised: [Equation]

Original: Let u = γ − 1 ( U ) , v = γ − 1 ( V ) and
Revised: Let u = γ − 1 ( U ) , v = γ − 1 ( V ) and

Original: [Equation]
Revised: [Equation]

Original: Note that the transformation q → uqv is an orthogonal transformation on S 3 .
Revised: Note that the transformation q → uqv is an orthogonal transformation on S 3 .

Original: Therefore, there exists an orthogonal Matrix M , such that
Revised: Therefore, there exists an orthogonal Matrix M [Equation] such that

Original: [Equation]
Revised: [Equation]

Original: The scaling factor from quaternions to rotation matrices is given by
Revised: The scaling factor from quaternions to rotation matrices is given by

Original: [Equation]
Revised: [Equation]

Original: Suppose R follows Quaternion Laplace distribution as
Revised: Suppose R follows Quaternion Laplace distribution as

Original: [Equation]
Revised: [Equation]

Original: Given
Revised: Given

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: where M is an orthogonal matrix and Z = − 2 diag(0 , s 

Revised: where M is an orthogonal matrix and Z = − 2 diag(0 , s

Original: + s 3 , s 
 + s 3 , s 

Revised: + s 3 , s 
 + s 3 , s

Original: + s 2 ) is a 4 × 4 diagonal matrix.
Revised: + s 2 ) is a 4 × 4 diagonal matrix.

Original: Elaboration of Eq. 3 in the main paper
Revised: Elaboration of Eq. 3 in the main paper

Original: Given R 0 = UV T and (cid:101) R = R T 0 R , 
Revised: Given R 0 = UV T and (cid:101) R = R T 0 R , p

Original: [Equation]
Revised: [Equation]

Original: T R) [Equation] [Equation] [Equation]
Revised: R

Original: (cid:16)

Original: [Equation]
Revised: [Equation]

Original: ) (cid:17) (cid:112) [Equation] RV ) d R = exp [Equation]
Revised: tr

Original: RV

Original: [Equation]
Revised: [Equation]

Original: RV )

Original: [Equation]

Original: (cid:113)

Original: [Equation]

Original: ( S

Original: [Equation]

Original: (cid:101) RV )

Original: d R (27)

Original: G M ORE I MPLEMENTATION D ETAILS
Revised: G M ORE I MPLEMENTATION D ETAILS

Original: For fair comparisons, we follow the implementation designs of Mohlin et al.
Revised: For fair comparisons, we follow the implementation designs of Mohlin et al.

Original: and merely change the distribution from matrix Fisher distribution to our Rotation Laplace distribution.
Revised: and merely change the distribution from matrix Fisher distribution to our Rotation Laplace distribution.

Original: We use pretrained ResNet-101 as our backbone, and encode the object class information (for singlemodel-all-category experiments) by an embedding layer that produces a 32-dim vector.
Revised: We use pretrained ResNet-101 as our backbone, and encode the object class information (for singlemodel-all-category experiments) by an embedding layer that produces a 32-dim vector.

Original: We apply a 512-512-9 MLP as the output layer.
Revised: We apply a 512-512-9 MLP as the output layer.

Original: The batch size is set as 32.
Revised: The batch size is set as 32.

Original: We use the SGD optimizer and start with the learning rate of 0.01.
Revised: We use the SGD optimizer and start with the learning rate of 0.01.

Original: For
Revised: For

Original: ModelNet10-SO3 dataset, we train 50 epochs with learning rate decaying by a factor of 10 at epochs 30, 40, and 45.
Revised: ModelNet10-SO3 dataset, we train 50 epochs with learning rate decaying by a factor of 10 at epochs 30, 40, and 45.

Original: For Pascal3D+ dataset, we train 120 epochs with the same learning rate decay at epochs 30, 60 and 90.
Revised: For Pascal3D+ dataset, we train 120 epochs with the same learning rate decay at epochs 30, 60 and 90.

Original: We build a lookup table w.r.t.
Revised: We build a lookup table w.r.t.

Original: the proper singular values for computing the normalization factors.
Revised: the proper singular values for computing the normalization factors.

Original: We sample about 5.6M different sets of proper singular values, the storage for which is about 21MB for forward and 63MB for backward.
Revised: We sample about 5.6M different sets of proper singular values, the storage for which is about 21MB for forward and 63MB for backward.