Original: H IGHER -O RDER F UNCTION N ETWORKS FOR L EARNING C OMPOSABLE 3D O BJECT R EPRESENTATIONS
Revised: H IGHER -O RDER F UNCTION N ETWORKS FOR L EARNING C OMPOSABLE 3D O BJECT R EPRESENTATIONS

Original: A BSTRACT
Revised: A BSTRACT

Original: We present a new approach to 3D object representation where a neural network encodes the geometry of an object directly into the weights and biases of a second ‘mapping’ network.
Revised: We present a new approach to 3D object representation where a neural network encodes the geometry of an object directly into the weights and biases of a second ‘mapping’ network.

Original: This mapping network can be used to reconstruct an object by applying its encoded transformation to points randomly sampled from a simple geometric space, such as the unit sphere.
Revised: This mapping network can be used to reconstruct an object by applying its encoded transformation to points randomly sampled from a simple geometric space, such as the unit sphere.

Original: We study the effectiveness of our method through various experiments on subsets of the ShapeNet dataset.
Revised: We study the effectiveness of our method through various experiments on subsets of the ShapeNet dataset.

Original: We ﬁnd that the proposed approach can reconstruct encoded objects with accuracy equal to or exceeding state-of-the-art methods with orders of magnitude fewer parameters.
Revised: We ﬁnd that the proposed approach can reconstruct encoded objects with accuracy equal to or exceeding state-of-the-art methods with orders of magnitude fewer parameters.

Original: Our smallest mapping network has only about 7000 parameters and shows reconstruction quality on par with state-of-the-art object decoder architectures with millions of parameters.
Revised: Our smallest mapping network has only about 7000 parameters and shows reconstruction quality on par with state-of-the-art object decoder architectures with millions of parameters.

Original: Further experiments on feature mixing through the composition of learned functions show that the encoding captures a meaningful subspace of objects.
Revised: Further experiments on feature mixing through the composition of learned functions show that the encoding captures a meaningful subspace of objects.

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: This paper is primarily concerned with the problem of learning compact 3D object representations and estimating them from images.
Revised: This paper is primarily concerned with the problem of learning compact 3D object representations and estimating them from images.

Original: If we consider an object to be a continuous surface  R 3 , it is not straightforward to directly represent this inﬁnite set of points in memory.
Revised: If we consider an object to be a continuous surface in R 3 , it is not straightforward to directly represent this inﬁnite set of points in memory.

Original: In working around this problem, many learning-based approaches to 3D object representation suffer from problems related to memory usage, computational burden, or sampling efﬁciency.
Revised: In working around this problem, many learning-based approaches to 3D object representation suffer from problems related to memory usage, computational burden, or sampling efﬁciency.

Original: Nonetheless, neural networks with tens of millions of parameters have proven effective tools for learning expressive representations of geometric data.
Revised: Nonetheless, neural networks with tens of millions of parameters have proven effective tools for learning expressive representations of geometric data.

Original: In this work, we show that object geometries can be encoded into neural networks with thousands, rather than millions, of parameters with little or no loss in reconstruction quality.
Revised: In this work, we show that object geometries can be encoded into neural networks with thousands, rather than millions, of parameters with little or no loss in reconstruction quality.

Original: To this end we propose an object representation that encodes an object as a function that maps points from a canonical space, such as the unit sphere, to the set of points deﬁning the object.
Revised: To this end, we propose an object representation that encodes an object as a function that maps points from a canonical space, such as the unit sphere, to the set of points deﬁning the object.

Original: In this work, the function is approximated with a small multilayer perceptron.
Revised: In this work, the function is approximated with a small multilayer perceptron.

Original: The parameters of this function are estimated by a ‘higher order’ encoder network, thus motivating the name for our method:
Revised: The parameters of this function are estimated by a ‘higher order’ encoder network, thus motivating the name for our method:

Original: Higher-Order Function networks (HOF) .
Revised: Higher-Order Function networks (HOF) .

Original: This procedure is shown in Figure 1.
Revised: This procedure is shown in Figure 1.

Original: There are two key ideas that distinguish HOF from prior work in 3D object representation learning: fast-weights object encoding and interpolation through function composition.
Revised: There are two key ideas that distinguish HOF from prior work in 3D object representation learning: fast-weights object encoding and interpolation through function composition.

Original: (1) Fast-weights object encoding: ‘Fast-weights’ in this context generally refers to methods that use network weights and biases that are not ﬁxed; at least some of these parameters are estimated on a per-sample basis.
Revised: (1) Fast-weights object encoding: ‘Fast-weights’ in this context generally refers to methods that use network weights and biases that are not ﬁxed; at least some of these parameters are estimated on a per-sample basis.

Original: Our fast-weights approach stands in contrast to existing methods which encode objects as vector-valued inputs to a decoder network with ﬁxed weights.
Revised: Our fast-weights approach stands in contrast to existing methods which encode objects as vector-valued inputs to a decoder network with ﬁxed weights.

Original: Empirically, we ﬁnd that our approach enables a dramatic reduction (two orders of magnitude) in the size of the mapping network compared to the decoder networks employed by other methods.
Revised: Empirically, we ﬁnd that our approach enables a dramatic reduction (two orders of magnitude) in the size of the mapping network compared to the decoder networks employed by other methods.

Original: (2) Interpolation through function composition: Our functional formulation allows for interpolation between inputs by composing the roots of our reconstruction functions.
Revised: (2) Interpolation through function composition: Our functional formulation allows for interpolation between inputs by composing the roots of our reconstruction functions.

Original: We demonstrate that the
Revised: We demonstrate that the

Original: functional representation learned by HOF provides a rich latent space in which we can ‘interpolate’ between objects, producing new, coherent objects sharing properties of the ‘parent’ objects.
Revised: functional representation learned by HOF provides a rich latent space in which we can ‘interpolate’ between objects, producing new, coherent objects sharing properties of the ‘parent’ objects.

Original: In order to position HOF among other methods for 3D reconstruction, we ﬁrst deﬁne a taxonomy of existing work and show that HOF provides a generalization of current best-performing methods.
Revised: In order to position HOF among other methods for 3D reconstruction, we ﬁrst deﬁne a taxonomy of existing work and show that HOF provides a generalization of current best-performing methods.

Original: Afterwards, we demonstrate the effectiveness of HOF on the task of 3D reconstruction from an RGB image using a subset of the ShapeNet dataset (Chang et al., 2015).
Revised: Afterwards, we demonstrate the effectiveness of HOF on the task of 3D reconstruction from an RGB image using a subset of the ShapeNet dataset (Chang et al., 2015).

Original: The results, reported in Tablesand 2 and Figure 2, show state-of-the-art reconstruction quality using orders of magnitude fewer parameters than other methods.
Revised: The results, reported in Tablesand 2 and Figure 2, show state-of-the-art reconstruction quality using orders of magnitude fewer parameters than other methods.

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

Original: The selection of object representation is a crucial design choice for methods addressing 3D reconstruction.
Revised: The selection of object representation is a crucial design choice for methods addressing 3D reconstruction.

Original: Voxel-based approaches (Choy et al., 2016; Häne et al., 2017) typically use a uniform discretization of R 3 in order to extend highly successful convolutional neural network (CNN) based approaches to three dimensions.
Revised: Voxel-based approaches (Choy et al., 2016; Häne et al., 2017) typically use a uniform discretization of R 3 in order to extend highly successful convolutional neural network (CNN) based approaches to three dimensions.

Original: However, the inherent sparsity of surfaces in 3D space make voxelization inefﬁcient in terms of both memory and computation time.
Revised: However, the inherent sparsity of surfaces in 3D space make voxelization inefﬁcient in terms of both memory and computation time.

Original: Partition-based approaches such as octrees (Tatarchenko et al., 2017; Riegler et al., 2017) address the space efﬁciency shortcomings of voxelization, but they are tedious to implement and more computationally demanding to query.
Revised: Partition-based approaches such as octrees (Tatarchenko et al., 2017; Riegler et al., 2017) address the space efﬁciency shortcomings of voxelization, but they are tedious to implement and more computationally demanding to query.

Original: Graph-based models such as meshes (Wang et al., 2018;
Revised: Graph-based models such as meshes (Wang et al., 2018;

Original: Gkioxari et al., 2019; Smith et al., 2019;
Revised: Gkioxari et al., 2019; Smith et al., 2019;

Original: Hanocka et al., 2019) provide a compact representation for capturing topology and surface level information, however their irregular structure makes them harder to learn.
Revised: Hanocka et al., 2019) provide a compact representation for capturing topology and surface level information, however their irregular structure makes them harder to learn.

Original: Point set representations, discrete (and typically ﬁnite) subsets of the continuous geometric object, have also gained popularity due to the fact that they retain the simplicity of voxel based methods while eliminating their storage and computational burden (Qi et al., 2017a;
Revised: Point set representations, discrete (and typically ﬁnite) subsets of the continuous geometric object, have also gained popularity due to the fact that they retain the simplicity of voxel based methods while eliminating their storage and computational burden (Qi et al., 2017a;

Original: Fan et al., 2017; Qi et al., 2017b;
Revised: Fan et al., 2017; Qi et al., 2017b;

Original: Yang et al., 2018; Park et al., 2019).
Revised: Yang et al., 2018; Park et al., 2019).

Original: The PointNet architecture (Qi et al., 2017a;b) was an architectural milestone that made manipulating point sets with deep learning methods a competitive alternative to earlier approaches; however, PointNet is concerned with processing , rather than generating , point clouds.
Revised: The PointNet architecture (Qi et al., 2017a;b) was an architectural milestone that made manipulating point sets with deep learning methods a competitive alternative to earlier approaches; however, PointNet is concerned with processing , rather than generating , point clouds.

Original: Further, while point clouds are more ﬂexible than voxels in terms of information density, it is still not obvious how to adapt them to the task of producing arbitrary- or varied-resolution predictions.
Revised: Further, while point clouds are more ﬂexible than voxels in terms of information density, it is still not obvious how to adapt them to the task of producing arbitrary- or varied-resolution predictions.

Original: Independently regressing each point in the point set requires additional parameters for each additional point (Fan et al., 2017; Achlioptas et al., 2018), which is an undesirable property if the goal is high-resolution point clouds.
Revised: Independently regressing each point in the point set requires additional parameters for each additional point (Fan et al., 2017; Achlioptas et al., 2018), which is an undesirable property if the goal is high-resolution point clouds.

Original: Many current approaches to representation and reconstruction follow an encoder-decoder paradigm, where the encoder and decoder both have learned weights that are ﬁxed at the end of training.
Revised: Many current approaches to representation and reconstruction follow an encoder-decoder paradigm, where the encoder and decoder both have learned weights that are ﬁxed at the end of training.

Original: An image or set of 3D points is encoded as a latent vector ‘codeword’ either with a learned encoder as in Yang et al.
Revised: An image or set of 3D points is encoded as a latent vector ‘codeword’ either with a learned encoder as in Yang et al.

Original: Lin et al.
Revised: Lin et al.

Original: Yan et al.
Revised: Yan et al.

Original: (2016) or by direct optimization of the latent vector itself with respect to a reconstruction-based objective function as in Park et al.
Revised: (2016) or by direct optimization of the latent vector itself with respect to a reconstruction-based objective function as in Park et al.

Original: Afterwards, the latent code is decoded by a learned decoder into a reconstruction of the desired object by one of two methods, which we call direct decoding and contextual mapping .
Revised: Afterwards, the latent code is decoded by a learned decoder into a reconstruction of the desired object by one of two methods, which we call direct decoding and contextual mapping .

Original: Direct decoding methods directly map the latent code into a ﬁxed set of points (Choy et al., 2016; Fan et al., 2017; Lin et al., 2018; Michalkiewicz et al., 2019); contextual mapping methods map the latent code into a function that can be sampled or otherwise manipulated to acquire a reconstruction (Yang et al., 2018;
Revised: Direct decoding methods directly map the latent code into a ﬁxed set of points (Choy et al., 2016; Fan et al., 2017; Lin et al., 2018; Michalkiewicz et al., 2019); contextual mapping methods map the latent code into a function that can be sampled or otherwise manipulated to acquire a reconstruction (Yang et al., 2018;

Original: Park et al., 2019; Michalkiewicz et al., 2019; Mescheder et al., 2019).
Revised: Park et al., 2019; Michalkiewicz et al., 2019; Mescheder et al., 2019).

Original: Direct decoding methods generally suffer from the limitation that their predictions are of ﬁxed resolution; they cannot be sampled more or less precisely.
Revised: Direct decoding methods generally suffer from the limitation that their predictions are of ﬁxed resolution; they cannot be sampled more or less precisely.

Original: With contextual mapping methods, it is possible in principle to sample the object to arbitrarily high resolution with the correct decoder function.
Revised: With contextual mapping methods, it is possible in principle to sample the object to arbitrarily high resolution with the correct decoder function.

Original: However, sampling can provide a signiﬁcant computational burden for some contextual mapping approaches as those proposed by
Revised: However, sampling can provide a signiﬁcant computational burden for some contextual mapping approaches as those proposed by

Original: Park et al.
Revised: Park et al.

Original: and Michalkiewicz et al.
Revised: and Michalkiewicz et al.

Original: Another hurdle is the need for post-processing such as applying the Marching Cubes algorithm developed by Lorensen and Cline (1987).
Revised: Another hurdle is the need for post-processing such as applying the Marching Cubes algorithm developed by Lorensen and Cline (1987).

Original: We call contextual mapping approaches that encode context by concatenating a duplicate of a latent context vector with each input latent vector concatenation (LVC) methods.
Revised: We call contextual mapping approaches that encode context by concatenating a duplicate of a latent context vector with each input latent vector concatenation (LVC) methods.

Original: In particular, we compare with
Revised: In particular, we compare with

Original: LVC architectures used in FoldingNet (Yang et al., 2018) and DeepSDF (Park et al., 2019).
Revised: LVC architectures used in FoldingNet (Yang et al., 2018) and DeepSDF (Park et al., 2019).

Original: HOF is a contextual mapping method that distinguishes itself from other methods within this class through its approach to representing the mapping function: HOF uses one neural network to estimate the weights of another.
Revised: HOF is a contextual mapping method that distinguishes itself from other methods within this class through its approach to representing the mapping function: HOF uses one neural network to estimate the weights of another.

Original: Conceptually related methods have been previously studied under nomenclature such as the ‘fast-weight’ paradigm (Schmidhuber, 1992; De Brabandere et al., 2016;
Revised: Conceptually related methods have been previously studied under nomenclature such as the ‘fast-weight’ paradigm (Schmidhuber, 1992; De Brabandere et al., 2016;

Original: Klein et al., 2015; Riegler et al., 2015) and more recently ‘hypernetworks’ (Ha et al., 2016).
Revised: Klein et al., 2015; Riegler et al., 2015) and more recently ‘hypernetworks’ (Ha et al., 2016).

Original: However, the work by Schmidhuber (1992) deals with encoding memories in sequence learning tasks.
Revised: However, the work by Schmidhuber (1992) deals with encoding memories in sequence learning tasks.

Original: Ha et al.
Revised: Ha et al.

Original: (2016) suggest that estimating weights of one network with another might lead to improvements in parameter-efﬁciency.
Revised: (2016) suggest that estimating weights of one network with another might lead to improvements in parameter-efﬁciency.

Original: However, this work does not leverage the key insight of using network parameters that are estimated per sample in vision tasks.
Revised: However, this work does not leverage the key insight of using network parameters that are estimated per sample in vision tasks.

Original:  H IGHER -O RDER F UNCTION N ETWORKS
Revised:  H IGHER -O RDER F UNCTION N ETWORKS

Original: HOF is motivated by the independent observations by both Yang et al.
Revised: HOF is motivated by the independent observations by both Yang et al.

Original: (2018) and Park et al.
Revised: (2018) and Park et al.

Original: (2019) that LVC methods do not perform competitively when the context vector is injected by simply concatenating it with each input.
Revised: (2019) that LVC methods do not perform competitively when the context vector is injected by simply concatenating it with each input.

Original: In both works, the LVC methods proposed required architectural workarounds to produce sufﬁcient performance on reconstruction tasks, including injecting the latent code multiple times at various layers in the network.
Revised: In both works, the LVC methods proposed required architectural workarounds to produce sufﬁcient performance on reconstruction tasks, including injecting the latent code multiple times at various layers in the network.

Original: HOF does not suffer from these shortcomings due to its richer context encoding (the entire mapping network encodes context) in comparison with LVC.
Revised: HOF does not suffer from these shortcomings due to its richer context encoding (the entire mapping network encodes context) in comparison with LVC.

Original: We compare the HOF and LVC regimes more precisely in Section 3.2.
Revised: We compare the HOF and LVC regimes more precisely in Section 3.2.

Original: Quantitative comparisons of HOF with existing methods can be found in Table 1.
Revised: Quantitative comparisons of HOF with existing methods can be found in Table 1.

Original: 3. A F AST -W EIGHTS A PPROACH TO 3D O BJECT R EPRESENTATION AND R ECONSTRUCTION
Revised: 3. A F AST -W EIGHTS A PPROACH TO 3D O BJECT R EPRESENTATION AND R ECONSTRUCTION

Original: We consider the task of reconstructing an object point cloud O from an image.
Revised: We consider the task of reconstructing an object point cloud O from an image.

Original: We start by training a neural network g φ with parameters φ (Figure 1, top-left) to output the parameters θ of a mapping function f θ , which reconstructs the object when applied to a set of points X sampled uniformly from a canonical set such as the unit sphere (Figure 1, top-right).
Revised: We start by training a neural network g φ with parameters φ (Figure 1, top-left) to output the parameters θ of a mapping function f θ , which reconstructs the object when applied to a set of points X sampled uniformly from a canonical set such as the unit sphere (Figure 1, top-right).

Original: We note that the number of samples in X can be increased or decreased to produce higher or lower resolution reconstructions without changing the network architecture or retraining, in contrast with direct decoding methods and some contextual mapping methods which use ﬁxed, non-random samples from X (Yang et al., 2018).
Revised: We note that the number of samples in X can be increased or decreased to produce higher or lower resolution reconstructions without changing the network architecture or retraining, in contrast with direct decoding methods and some contextual mapping methods which use ﬁxed, non-random samples from X (Yang et al., 2018).

Original: The input to g φ is an RGB image I ; our implementation takes 64 × 64 × 3 RGB images as input, but our method is general to any input representation for which a corresponding differentiable encoder network can be constructed to estimate θ (e.g. PointNet (Qi et al., 2017a) for point cloud completion).
Revised: The input to g φ is an RGB image I ; our implementation takes 64 × 64 × 3 RGB images as input, but our method is general to any input representation for which a corresponding differentiable encoder network can be constructed to estimate θ (e.g. PointNet (Qi et al., 2017a) for point cloud completion).

Original: Given I , we compute the parameters of the mapping network θ I as
Revised: Given I , we compute the parameters of the mapping network θ I as

Original: [Equation]
Revised: [Equation]

Original: That is, the encoder g φ : R 3 × 64 × 

Revised: That is, the encoder g φ : R 3 × 64 ×

Original: → R d directly regresses the d -dimensional parameters θ I of the mapping network
Revised: → R d directly regresses the d -dimensional parameters θ I of the mapping network

Original: f θ I : R c
Revised: f θ I : R c

Original: → R 3 , which maps c -dimensional points in the canonical space X to points in the reconstruction ˆ O (see Figure 1).
Revised: → R 3 , which maps c -dimensional points in the canonical space X to points in the reconstruction ˆ O (see Figure 1).

Original: We then transform our canonical space X with f θ I in the same manner as other contextual mapping methods:
Revised: We then transform our canonical space X with f θ I in the same manner as other contextual mapping methods:

Original: [Equation]
Revised: [Equation]

Original: During training, we sample an image I and the corresponding ground truth point cloud model O , where O contains 10,000 points sampled from the surface of the true object.
Revised: During training, we sample an image I and the corresponding ground truth point cloud model O , where O contains 10,000 points sampled from the surface of the true object.

Original: We then obtain the mapping f θ I =
Revised: We then obtain the mapping f θ I =

Original: g φ ( I ) and produce an estimated reconstruction of O as in Equation 2.
Revised: g φ ( I ) and produce an estimated reconstruction of O as in Equation 2.

Original: In our training, we only compute f θ I ( x ) for a sample of 1000 points in X .
Revised: In our training, we only compute f θ I ( x ) for a sample of 1000 points in X .

Original: However, we ﬁnd that sampling many more points (10-100 × as many) at test time still yields high-quality reconstructions.
Revised: However, we ﬁnd that sampling many more points (10-100 × as many) at test time still yields high-quality reconstructions.

Original: This sample is drawn from a uniform distribution over the set X .
Revised: This sample is drawn from a uniform distribution over the set X .

Original: We then compute a loss for the prediction ˆ
Revised: We then compute a loss for the prediction ˆ

Original: O using a differentiable set similarity metric such as Chamfer distance or Earth Mover’s Distance.
Revised: O using a differentiable set similarity metric such as Chamfer distance or Earth Mover’s Distance.

Original: We focus on the Chamfer distance as both a training objective and metric for assessing reconstruction quality.
Revised: We focus on the Chamfer distance as both a training objective and metric for assessing reconstruction quality.

Original: The asymmetric Chamfer distance CD ( X, Y ) is often used for quantifying the similarity of two point sets X and Y and is given as
Revised: The asymmetric Chamfer distance CD ( X, Y ) is often used for quantifying the similarity of two point sets X and Y and is given as

Original: [Equation]
Revised: [Equation]

Original: The Chamfer distance is deﬁned even if sets X and Y have different cardinality.
Revised: The Chamfer distance is deﬁned even if sets X and Y have different cardinality.

Original: We train g φ to minimize the symmetric objective function (cid:96) ( ˆ O, O ) =
Revised: We train g φ to minimize the symmetric objective function (cid:96) ( ˆ O, O ) =

Original: CD ( ˆ O, O )
Revised: CD ( ˆ O, O )

Original: + CD ( O, ˆ O ) as in Fan et al.
Revised: + CD ( O, ˆ O ) as in Fan et al.

Original: 3. C OMPARISON WITH LVC M ETHODS
Revised: 3. C OMPARISON WITH LVC M ETHODS

Original: We compare our mapping approach with LVC architectures such as DeepSDF (Park et al., 2019) and
Revised: We compare our mapping approach with LVC architectures such as DeepSDF (Park et al., 2019) and

Original: FoldingNet (Yang et al., 2018).
Revised: FoldingNet (Yang et al., 2018).

Original: These architectures control the output of the decoder through the concatenation of a latent ‘codeword’ vector z with each input x i ∈ X .
Revised: These architectures control the output of the decoder through the concatenation of a latent ‘codeword’ vector z with each input x i ∈ X .

Original: The codeword is estimated by an encoder g φ LVC for each image.
Revised: The codeword is estimated by an encoder g φ LVC for each image.

Original: We consider the case in which the latent vector is only concatenated with inputs in the ﬁrst layer of the decoder network f θ , which we assume to be an MLP.
Revised: We consider the case in which the latent vector is only concatenated with inputs in the ﬁrst layer of the decoder network f θ , which we assume to be an MLP.

Original: We are interested in analyzing the manner in which the network output with respect to x i may be modulated by varying z .
Revised: We are interested in analyzing the manner in which the network output with respect to x i may be modulated by varying z .

Original: If the vector a i contains the pre-activations of the ﬁrst layer of f θ given an input point x i , we have
Revised: If the vector a i contains the pre-activations of the ﬁrst layer of f θ given an input point x i , we have

Original: [Equation]
Revised: [Equation]

Original: where W x , W z , and b are ﬁxed parameters of the decoder, and only z is a function of I .
Revised: where W x , W z , and b are ﬁxed parameters of the decoder, and only z is a function of I .

Original: If we absorb the parameters W z and b into the encoder parameters φ LVC (as W z and b are ﬁxed for all x i ), we can deﬁne a new, equivalent latent representation b ∗ =
Revised: If we absorb the parameters W z and b into the encoder parameters φ LVC (as W z and b are ﬁxed for all x i ), we can deﬁne a new, equivalent latent representation b ∗ =

Original: W z z + b = W z g φ LVC ( I ) + b and a new encoder function h with parameters φ LVC ∪ { W z , b } such that h ( I ) =
Revised: W z z + b = W z g φ LVC ( I ) + b and a new encoder function h with parameters φ LVC ∪ { W z , b } such that h ( I ) =

Original: b ∗ .
Revised: b ∗ .

Original: This gives
Revised: This gives

Original: [Equation]
Revised: [Equation]

Original: Thus the LVC approach is equivalent to estimating a ﬁxed subset of the parameters θ of the decoder f θ on a per-sample basis (the ﬁrst layer bias).
Revised: Thus the LVC approach is equivalent to estimating a ﬁxed subset of the parameters θ of the decoder f θ on a per-sample basis (the ﬁrst layer bias).

Original: From this perspective, HOF is an intuitive generalization: rather than estimating just the ﬁrst layer bias, we allow our encoder to modulate all of the parameters in the decoder
Revised: From this perspective, HOF is an intuitive generalization: rather than estimating just the ﬁrst layer bias, we allow our encoder to modulate all of the parameters in the decoder

Original: f θ on a per-sample basis.
Revised: f θ on a per-sample basis.

Original: Having demonstrated HOF as a generalization of existing contextual mapping methods, in the next section, we present a novel application of contextual mapping that leverages the compositionality of the estimated mapping functions to aggregate features of multiple objects or multiple viewpoints of the same object.
Revised: Having demonstrated HOF as a generalization of existing contextual mapping methods, in the next section, we present a novel application of contextual mapping that leverages the compositionality of the estimated mapping functions to aggregate features of multiple objects or multiple viewpoints of the same object.

Original: 3. E XTENDING C ONTEXTUAL M APPING M ETHODS : F EATURE A GGREGATION THROUGH F UNCTION C OMPOSITION
Revised: 3. E XTENDING C ONTEXTUAL M APPING M ETHODS : F EATURE A GGREGATION THROUGH F UNCTION C OMPOSITION

Original: An advantageous property of methods that use a latent codeword is that they have been empirically shown to learn a meaningful space of object geometries, in which interpolating between object encodings gives new, coherent object encodings (Fan et al., 2017; Yang et al., 2018;
Revised: An advantageous property of methods that use a latent codeword is that they have been empirically shown to learn a meaningful space of object geometries, in which interpolating between object encodings gives new, coherent object encodings (Fan et al., 2017; Yang et al., 2018;

Original: Park et al., 2019;
Revised: Park et al., 2019;

Original: Groueix et al., 2018).
Revised: Groueix et al., 2018).

Original: HOF, on the other hand, does not obviously share this property: interpolating between the mapping function parameters estimated for two different objects need not yield a new, coherent object as the prior work has shown that the solution space of ‘good’ neural networks is highly non-convex (Li et al., 2018).
Revised: HOF, on the other hand, does not obviously share this property: interpolating between the mapping function parameters estimated for two different objects need not yield a new, coherent object as the prior work has shown that the solution space of ‘good’ neural networks is highly non-convex (Li et al., 2018).

Original: We demonstrate empirically in Figure 7 that naively interpolating between reconstruction function in the HOF regime does indeed produce meaningless blobs.
Revised: We demonstrate empirically in Figure 7 that naively interpolating between reconstruction function in the HOF regime does indeed produce meaningless blobs.

Original: However, with a small modiﬁcation to the HOF formulation in Equation 2, we can in fact learn a rich space of functions in which we can interpolate between objects through function composition.
Revised: However, with a small modiﬁcation to the HOF formulation in Equation 2, we can in fact learn a rich space of functions in which we can interpolate between objects through function composition.

Original: We extend the formulation in Equation 2 to one where an object is represented as the k -th power of the mapping f
Revised: We extend the formulation in Equation 2 to one where an object is represented as the k -th power of the mapping f

Original: θ I :
Revised: θ I :

Original: [Equation]
Revised: [Equation]

Original: where f k is deﬁned as the composition of f with itself ( k − 1) times:
Revised: where f k is deﬁned as the composition of f with itself ( k − 1) times:

Original: f k ( x ) =
Revised: f k ( x ) =

Original: f
Revised: f

Original: ( f ( k − 1) ( x )) where f 0 ( x ) (cid:44) x .
Revised: ( f ( k − 1) ( x )) where f 0 ( x ) (cid:44) x .

Original: We call a mapping f
Revised: We call a mapping f

Original: θ I whose k -th power reconstructs the object O in image
Revised: θ I whose k -th power reconstructs the object O in image

Original: I the k -mapping for O .
Revised: I the k -mapping for O .

Original: This modiﬁcation to Equation 2 adds an additional constraint to the mapping: the domain and codomain must be the same.
Revised: This modiﬁcation to Equation 2 adds an additional constraint to the mapping: the domain and codomain must be the same.

Original: However, evaluating powers of f leverages the power of weight sharing in neural network architectures; for an MLP mapping architecture with l layers (excluding the input layer), evaluating its k -th power is equivalent to an MLP with l × k layers with shared weights.
Revised: However, evaluating powers of f leverages the power of weight sharing in neural network architectures; for an MLP mapping architecture with l layers (excluding the input layer), evaluating its k -th power is equivalent to an MLP with l × k layers with shared weights.

Original: This formulation also has connections to earlier work on continuous attractor networks as a model for encoding memories in the brain as k becomes large (Seung, 1998).
Revised: This formulation also has connections to earlier work on continuous attractor networks as a model for encoding memories in the brain as k becomes large (Seung, 1998).

Original: In Section 4.3, we conduct experiments in a setting in which we have acquired RGB images I and J of two objects, O I and O J , respectively.
Revised: In Section 4.3, we conduct experiments in a setting in which we have acquired RGB images I and J of two objects, O I and O J , respectively.

Original: Applying our encoder to these images, we obtain k -mappings f
Revised: Applying our encoder to these images, we obtain k -mappings f

Original: θ I and f θ J , which have parameters θ I = g
Revised: θ I and f θ J , which have parameters θ I = g

Original: φ ( I ) and θ J = g φ ( J ) , respectively.
Revised: φ ( I ) and θ J = g φ ( J ) , respectively.

Original: We hypothesize that we can combine the information contained in each mapping function f
Revised: We hypothesize that we can combine the information contained in each mapping function f

Original: θ i by evaluating any of the 2 k possible functions of the form:
Revised: θ i by evaluating any of the 2 k possible functions of the form:

Original: [Equation]
Revised: [Equation]

Original: where the parameters of each mapping f
Revised: where the parameters of each mapping f

Original: θ i are either the parameters of f θ I or f θ J .
Revised: θ i are either the parameters of f θ I or f θ J .

Original: Figures 4 and 7 show that interpolation with function composition provides interesting, meaningful outputs in experiments with k = 2 and k
Revised: Figures 4 and 7 show that interpolation with function composition provides interesting, meaningful outputs in experiments with k = 2 and k

Original: = 4 .
Revised: = 4 .

Original: [Table]
Revised: [Table]

Original:  E XPERIMENTAL E VALUATIONS
Revised:  E XPERIMENTAL E VALUATIONS

Original: We conduct various empirical studies in order to justify two key claims.
Revised: We conduct various empirical studies in order to justify two key claims.

Original: In Sections 4.1 and 4.2, we compare with other contextual mapping architectures to demonstrate that HOF provides equal or better performance with a signiﬁcant reduction in parameters and compute time.
Revised: In Sections 4.1 and 4.2, we compare with other contextual mapping architectures to demonstrate that HOF provides equal or better performance with a signiﬁcant reduction in parameters and compute time.

Original: In Section 4.3 we demonstrate that extending contextual mapping approaches such as HOF with multiple compositions of the mapping function provides a simple and effective approach to object interpolation.
Revised: In Section 4.3 we demonstrate that extending contextual mapping approaches such as HOF with multiple compositions of the mapping function provides a simple and effective approach to object interpolation.

Original: Further experimentation, including ablation studies and a simulated robot navigation scenario, can be found in A.7.
Revised: Further experimentation, including ablation studies and a simulated robot navigation scenario, can be found in A.7.

Original: 4. E VALUATING R ECONSTRUCTION Q UALITY ON S HAPE N ET
Revised: 4. E VALUATING R ECONSTRUCTION Q UALITY ON S HAPE N ET

Original: We test HOF’s ability to reconstruct a 3D point cloud of an object given a single RGB image, comparing with other architectures for 3D reconstruction.
Revised: We test HOF’s ability to reconstruct a 3D point cloud of an object given a single RGB image, comparing with other architectures for 3D reconstruction.

Original: We conduct two experiments:
Revised: We conduct two experiments:

Original: We compare HOF with LVC architectures to show that HOF is a more parameter-efﬁcient approach to contextual mapping than existing ﬁxed-decoder architectures.
Revised: We compare HOF with LVC architectures to show that HOF is a more parameter-efﬁcient approach to contextual mapping than existing ﬁxed-decoder architectures.

Original: We compare HOF to a broader set of state of the art methods on a larger subset of the ShapeNet dataset, demonstrating that it matches or surpasses existing state of the art methods in terms of reconstruction quality.
Revised: We compare HOF to a broader set of state of the art methods on a larger subset of the ShapeNet dataset, demonstrating that it matches or surpasses existing state of the art methods in terms of reconstruction quality.

Original: In the ﬁrst experiment, we compare HOF with other LVC architectures on 13 of the largest classes of ShapeNet (Yan et al., 2016), using the asymmetric Chamfer distance metrics (Equation 3) as reported in Lin et al.
Revised: In the ﬁrst experiment, we compare HOF with other LVC architectures on 13 of the largest classes of ShapeNet (Yan et al., 2016), using the asymmetric Chamfer distance metrics (Equation 3) as reported in Lin et al.

Original: In the second experiment, we compare HOF with other methods for 3D reconstruction on a broader selection of 55 classes the ShapeNet dataset, as in Tatarchenko et al.
Revised: In the second experiment, we compare HOF with other methods for 3D reconstruction on a broader selection of 55 classes the ShapeNet dataset, as in Tatarchenko et al.

Original: In line with the recommendations in Tatarchenko et al.
Revised: In line with the recommendations in Tatarchenko et al.

Original: (2019), we report F1 scores for this evaluation.
Revised: (2019), we report F1 scores for this evaluation.

Original: 4.1. LVC A RCHITECTURE C OMPARISON
Revised: 4.1. LVC A RCHITECTURE C OMPARISON

Original: For this experiment, we compare HOF with LVC decoder architectures proposed in the literature, speciﬁcally those used in DeepSDF (Park et al., 2019) and FoldingNet (Yang et al., 2018), as well as several other baselines.
Revised: For this experiment, we compare HOF with LVC decoder architectures proposed in the literature, speciﬁcally those used in DeepSDF (Park et al., 2019) and FoldingNet (Yang et al., 2018), as well as several other baselines.

Original: Each architecture maps points from R c to R 3 in order to enable a direct comparison.
Revised: Each architecture maps points from R c to R 3 in order to enable a direct comparison.

Original: The dataset contains 31773 ground truth point cloud models for training/validation and 7926 for testing.
Revised: The dataset contains 31773 ground truth point cloud models for training/validation and 7926 for testing.

Original: For each point cloud, there are 24 RGB renderings of the object from a ﬁxed set of 24 camera positions.
Revised: For each point cloud, there are 24 RGB renderings of the object from a ﬁxed set of 24 camera positions.

Original: For both training and testing, each point cloud is shifted so that its bounding box center is at the origin in line with Fan et al.
Revised: For both training and testing, each point cloud is shifted so that its bounding box center is at the origin in line with Fan et al.

Original: At test time, there is no post-processing performed on the predicted point cloud .
Revised: At test time, there is no post-processing performed on the predicted point cloud .

Original: The architectures we compare in this experiment are:
Revised: The architectures we compare in this experiment are:

Original: HOF-1: 1 hidden layer containing 1024 hidden neurons 2.
Revised: HOF-1: 1 hidden layer containing 1024 hidden neurons 2.

Original: HOF-3: 3 hidden layers containing 128 hidden neurons 3.
Revised: HOF-3: 3 hidden layers containing 128 hidden neurons 3.

Original: DeepSDF as described in Park et al.
Revised: DeepSDF as described in Park et al.

Original: (2019), with 8 hidden layers
Revised: (2019), with 8 hidden layers

Original: containing 512 neurons each
Revised: containing 512 neurons each

Original: FoldingNet as described in Yang et al.
Revised: FoldingNet as described in Yang et al.

Original: (2018), with 2 successive ‘folds’, each with a 3-layer MLP with 512 hidden neurons 5.
Revised: (2018), with 2 successive ‘folds’, each with a 3-layer MLP with 512 hidden neurons 5.

Original: EPCG architecture as reported in Lin et al.
Revised: EPCG architecture as reported in Lin et al.

Original: Point Set Generation network (Fan et al., 2017) as reported in Lin et al.
Revised: Point Set Generation network (Fan et al., 2017) as reported in Lin et al.

Original: 3D-R2N2 (Choy et al., 2016) as reported in Lin et al.
Revised: 3D-R2N2 (Choy et al., 2016) as reported in Lin et al.

Original: Results are reported in Table 1.
Revised: Results are reported in Table 1.

Original: Chamfer Distance scores are scaled by 100 as in line with Lin et al.
Revised: Chamfer Distance scores are scaled by 100 as in line with Lin et al.

Original: We ﬁnd that HOF performs signiﬁcantly better than that direct decoding baseline of
Revised: We ﬁnd that HOF performs signiﬁcantly better than that direct decoding baseline of

Original: Lin et al.
Revised: Lin et al.

Original: (2018) and performs on par with other contextual mapping approaches with 30 × fewer parameters.
Revised: (2018) and performs on par with other contextual mapping approaches with 30 × fewer parameters.

Original: In order to provide a fair comparison with the baseline method, we ensure that ground truth objects are scaled identically to those in Lin et al.
Revised: In order to provide a fair comparison with the baseline method, we ensure that ground truth objects are scaled identically to those in Lin et al.

Original: We report both ‘forward’ Chamfer distance CD(Pred, Target) and ‘backward’ Chamfer distance CD(Target, Pred), again in line with the convention established by Lin et al.
Revised: We report both ‘forward’ Chamfer distance CD(Pred, Target) and ‘backward’ Chamfer distance CD(Target, Pred), again in line with the convention established by Lin et al.

Original: Table 7 contains a class-wise breakdown.
Revised: Table 7 contains a class-wise breakdown.

Original: Qualitative comparisons of the outputs of HOF with state-of-the-art architectures are shown in Figure 2.
Revised: Qualitative comparisons of the outputs of HOF with state-of-the-art architectures are shown in Figure 2.

Original: 4.1. S HAPE N ET B READTH C OMPARISON
Revised: 4.1. S HAPE N ET B READTH C OMPARISON

Original: Tatarchenko et al.
Revised: Tatarchenko et al.

Original: (2019) question the common practice in single-view 3D reconstruction of evaluating only on the largest classes of ShapeNet.
Revised: (2019) question the common practice in single-view 3D reconstruction of evaluating only on the largest classes of ShapeNet.

Original: The authors demonstrate that reconstruction
Revised: The authors demonstrate that reconstruction

Original: Higher is better.
Revised: Higher is better.

Original: [Table]
Revised: [Table]

Original: methods do not exhibit performance correlated with the size of object classes, and thus evaluating on smaller
Revised: methods do not exhibit performance correlated with the size of object classes, and thus evaluating on smaller

Original: ShapeNet classes is justiﬁed.
Revised: ShapeNet classes is justiﬁed.

Original: We use the dataset provided by Tatarchenko et al.
Revised: We use the dataset provided by Tatarchenko et al.

Original: (2019), which includes 55 classes from the ShapeNet dataset.
Revised: (2019), which includes 55 classes from the ShapeNet dataset.

Original: The authors also suggest using the F1 score metric, deﬁned as the harmonic mean between precision and recall (Tatarchenko et al., 2019).
Revised: The authors also suggest using the F1 score metric, deﬁned as the harmonic mean between precision and recall (Tatarchenko et al., 2019).

Original: We include comparisons with AtlasNet (Groueix et al., 2018), Octree Generating Networks (Tatarchenko et al., 2017), Matryoshka Networks (Richter and Roth, 2018), and retrieval baselines as reported by Tatarchenko et al.
Revised: We include comparisons with AtlasNet (Groueix et al., 2018), Octree Generating Networks (Tatarchenko et al., 2017), Matryoshka Networks (Richter and Roth, 2018), and retrieval baselines as reported by Tatarchenko et al.

Original: We ﬁnd that HOF performs competitively with all of these state-of-the-art methods, even surpassing them on many classes.
Revised: We ﬁnd that HOF performs competitively with all of these state-of-the-art methods, even surpassing them on many classes.

Original: We show summary statistics in Table 2.
Revised: We show summary statistics in Table 2.

Original: The F1 column contains the average F1 score for each method, uniformly averaging over all classes regardless of how class imbalances in the testing set.
Revised: The F1 column contains the average F1 score for each method, uniformly averaging over all classes regardless of how class imbalances in the testing set.

Original: The cw-F score column averages over class F1 scores weighted by the fraction of the dataset comprised by that class; that is, classes that are over-represented in the testing set are correspondingly over-represented in the cw-F1 score.
Revised: The cw-F score column averages over class F1 scores weighted by the fraction of the dataset comprised by that class; that is, classes that are over-represented in the testing set are correspondingly over-represented in the cw-F1 score.

Original: On the mean F1 metric, HOF outperforms all other methods, including the ‘Oracle
Revised: On the mean F1 metric, HOF outperforms all other methods, including the ‘Oracle

Original: Nearest-Neighbor’ approach described by Tatarchenko et al.
Revised: Nearest-Neighbor’ approach described by Tatarchenko et al.

Original: The Oracle Nearest Neighbor uses the closest object in the training set as its prediction for each test sample.
Revised: The Oracle Nearest Neighbor uses the closest object in the training set as its prediction for each test sample.

Original: A complete classwise performance breakdown is in the Appendix in Table 8.
Revised: A complete classwise performance breakdown is in the Appendix in Table 8.

Original: We ﬁnd that HOF outperforms allcomparison methods (including the Oracle) in 23 of the 55 classes.
Revised: We ﬁnd that HOF outperforms allcomparison methods (including the Oracle) in 23 of the 55 classes.

Original: Excluding the oracle, HOF shows the best performance in 28 of the 55 classes.
Revised: Excluding the oracle, HOF shows the best performance in 28 of the 55 classes.

Original: 4. R UNTIME P ERFORMANCE C OMPARISON
Revised: 4. R UNTIME P ERFORMANCE C OMPARISON

Original: We compare HOF with the decoder architectures proposed in Park et al.
Revised: We compare HOF with the decoder architectures proposed in Park et al.

Original: (2019) and Yang et al.
Revised: (2019) and Yang et al.

Original: (2018) in terms of inference speed.
Revised: (2018) in terms of inference speed.

Original: Figure 3 shows the results of this experiment, comparing how long it takes for each network to map a set of N samples from the canonical space X into the object reconstruction.
Revised: Figure 3 shows the results of this experiment, comparing how long it takes for each network to map a set of N samples from the canonical space X into the object reconstruction.

Original: We ignore the processing time for estimating the latent state z for DeepSDF/FoldingNet and the function parameters θ for HOF; we use the same convolutional neural network architecture with a modiﬁed output layer for both.
Revised: We ignore the processing time for estimating the latent state z for DeepSDF/FoldingNet and the function parameters θ for HOF; we use the same convolutional neural network architecture with a modiﬁed output layer for both.

Original: We ﬁnd that even for medium-resolution reconstructions (N > 1000), the GPU running times for the DeepSDF/FoldingNet architectures and HOF begin to diverge.
Revised: We ﬁnd that even for medium-resolution reconstructions (N > 1000), the GPU running times for the DeepSDF/FoldingNet architectures and HOF begin to diverge.

Original: This difference is even more noticeable in the CPU running time comparison (an almost 100 × difference).
Revised: This difference is even more noticeable in the CPU running time comparison (an almost 100 × difference).

Original: This performance improvement may be signiﬁcant for embedded systems that need to efﬁciently store and reconstruct 3D objects in real time; our representation is small in size, straightforward to sample uniformly (unlike a CAD model), and fast to evaluate.
Revised: This performance improvement may be signiﬁcant for embedded systems that need to efﬁciently store and reconstruct 3D objects in real time; our representation is small in size, straightforward to sample uniformly (unlike a CAD model), and fast to evaluate.

Original: 4. O BJECT I NTERPOLATION
Revised: 4. O BJECT I NTERPOLATION

Original: To demonstrate that our functional representation yields an expressive latent object space, we show that the composition of these functions produces interesting, new objects.
Revised: To demonstrate that our functional representation yields an expressive latent object space, we show that the composition of these functions produces interesting, new objects.

Original: The top of Figure 4 shows in detail the composition procedure.
Revised: The top of Figure 4 shows in detail the composition procedure.

Original: If we have estimated 2-mappings for two objects O A and O B , we demonstrate that f θ A ( f θ B ( X )) and f θ B ( f θ A ( X )) both provide interesting mixtures of the two objects and mix the features of the objects in different ways; the functions are not commutative.
Revised: If we have estimated 2-mappings for two objects O A and O B , we demonstrate that f θ A ( f θ B ( X )) and f θ B ( f θ A ( X )) both provide interesting mixtures of the two objects and mix the features of the objects in different ways; the functions are not commutative.

Original: This approach is conceptually distinct from other object interpolation methods, which decode the interpolation of two different latent vectors.
Revised: This approach is conceptually distinct from other object interpolation methods, which decode the interpolation of two different latent vectors.

Original: In our formulation, we visualize the outputs of an encoder that has been trained to output 2-mappings in R 3 .
Revised: In our formulation, we visualize the outputs of an encoder that has been trained to output 2-mappings in R 3 .

Original: In addition, the bottom of Figure 4 demonstrates a smooth gradient of compositions of the reconstruction functions for two airplanes, when a higher order of mappings ( k = 4 ) is used.
Revised: In addition, the bottom of Figure 4 demonstrates a smooth gradient of compositions of the reconstruction functions for two airplanes, when a higher order of mappings ( k = 4 ) is used.

Original: To further convey the expressiveness of the composition-based object interpolation, we compare it against a method that performs interpolation in the network parameter space.
Revised: To further convey the expressiveness of the composition-based object interpolation, we compare it against a method that performs interpolation in the network parameter space.

Original: This latter approach resembles a common way of performing object interpolation in LVC methods: Generate latent codewords from each image, and synthesize new objects by feeding the interpolated latent vectors into the decoder.
Revised: This latter approach resembles a common way of performing object interpolation in LVC methods: Generate latent codewords from each image, and synthesize new objects by feeding the interpolated latent vectors into the decoder.

Original: As a proxy for the latent vector interpolation used in LVC methods, we generate new objects as follows.
Revised: As a proxy for the latent vector interpolation used in LVC methods, we generate new objects as follows.

Original: After outputting the network parameters θ A and θ B for the objects O A and
Revised: After outputting the network parameters θ A and θ B for the objects O A and

Original: O B , we use the interpolated parameters θ (cid:48)
Revised: O B , we use the interpolated parameters θ (cid:48)

Original: = ( θ A + θ B ) / 2 to represent the mapping function.
Revised: = ( θ A + θ B ) / 2 to represent the mapping function.

Original: In
Revised: In

Original: Figure 7, we show that our composition-based interpolation is more capable of generating coherent new objects whose geometric features inherited from the source objects are preserved better.
Revised: Figure 7, we show that our composition-based interpolation is more capable of generating coherent new objects whose geometric features inherited from the source objects are preserved better.

Original:  C ONCLUSION AND F UTURE W ORK
Revised:  C ONCLUSION AND F UTURE W ORK

Original: We presented Higher Order Function Networks (HOF), which generate a functional representation of an object from an RGB image.
Revised: We presented Higher Order Function Networks (HOF), which generate a functional representation of an object from an RGB image.

Original: The function can be represented as a small MLP with ‘fast-weights’, or weights that are output by an encoder network g φ with learned, ﬁxed weights.
Revised: The function can be represented as a small MLP with ‘fast-weights’, or weights that are output by an encoder network g φ with learned, ﬁxed weights.

Original: HOF demonstrates state-of-the-art reconstruction quality, as measured by Chamfer distance and F1 score with ground truth models, with far fewer decoder parameters than existing methods.
Revised: HOF demonstrates state-of-the-art reconstruction quality, as measured by Chamfer distance and F1 score with ground truth models, with far fewer decoder parameters than existing methods.

Original: Additionally, we extended contextual mapping methods to allow for interpolation between objects by composing the roots of their corresponding mapping functions.
Revised: Additionally, we extended contextual mapping methods to allow for interpolation between objects by composing the roots of their corresponding mapping functions.

Original: Another advantage of HOF is that points on the surface can be sampled directly, without expensive post-processing methods such as estimating level sets.
Revised: Another advantage of HOF is that points on the surface can be sampled directly, without expensive post-processing methods such as estimating level sets.

Original: For future work, we would like to further improve on the parameter-efﬁciency of HOF, for example with versions of HOF that output only a sparse but ﬂexible subset of the parameters of the mapping function.
Revised: For future work, we would like to further improve on the parameter-efﬁciency of HOF, for example with versions of HOF that output only a sparse but ﬂexible subset of the parameters of the mapping function.

Original: In addition, connections with other works investigating the properties of ‘high-quality’
Revised: In addition, connections with other works investigating the properties of ‘high-quality’

Original: Bottom neural network parameters and initializations such as HyperNetworks (Ha et al., 2016), the Lottery
Revised: Bottom neural network parameters and initializations such as HyperNetworks (Ha et al., 2016), the Lottery

Original: Ticket Hypothesis (Frankle and Carbin, 2018), and model-agnostic meta learning (Finn et al., 2017).
Revised: Ticket Hypothesis (Frankle and Carbin, 2018), and model-agnostic meta learning (Finn et al., 2017).

Original: There are also many interesting applications of HOF in domains such as robotics.
Revised: There are also many interesting applications of HOF in domains such as robotics.

Original: A demonstrative application in motion planning can be found in Appendix B.2.2, and Engin et al.
Revised: A demonstrative application in motion planning can be found in Appendix B.2.2, and Engin et al.

Original: (2020) explore extensions of HOF for multi-view reconstruction and motion planning.
Revised: (2020) explore extensions of HOF for multi-view reconstruction and motion planning.

Original: Using functional representations directly for example for manipulation or navigation tasks, rather than generating intermediate 3D point clouds, is also an interesting avenue of future work.
Revised: Using functional representations directly for example for manipulation or navigation tasks, rather than generating intermediate 3D point clouds, is also an interesting avenue of future work.

Original: We hope that the ideas presented in this paper provides a basis for future developments of efﬁcient 3D object representations and neural network architectures.
Revised: We hope that the ideas presented in this paper provides a basis for future developments of efﬁcient 3D object representations and neural network architectures.

Original: R
Revised: R

Original: A A DDITIONAL E XPERIMENTS A. A RCHITECTURAL V ARIATIONS
Revised: A A DDITIONAL E XPERIMENTS A. A RCHITECTURAL V ARIATIONS

Original: We compare HOF trained on the subset of ShapeNet used in Lin et al.
Revised: We compare HOF trained on the subset of ShapeNet used in Lin et al.

Original: (2018) with several architectural variations, including using Resnet18 rather than our own encoder architecture, using a fast-weights decoder architecture with 6, rather than 3, hidden layers, and using tanh rather than relu in the fast-weights decoder.
Revised: (2018) with several architectural variations, including using Resnet18 rather than our own encoder architecture, using a fast-weights decoder architecture with 6, rather than 3, hidden layers, and using tanh rather than relu in the fast-weights decoder.

Original: Results are summarized in Table 3.
Revised: Results are summarized in Table 3.

Original: We ﬁnd that HOF is competitive in all of the formulations, although using the tanh activation function in the decoder function instead of the relu shows a small degradation in performance.
Revised: We ﬁnd that HOF is competitive in all of the formulations, although using the tanh activation function in the decoder function instead of the relu shows a small degradation in performance.

Original: Future work might investigate more deeply what principles underlie the design of fast-weights architectures
Revised: Future work might investigate more deeply what principles underlie the design of fast-weights architectures

Original: [Table]
Revised: [Table]

Original: [Table]
Revised: [Table]

Original: A. T HE R OLE OF THE S AMPLING D OMAIN
Revised: A. T HE R OLE OF THE S AMPLING D OMAIN

Original: In the experimental results reported in the main paper
Revised: In the experimental results reported in the main paper

Original: [Table]
Revised: [Table]

Original: we sample input points from the interior of the unit sphere uniformly at random.
Revised: we sample input points from the interior of the unit sphere uniformly at random.

Original: However, we might sample other topologies as input to the mapping function.
Revised: However, we might sample other topologies as input to the mapping function.

Original: In this experiment
Revised: In this experiment

Original: [Table]
Revised: [Table]

Original: we compare the performance of HOF when we sample from the interior of the 3D sphere (standard conﬁguration), the surface of the 3D sphere, the interior of the 3D cube, and the interior of the 4D sphere.
Revised: we compare the performance of HOF when we sample from the interior of the 3D sphere (standard conﬁguration), the surface of the 3D sphere, the interior of the 3D cube, and the interior of the 4D sphere.

Original: [Table]
Revised: [Table]

Original: A. C OMPARING D IFFERENT V ALUES OF K FOR C OMPOSITION
Revised: A. C OMPARING D IFFERENT V ALUES OF K FOR C OMPOSITION

Original: Here, we compare the performance of various instances of HOF when we vary the value of k , or number of self-compositions.
Revised: Here, we compare the performance of various instances of HOF when we vary the value of k , or number of self-compositions.

Original: We use the HOF-1 decoder architecture (1 hidden layer withneurons) and a Resnet18 encoder architecture.
Revised: We use the HOF-1 decoder architecture (1 hidden layer withneurons) and a Resnet18 encoder architecture.

Original: This encoder architecture is different from the baseline encoder used for the results in Table 1, which explains deviations in performance from those numbers.
Revised: This encoder architecture is different from the baseline encoder used for the results in Table 1, which explains deviations in performance from those numbers.

Original: Although performance does not vary signiﬁcantly, there are some differences in reconstruction quality across values of k .
Revised: Although performance does not vary signiﬁcantly, there are some differences in reconstruction quality across values of k .

Original: Future work might investigate how best to take use of self-compositional or recurrent decoder architectures to maximize both computational performance as well as accuracy.
Revised: Future work might investigate how best to take use of self-compositional or recurrent decoder architectures to maximize both computational performance as well as accuracy.

Original: [Table]
Revised: [Table]

Original: A. P ROJECTION R EGULARIZATION
Revised: A. P ROJECTION R EGULARIZATION

Original: Intuitively, we might expect that f θ ( X ) would approximate the Euclidean projection function; e.g. f θ ( X ) ≈ Proj Y
Revised: Intuitively, we might expect that f θ ( X ) would approximate the Euclidean projection function; e.g. f θ ( X ) ≈ Proj Y

Original: ( X ) .
Revised: ( X ) .

Original: However, qualitatively, we ﬁnd that this is not the case.
Revised: However, qualitatively, we ﬁnd that this is not the case.

Original: Our mapping f θ learns a less interpretable mapping from the canonical set X to the object O .
Revised: Our mapping f θ learns a less interpretable mapping from the canonical set X to the object O .

Original: In order to encourage the mapping to produce a more interpretable mapping from the canonical set X to the object O , we can regularize the transform f θ to penalize the ‘distance traveled’ of points transformed by f θ .
Revised: In order to encourage the mapping to produce a more interpretable mapping from the canonical set X to the object O , we can regularize the transform f θ to penalize the ‘distance traveled’ of points transformed by f θ .

Original: A regularization term with a small coefﬁcient ( λ = 0 . 01 ) is effective in encouraging this behavior.
Revised: A regularization term with a small coefﬁcient ( λ = 0 . 01 ) is effective in encouraging this behavior.

Original: Making this change results in little deviation in performance, while providing a more coherent mapping.
Revised: Making this change results in little deviation in performance, while providing a more coherent mapping.

Original: Figure 5 highlights this distinction.
Revised: Figure 5 highlights this distinction.

Original: This penalty for the mapping computed by f θ I for each point in the sample ˜ X is given as
Revised: This penalty for the mapping computed by f θ I for each point in the sample ˜ X is given as

Original: [Equation]
Revised: [Equation]

Original: where ˜ X is a sample from the canonical set X .
Revised: where ˜ X is a sample from the canonical set X .

Original: We might instead directly penalize the difference between f θ I and the Euclidean projection over the sampled set ˜ X as:
Revised: We might instead directly penalize the difference between f θ I and the Euclidean projection over the sampled set ˜ X as:

Original: [Equation]
Revised: [Equation]

Original: However, we ﬁnd that this regularization can be overly constraining, for example in cases where points are sampled near the boundaries of the Voronoi tesellation of the target point cloud.
Revised: However, we ﬁnd that this regularization can be overly constraining, for example in cases where points are sampled near the boundaries of the Voronoi tesellation of the target point cloud.

Original: The formulation in Equation 6 gives the mapping greater ﬂexibility while still giving the desired semantics.
Revised: The formulation in Equation 6 gives the mapping greater ﬂexibility while still giving the desired semantics.

Original: A. C OLLISION - FREE P ATH G ENERATION
Revised: A. C OLLISION - FREE P ATH G ENERATION

Original: From Chamfer distance or F1 scores alone, it is difﬁcult to determine if one method’s reconstruction quality is meaningfully different from another’s.
Revised: From Chamfer distance or F1 scores alone, it is difﬁcult to determine if one method’s reconstruction quality is meaningfully different from another’s.

Original: In this section, we introduce a new benchmark to evaluate the practical implications of using 3D reconstructions for collision-free path generation.
Revised: In this section, we introduce a new benchmark to evaluate the practical implications of using 3D reconstructions for collision-free path generation.

Original: We compare the reconstructions of HOF with Lin et al.
Revised: We compare the reconstructions of HOF with Lin et al.

Original: (2018), which is the most competitive direct decoding method according to Table 1.
Revised: (2018), which is the most competitive direct decoding method according to Table 1.

Original: This experiment is intended to give an additional perspective on what a difference in average Chamfer distance to the ground truth object means.
Revised: This experiment is intended to give an additional perspective on what a difference in average Chamfer distance to the ground truth object means.

Original: We show that given an RGB image, we can efﬁciently ﬁnd a near-optimal path
Revised: We show that given an RGB image, we can efﬁciently ﬁnd a near-optimal path

Original: ˆ P between two points around the bounding sphere of the object without colliding with it, and without taking a path much longer than the optimal path P ∗ , where the optimal path is deﬁned as the shortest collision-free path between two given points.
Revised: ˆ P between two points around the bounding sphere of the object without colliding with it, and without taking a path much longer than the optimal path P ∗ , where the optimal path is deﬁned as the shortest collision-free path between two given points.

Original: A complete deﬁnition of the experiment and its implementation are given in
Revised: A complete deﬁnition of the experiment and its implementation are given in

Original: Section B.2.2.
Revised: Section B.2.2.

Original: We quantify the quality of our predictions by measuring both i ) the proportion of predicted paths ˆ P that are collision-free and ii ) the average ratio of the length of a collision-free estimated path ˆ P and the corresponding optimal path P ∗ .
Revised: We quantify the quality of our predictions by measuring both i ) the proportion of predicted paths ˆ P that are collision-free and ii ) the average ratio of the length of a collision-free estimated path ˆ P and the corresponding optimal path P ∗ .

Original: These two metrics conceptually mirror the backward and forward Chamfer distance metrics, respectively; a low collision rate corresponds to few missing structures in the reconstructed object (backward Chamfer, or surface coverage), while successful paths close to the optimal path length correspond to few extraneous structures in the reconstruction (forward Chamfer, or shape similarity).
Revised: These two metrics conceptually mirror the backward and forward Chamfer distance metrics, respectively; a low collision rate corresponds to few missing structures in the reconstructed object (backward Chamfer, or surface coverage), while successful paths close to the optimal path length correspond to few extraneous structures in the reconstruction (forward Chamfer, or shape similarity).

Original: We ﬁnd that HOF provides meaningful gains over the reconstruction method recently proposed in Lin et al.
Revised: We ﬁnd that HOF provides meaningful gains over the reconstruction method recently proposed in Lin et al.

Original: (2018) in the context of path planning around the reconstructed model.
Revised: (2018) in the context of path planning around the reconstructed model.

Original: HOF performs signiﬁcantly better both in terms of path length as well as collision rate.
Revised: HOF performs signiﬁcantly better both in terms of path length as well as collision rate.

Original: However, although in Lin et al.
Revised: However, although in Lin et al.

Original: (2018) results were reported on the reconstruction task with objects in a canonical frame, in the context of robotics, learning in a viewer-centric frame is necessary.
Revised: (2018) results were reported on the reconstruction task with objects in a canonical frame, in the context of robotics, learning in a viewer-centric frame is necessary.

Original: It has been noted in Wu et al.
Revised: It has been noted in Wu et al.

Original: (2018) that generalization might be easier when learning reconstruction in a viewer-oriented frame.
Revised: (2018) that generalization might be easier when learning reconstruction in a viewer-oriented frame.

Original: We test this theory by training on both objects in their canonical frame as well as in the ‘camera’ frame.
Revised: We test this theory by training on both objects in their canonical frame as well as in the ‘camera’ frame.

Original: We rotate each point cloud Y into its camera frame orientation using the azimuth and elevation values for each image.
Revised: We rotate each point cloud Y into its camera frame orientation using the azimuth and elevation values for each image.

Original: We rotate the point cloud about the origin, keeping the bounding box centered at (0,0,0).
Revised: We rotate the point cloud about the origin, keeping the bounding box centered at (0,0,0).

Original: Trained and tested in the viewer-centric camera frame, HOF performs even better than in the canonical frame, giving Chamfer distance scores of 1.486 / 0.979 (compared with 1.534 / 1.046 for the canonical frame).
Revised: Trained and tested in the viewer-centric camera frame, HOF performs even better than in the canonical frame, giving Chamfer distance scores of 1.486 / 0.979 (compared with 1.534 / 1.046 for the canonical frame).

Original: The most notably improved classes in the viewer-centric evaluation are cabinets and loudspeakers; it is intuitive that these particularly ‘boxy’ objects might be better reconstructed in a viewer-centric frame, as their symmetric nature might make it difﬁcult to identify their canonical frame from a single image.
Revised: The most notably improved classes in the viewer-centric evaluation are cabinets and loudspeakers; it is intuitive that these particularly ‘boxy’ objects might be better reconstructed in a viewer-centric frame, as their symmetric nature might make it difﬁcult to identify their canonical frame from a single image.

Original: Results of this comparison, as well as other ablation studies, are reported in Supplementary Tablesand 4.
Revised: Results of this comparison, as well as other ablation studies, are reported in Supplementary Tablesand 4.

Original: The path quality performances of the baseline metrics, EPCG Lin et al.
Revised: The path quality performances of the baseline metrics, EPCG Lin et al.

Original: and HOF are presented in Table 6.
Revised: and HOF are presented in Table 6.

Original: [Table]
Revised: [Table]

Original: A. P ARAMETER I NTERPOLATION VS F UNCTION C OMPOSITION
Revised: A. P ARAMETER I NTERPOLATION VS F UNCTION C OMPOSITION

Original: In order to illustrate the non-trivial mappings learned by HOF for k >
Revised: In order to illustrate the non-trivial mappings learned by HOF for k >

Original: [Table]
Revised: [Table]

Original: we compare the reconstructions acquired from interpolating naively between decoder parameters of two different objects and the reconstructions acquired by composing the two reconstruction functions.
Revised: we compare the reconstructions acquired from interpolating naively between decoder parameters of two different objects and the reconstructions acquired by composing the two reconstruction functions.

Original: Results are shown in
Revised: Results are shown in

Original: Figure 7.
Revised: Figure 7.

Original: We see that the composition-based interpolation preserves some geometric features such as chair legs, car roof and airplane wings
Revised: We see that the composition-based interpolation preserves some geometric features such as chair legs, car roof and airplane wings

Original: Direct interpolation of the network parameters fails to meaningfully capture features from the objects
Revised: Direct interpolation of the network parameters fails to meaningfully capture features from the objects

Original: A. F ULL C LASS B REAKDOWN FOR LVC E XPERIMENT C HAMFER D ISTANCE SCORES
Revised: A. F ULL C LASS B REAKDOWN FOR LVC E XPERIMENT C HAMFER D ISTANCE SCORES

Original: Table 7 shows class-wise Chamfer Distances for HOF and the baseline methods in the LVC experiment.
Revised: Table 7 shows class-wise Chamfer Distances for HOF and the baseline methods in the LVC experiment.

Original: [Table]
Revised: [Table]

Original: A. F ULL C LASS B REAKDOWN FOR B ROAD E XPERIMENT F1 S CORES
Revised: A. F ULL C LASS B REAKDOWN FOR B ROAD E XPERIMENT F1 S CORES

Original: Table 8 shows class-wise performance of HOF as well as each method compared in the broad
Revised: Table 8 shows class-wise performance of HOF as well as each method compared in the broad

Original: ShapeNet comparison as reported by Tatarchenko et al.
Revised: ShapeNet comparison as reported by Tatarchenko et al.

Original: [Table]
Revised: [Table]

Original: B T RAINING /T ESTING D ATASET AND I MPLEMENTATION D ETAILS
Revised: B T RAINING /T ESTING D ATASET AND I MPLEMENTATION D ETAILS

Original: In the reconstruction experiment, Chamfer Distance scores are scaled up by 100 as in Lin et al.
Revised: In the reconstruction experiment, Chamfer Distance scores are scaled up by 100 as in Lin et al.

Original: (2018) for easier comparison.
Revised: (2018) for easier comparison.

Original: For the numbers reported in Table 7, we use the best performance of 3d-r2n2 (5 views as reported in Lin et al.
Revised: For the numbers reported in Table 7, we use the best performance of 3d-r2n2 (5 views as reported in Lin et al.

Original: In comparing with methods like FoldingNet
Revised: In comparing with methods like FoldingNet

Original: Yang et al.
Revised: Yang et al.

Original: and DeepSDF Park et al.
Revised: and DeepSDF Park et al.

Original: (2019), we focus on efﬁciency of representation rather than reconstruction quality.
Revised: (2019), we focus on efﬁciency of representation rather than reconstruction quality.

Original: The performance comparison in Figure 3 and the ablation experiment in Tables 3 attempt to compare these architectures in this way (FoldingNet is a slightly shallower version of the DeepSDF architecture; 6 rather than 8 fully-connected layers).
Revised: The performance comparison in Figure 3 and the ablation experiment in Tables 3 attempt to compare these architectures in this way (FoldingNet is a slightly shallower version of the DeepSDF architecture; 6 rather than 8 fully-connected layers).

Original: B. D ATASET
Revised: B. D ATASET

Original: We use two different datasets for evaluation.
Revised: We use two different datasets for evaluation.

Original: First, in Table 1, we use the ShapeNet train/validation/test splits of a subset of the ShapeNet dataset (Chang et al., 2015) described in Yan et al.
Revised: First, in Table 1, we use the ShapeNet train/validation/test splits of a subset of the ShapeNet dataset (Chang et al., 2015) described in Yan et al.

Original: The dataset can be downloaded from https://github.com/xcyan/nips16_PTN .
Revised: The dataset can be downloaded from https://github.com/xcyan/nips16_PTN .

Original: Point clouds have 100k points.
Revised: Point clouds have 100k points.

Original: Upon closer inspection, we have found that this subset includes some inconsistent/noisy labels, including:
Revised: Upon closer inspection, we have found that this subset includes some inconsistent/noisy labels, including:

Original: Inconsistency of object interior ﬁlling (e.g. some objects are only surfaces, while some have densely sampled interiors) 2.
Revised: Inconsistency of object interior ﬁlling (e.g. some objects are only surfaces, while some have densely sampled interiors) 2.

Original: Objects with ﬂoating text annotations that are represented in the point cloud model 3.
Revised: Objects with ﬂoating text annotations that are represented in the point cloud model 3.

Original: Objects that are inconsistently small (scaled down by a factor of 5 or more compared to other similar objects)
Revised: Objects that are inconsistently small (scaled down by a factor of 5 or more compared to other similar objects)

Original: Although these types of inconsistencies are rare, they are noteworthy.
Revised: Although these types of inconsistencies are rare, they are noteworthy.

Original: We used them as-is, but future contributions might include both ‘cleaned’ and ‘noisy’ variants of this dataset.
Revised: We used them as-is, but future contributions might include both ‘cleaned’ and ‘noisy’ variants of this dataset.

Original: Learning from noisy labels is an important problem but is orthogonal to 3D reconstruction.
Revised: Learning from noisy labels is an important problem but is orthogonal to 3D reconstruction.

Original: In our second experiment, we use a broader dataset based on ShapeNet, with train and test splits taken from Tatarchenko et al.
Revised: In our second experiment, we use a broader dataset based on ShapeNet, with train and test splits taken from Tatarchenko et al.

Original: The dataset can be downloaded from https://github.com/lmb-freiburg/what3d .
Revised: The dataset can be downloaded from https://github.com/lmb-freiburg/what3d .

Original: B.
Revised: B.

Original: I MPLEMENTATION D ETAILS B.2. N ETWORK A RCHITECTURE AND T RAINING
Revised: I MPLEMENTATION D ETAILS B.2. N ETWORK A RCHITECTURE AND T RAINING

Original: For the problem of 3D reconstruction from an RGB image, which we address here, we represent g φ as a convolutional neural network based on the DenseNet architecture proposed in Huang et al.
Revised: For the problem of 3D reconstruction from an RGB image, which we address here, we represent g φ as a convolutional neural network based on the DenseNet architecture proposed in Huang et al.

Original: We call this our baseline encoder network.
Revised: We call this our baseline encoder network.

Original: The baseline encoder network has 3 dense blocks (each containing 4 convolutional layers) followed by 3 fully connected layers.
Revised: The baseline encoder network has 3 dense blocks (each containing 4 convolutional layers) followed by 3 fully connected layers.

Original: The schedule of feature maps is [16, 32, 64] for the dense blocks.
Revised: The schedule of feature maps is [16, 32, 64] for the dense blocks.

Original: Each fully connected layer contains 1024 neurons.
Revised: Each fully connected layer contains 1024 neurons.

Original: We use two variants of the mapping architecture f θ .
Revised: We use two variants of the mapping architecture f θ .

Original: One, which we call HOF-1, is an MLP withhidden layer containing 1024 neurons.
Revised: One, which we call HOF-1, is an MLP withhidden layer containing 1024 neurons.

Original: A second version, HOF-3, is an MLP with 3 hidden layers, each containing 128 hidden units.
Revised: A second version, HOF-3, is an MLP with 3 hidden layers, each containing 128 hidden units.

Original: Both formulations use the ReLU activation function Glorot et al.
Revised: Both formulations use the ReLU activation function Glorot et al.

Original: Because g φ and f θ are all differentiable almost everywhere, we can train the entire system end-to-end with backpropagation.
Revised: Because g φ and f θ are all differentiable almost everywhere, we can train the entire system end-to-end with backpropagation.

Original: We use the Adam Optimizer with learning rate 1e-5 and batch size 1, training for 4 epochs for all experiments (1 epoch ≈ 725k parameter updates).
Revised: We use the Adam Optimizer with learning rate 1e-5 and batch size 1, training for 4 epochs for all experiments (1 epoch ≈ 725k parameter updates).

Original: Training HOF from scratch took roughly 36 hours.
Revised: Training HOF from scratch took roughly 36 hours.

Original: B.2. P ATH P LANNING E XPERIMENT
Revised: B.2. P ATH P LANNING E XPERIMENT

Original: We use the class ‘chair’ from the dataset described in Section 4.1 in our experiments.
Revised: We use the class ‘chair’ from the dataset described in Section 4.1 in our experiments.

Original: The objects from this class have considerable variation and complexity in shape, thus they are useful for evaluating the quality of the generated paths.
Revised: The objects from this class have considerable variation and complexity in shape, thus they are useful for evaluating the quality of the generated paths.

Original: Path planning is performed in a three dimensional grid environment.
Revised: Path planning is performed in a three dimensional grid environment.

Original: All the objects in our dataset ﬁt inside the unit cube.
Revised: All the objects in our dataset ﬁt inside the unit cube.

Original: Given the predicted point cloud of an object, we ﬁrst voxelize the points by constructing an occupancy map V = n × n × n centered at the origin of the object with voxel size 2 /n .
Revised: Given the predicted point cloud of an object, we ﬁrst voxelize the points by constructing an occupancy map V = n × n × n centered at the origin of the object with voxel size 2 /n .

Original: Next, we generate start and end points as follows.
Revised: Next, we generate start and end points as follows.

Original: We choose a unit vector v sampled uniformly at random and compute d = n/ 2 · v / ||
Revised: We choose a unit vector v sampled uniformly at random and compute d = n/ 2 · v / ||

Original: v || 1 .
Revised: v || 1 .

Original: We use the end points of d and − d as the start and goal locations.
Revised: We use the end points of d and − d as the start and goal locations.

Original: For each method, we generate the paths with the A* algorithm using the voxelization of the predicted point clouds as obstacles, and the sampled start and goal positions.
Revised: For each method, we generate the paths with the A* algorithm using the voxelization of the predicted point clouds as obstacles, and the sampled start and goal positions.

Original: The movement is rectilinear in the voxel space and the distances are measured with the L 1 metric.
Revised: The movement is rectilinear in the voxel space and the distances are measured with the L 1 metric.

Original: In the experiments we use an occupancy grid of size 32 × 32 × 32 , and sample 100 start and goal location pairs per model.
Revised: In the experiments we use an occupancy grid of size 32 × 32 × 32 , and sample 100 start and goal location pairs per model.

Original: In addition to the paths generated using the predictions from the EPCG Lin et al.
Revised: In addition to the paths generated using the predictions from the EPCG Lin et al.

Original: (2018) and HOF methods, we present two other baselines (Figure 8).
Revised: (2018) and HOF methods, we present two other baselines (Figure 8).

Original: The ﬁrst baseline Shortest L 1 outputs the shortest path with the L 1 metric ignoring the obstacles in the scene, and the second baseline Shortest Around
Revised: The ﬁrst baseline Shortest L 1 outputs the shortest path with the L 1 metric ignoring the obstacles in the scene, and the second baseline Shortest Around

Original: Bounding Box ( SABB ) takes the bounding box of the ground truth voxels as the environment to generate the path.
Revised: Bounding Box ( SABB ) takes the bounding box of the ground truth voxels as the environment to generate the path.

Original: We present the path generation results in Table 6.
Revised: We present the path generation results in Table 6.

Original: The baseline Shortest L 1 gives the optimal solution when the path is collision-free.
Revised: The baseline Shortest L 1 gives the optimal solution when the path is collision-free.

Original: However, since most of the shortest paths go through the object, this baseline has a poor success rate performance.
Revised: However, since most of the shortest paths go through the object, this baseline has a poor success rate performance.

Original: In contrast, SABB output paths are always collision-free as the shortest path is computed using the bounding box of the true voxelization as the obstacles in the environment.
Revised: In contrast, SABB output paths are always collision-free as the shortest path is computed using the bounding box of the true voxelization as the obstacles in the environment.

Original: The length of the paths generated by SABB are longer compared to the rest of the methods since the produced paths are ‘cautious’ to not collide with the object.
Revised: The length of the paths generated by SABB are longer compared to the rest of the methods since the produced paths are ‘cautious’ to not collide with the object.

Original: These two baselines are the best performers for the metric they are designed for, yet they suffer from the complementary metric.
Revised: These two baselines are the best performers for the metric they are designed for, yet they suffer from the complementary metric.

Original: Our method on the other hand achieves almost optimal results in both metrics due to the good quality reconstructions.
Revised: Our method on the other hand achieves almost optimal results in both metrics due to the good quality reconstructions.

Original: B.2. C OMPUTING E NVIRONMENT
Revised: B.2. C OMPUTING E NVIRONMENT

Original: All GPU experiments were performed on NVIDIA GTX 1080 Ti GPUs.
Revised: All GPU experiments were performed on NVIDIA GTX 1080 Ti GPUs.

Original: The CPU running times were computed
Revised: The CPU running times were computed

Original: [Table]
Revised: [Table]

Original: cellular 0.
Revised: cellular 0.

Original: chair 0.
Revised: chair 0.

Original: clock 0.
Revised: clock 0.

Original: dishwasher 0.
Revised: dishwasher 0.

Original: display 0.
Revised: display 0.

Original: earphone 0.
Revised: earphone 0.

Original: faucet 0.
Revised: faucet 0.

Original: ﬁle 0.
Revised: ﬁle 0.

Original: guitar 0.
Revised: guitar 0.

Original: helmet 0.
Revised: helmet 0.

Original: jar 0. keyboard 0.
Revised: jar 0. keyboard 0.

Original: knife 0.
Revised: knife 0.

Original: lamp 0.
Revised: lamp 0.

Original: laptop 0.
Revised: laptop 0.

Original: loudspeaker 0.
Revised: loudspeaker 0.

Original: mailbox 0.
Revised: mailbox 0.

Original: microphone 0.
Revised: microphone 0.

Original: microwave 0.
Revised: microwave 0.

Original: motorcycle 0.
Revised: motorcycle 0.

Original: mug 0.
Revised: mug 0.

Original: piano 0.
Revised: piano 0.

Original: pillow 0.
Revised: pillow 0.

Original: pistol 0.
Revised: pistol 0.

Original: pot 0.
Revised: pot 0.

Original: printer 0.
Revised: printer 0.

Original: remote 0.
Revised: remote 0.

Original: riﬂe 0.
Revised: riﬂe 0.

Original: rocket 0.
Revised: rocket 0.

Original: skateboard 0.
Revised: skateboard 0.

Original: sofa
Revised: sofa

Original: [Table]
Revised: [Table]

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

Original: stove
Revised: stove

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

Original: table
Revised: table

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

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

Original: telephone 0.
Revised: telephone 0.

Original: tower 0.
Revised: tower 0.

Original: train 0.
Revised: train 0.

Original: vessel 0.
Revised: vessel 0.

Original: washer 0.
Revised: washer 0.